Computational geometry: an introduction
Computational geometry: an introduction
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
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
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Approximations and optimal geometric divide-and-conquer
Selected papers of the 23rd annual ACM symposium on Theory of computing
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Planar separators and parallel polygon triangulation
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
The overlay of lower envelopes in three dimensions and its applications
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
Derandomization in computational geometry
Journal of Algorithms
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
On computing Voronoi diagrams by divide-prune-and-conquer
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
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
An algorithm for intersecting equal radius balls in R\u3\d
An algorithm for intersecting equal radius balls in R\'u3\'d
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Approximating 3D Points with Cylindrical Segments
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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 |