Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The authors describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, they obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree. >
['Pankaj K. Agarwal', 'David Eppstein', 'Jirí Matousek']
I am writing a research paper on a idea Dynamic half-space reporting, geometric optimization, and minimum spanning trees
[{"from": "human", "value": "I am writing a research paper on a idea Dynamic half-space reporting, geometric optimization, and minimum spanning trees"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The authors describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, they obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree. >"}]