Computational geometry: an introduction
Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
The ultimate planar convex hull algorithm
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)
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
Merging free trees in parallel for efficient Voronoi diagram construction
Proceedings of the seventeenth international colloquium on Automata, languages and programming
In-place techniques for parallel convex hull algorithms (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
An O(n log2h) time algorithm for the three-dimensional convex hull problem
SIAM Journal on Computing
Cutting hyperplane arrangements
Discrete & Computational Geometry
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems
SIAM Journal on Computing
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
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximations and optimal geometric divide-and-conquer
Selected papers of the 23rd annual ACM symposium on Theory of computing
Output-sensitive results on convex hulls, extreme points, and related problems
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
A deterministic algorithm for the three-dimensional diameter problem
Computational Geometry: Theory and Applications
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Proceedings of the twelfth annual symposium on Computational geometry
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
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
An algorithm for intersecting equal radius balls in R\u3\d
An algorithm for intersecting equal radius balls in R\'u3\'d
Optimal deterministic approximate parallel prefix sums and their applications
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
On Computing the Upper Envelope of Segments in Parallel
IEEE Transactions on Parallel and Distributed Systems
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
Computing Farthest Neighbors on a Convex Polytope
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Computing the Diameter of a Point Set
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Computing farthest neighbors on a convex polytope
Theoretical Computer Science - Computing and combinatorics
| Hi-index | 0.00 |