Edge-skeletons in arrangements with applications
Algorithmica
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Voronoi diagrams and arrangements
Discrete & Computational Geometry
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
A Las Vegas algorithm for linear programming when the dimension is small
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
On obstructions in relation to a fixed viewpoint
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
| Hi-index | 0.00 |