The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
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
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational 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
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Higher-dimensional Voronoi diagrams in linear expected time
Discrete & Computational Geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Oriented projective geometry
An O(n log2h) time algorithm for the three-dimensional convex hull problem
SIAM Journal on Computing
Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Cutting hyperplane arrangements
Discrete & Computational Geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Journal of Algorithms
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Geometric transforms for fast geometric algorithms
Geometric transforms for fast geometric algorithms
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
New lower bounds for convex hull problems in odd dimensions
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
Developing a practical projection-based parallel Delaunay algorithm
Proceedings of the twelfth annual symposium on Computational geometry
Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Smooth-surface reconstruction in near-linear time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distribution-sensitive algorithms
Nordic Journal of Computing
Dynamic maintenance and visualization of molecular surfaces
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Algorithms and theory of computation handbook
Efficient computation of clipped Voronoi diagram for mesh generation
Computer-Aided Design
| Hi-index | 0.00 |