Efficient perspective-accurate silhouette computation and applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Space-efficient approximate Voronoi diagrams
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
Approximate range searching in external memory
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
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
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
Fully retroactive approximate range and nearest neighbor searching
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |