Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams and arrangements
Discrete & Computational Geometry
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Computational geometry in C
A new technique for analyzing substructures in arrangements
Proceedings of the eleventh annual symposium on Computational geometry
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new technique for analyzing substructures in arrangements
Proceedings of the eleventh annual symposium on Computational geometry
Efficient max-norm distance computation and reliable voxelization
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Information Processing Letters
Information Processing Letters
Klee's measure problem on fat boxes in time ∂(n(d+2)/3)
Proceedings of the twenty-sixth annual symposium on Computational geometry
An improved algorithm for Klee's measure problem on fat boxes
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |