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
Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
A geometric consistency theorem for a symbolic perturbation scheme
Journal of Computer and System Sciences
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
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An O(n log2h) time algorithm for the three-dimensional convex hull problem
SIAM Journal on Computing
Cutting hyperplane arrangements
Discrete & Computational Geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems
SIAM Journal on Computing
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Journal of Algorithms
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
The Voronoi diagram of curved objects
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
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
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On a Nearest-Neighbor Problem Under Minkowski and Power Metrics for Large Data Sets
The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing
The Journal of Supercomputing
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Algorithms and theory of computation handbook
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry: Theory and Applications
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |