Computational geometry: an introduction
Computational geometry: an introduction
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Fat triangles determine linearly many holes
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing depth orders for fat objects and related problems
Computational Geometry: Theory and Applications
Range searching and point location among fat objects
Journal of Algorithms
Range searching in low-density environments
Information Processing Letters
On Range Searching with Semialgebraic Sets
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract)
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Linear Size Binary Space Partitions for Fat Objects
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Motion planning for multiple robots
Proceedings of the fourteenth annual symposium on Computational geometry
Spanning trees crossing few barriers
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Computing roundness is easy if the set is almost round
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Analysis of a bounding box heuristic for object intersection
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a bounding box heuristic for object intersection
Journal of the ACM (JACM)
Analyzing bounding boxes for object intersection
ACM Transactions on Graphics (TOG)
Simplified kinetic connectivity for rectangles and hypercubes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Nice point sets can have nasty Delaunay triangulations
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
ACM Transactions on Graphics (TOG)
Collision detection for deforming necklaces
Proceedings of the eighteenth annual symposium on Computational geometry
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry
Cost prediction for ray shooting
Proceedings of the eighteenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Geometry: Theory and Applications
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
Computational Geometry: Theory and Applications
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Quadtree Decomposition, Steiner Triangulation, and Ray Shooting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Local polyhedra and geometric graphs
Proceedings of the nineteenth annual symposium on Computational geometry
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Output-sensitive construction of the union of triangles
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Exact and approximation algorithms for computing optimal fat decompositions
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Hardware-Assisted Visibility Sorting for Unstructured Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
Cost prediction for ray shooting in octrees
Computational Geometry: Theory and Applications
Smoothed analysis of probabilistic roadmaps
Computational Geometry: Theory and Applications
Cost prediction for ray shooting in octrees
Computational Geometry: Theory and Applications
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Approximate range searching in external memory
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximate range searching using binary space partitions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |