Two algorithms for polyhedral pictures
SCG '86 Proceedings of the second annual symposium on Computational geometry
How to net a lot with little: small &egr;-nets for disks and halfspaces
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
Tetrahedrizing point sets in three dimensions
Journal of Symbolic Computation
On the two-dimensional davenport-schinzel problem
Journal of Symbolic Computation
The upper envelope of Voronoi surfaces and its applications
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimality of the Delaunay triangulation in Rd
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)
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
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
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An interactive environment for visualizing and animating algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On bisectors for different distance functions
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
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
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations
Proceedings of the eighteenth annual symposium on Computational geometry
Polyhedral Voronoi diagrams of polyhedra in three dimensions
Proceedings of the eighteenth annual symposium on Computational geometry
A lower bound on Voronoi diagram complexity
Information Processing Letters
On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data
IEEE Transactions on Visualization and Computer Graphics
A Systolic Algorithm for the k-Nearest Neighbors Problem
IEEE Transactions on Computers
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Updating and constructing constrained delaunay and constrained regular triangulations by flips
Proceedings of the nineteenth annual symposium on Computational geometry
Curve and Surface Reconstruction in R2 and R3
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Abstract Voronoi diagram in 3-space
Journal of Computer and System Sciences
Ready, set, go! the Voronoi diagram of moving points that start from a line
Information Processing Letters
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On overlays and minimization diagrams
Proceedings of the twenty-second annual symposium on Computational geometry
Arrangements of geodesic arcs on the sphere
Proceedings of the twenty-fourth annual symposium on Computational geometry
On the lower envelope of bivariate functions and its applications
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Sweep-line algorithm for constrained Delaunay triangulation
International Journal of Geographical Information Science
Abstract Voronoi diagrams revisited
Computational Geometry: Theory and Applications
An efficient sweep-line Delaunay triangulation algorithm
Computer-Aided Design
Planar subdivisions by radical axes applied to structural morphology
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Flipping to robustly delete a vertex in a delaunay tetrahedralization
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
A parallel algorithm based on convexity for the computing of Delaunay tessellation
Numerical Algorithms
Yet another algorithm for generalized Voronoï Diagrams
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Computational Geometry: Theory and Applications
Technical note: Voronoi diagrams of algebraic distance fields
Computer-Aided Design
Hyperbolic delaunay complexes and voronoi diagrams made practical
Proceedings of the twenty-ninth annual symposium on Computational geometry
Fast segment insertion and incremental construction of constrained delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
Topological relations between separating circles
Discrete Applied Mathematics
| Hi-index | 0.06 |