Computational geometry: an introduction
Computational geometry: an introduction
The ultimate planar convex hull algorithm
SIAM Journal on Computing
A Lower Bound to Finding Convex Hulls
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
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
Further applications of random sampling to computational geometry
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Higher-dimensional Voronoi diagrams in linear expected time
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)
Stabbing and ray shooting in 3 dimensional space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
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
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Finding stabbing lines in 3-dimensional space
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Three-dimensional alpha shapes
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Robust gift wrapping for the three-dimensional convex hull
Journal of Computer and System Sciences
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth 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
How good are convex hull algorithms?
Proceedings of the eleventh annual symposium on Computational geometry
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
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
Checking geometric programs or verification of geometric structures
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
Enumeration of regular triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Probabilistic analysis for combinatorial functions of moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On deletion in Delaunay triangulations
SCG '99 Proceedings of the fifteenth 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 degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
Proceedings of the sixteenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Identification of piecewise affine systems by means of fuzzy clustering and competitive learning
Engineering Applications of Artificial Intelligence
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Proceedings of the twenty-seventh annual symposium on Computational geometry
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Computer Science Review
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Operations Research Letters
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
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 |