Computational geometry: an introduction
Computational geometry: an introduction
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
On the detection of a common intersection of k convex objects in the plane
Information Processing Letters
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
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
Output sensitive construction of levels and Voronoi diagrams in Rd of order 1 to k
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An O(n log2h) time algorithm for the three-dimensional convex hull problem
SIAM Journal on Computing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Ray shooting and parametric search
SIAM Journal on Computing
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry in C
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Shadows and slices of polytopes
Proceedings of the twelfth annual symposium on Computational geometry
On computing Voronoi diagrams by divide-prune-and-conquer
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Distribution-sensitive algorithms
Nordic Journal of Computing
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing
Exact computation of protein structure similarity
Proceedings of the twenty-second annual symposium on Computational geometry
Fast approximation of convex hull
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |