Calculating approximate curve arrangements using rounded arithmetic
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing
Spheres, molecules, and hidden surface removal
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Communication issues in large-scale geometric computation
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Practical methods for approximating shortest paths on a convex polytope in R3
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
Binary space partitions for fat rectangles
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
New lower bound techniques for robot motion planning problems
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |