Space-efficient approximate Voronoi diagrams
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometric Algorithms for Density-Based Data Clustering
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Finding planar regions in a terrain: in practice and with a guarantree
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Box-trees for collision checking in industrial installations
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Space-time tradeoffs for approximate spherical range counting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Document Ranking by Layout Relevance
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
On the importance of idempotence
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The effect of corners on the complexity of approximate range searching
Proceedings of the twenty-second annual symposium on Computational geometry
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
On approximate range counting and depth
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Snapshots: A Novel Local Surface Descriptor and Matching Algorithm for Robust 3D Surface Alignment
IEEE Transactions on Pattern Analysis and Machine Intelligence
Data Structures for Efficient Dynamic Processing in 3-D
International Journal of Robotics Research
Approximate range searching in higher dimension
Computational Geometry: Theory and Applications
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Efficient c-oriented range searching with DOP-trees
Computational Geometry: Theory and Applications
Distributed similarity search in high dimensions using locality sensitive hashing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
I/O-efficient map overlay and point location in low-density subdivisions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A dynamic data structure for approximate range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry
A unified approach to approximate proximity searching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Spatio-temporal range searching over compressed kinetic sensor data
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
Sampling-based algorithms for optimal motion planning
International Journal of Robotics Research
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Approximate range searching using binary space partitions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fully retroactive approximate range and nearest neighbor searching
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
approximate range searching: the absolute model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A self-adjusting data structure for multidimensional point sets
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Output-sensitive well-separated pair decompositions for dynamic point sets
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |