Average-case analysis of algorithms for convex hulls and Voronoi diagrams
Average-case analysis of algorithms for convex hulls and Voronoi diagrams
Spacefilling curves and the planar travelling salesman problem
Journal of the ACM (JACM)
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
A fast planar partition algorithm, I
Journal of Symbolic Computation
A fast planar partition algorithm, II
Journal of the ACM (JACM)
On levels in arrangements and Voronoi diagrams
Discrete & Computational Geometry
Higher-dimensional Voronoi diagrams in linear expected time
Discrete & Computational Geometry
Computational Geometry: Theory and Applications
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Handbook of discrete and computational geometry
Delaunay triangulation programs on surface data
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Further Computational Geometry in Secondary Memory
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
External memory data structures
Handbook of massive data sets
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
An empirical comparison of techniques for updating Delaunay triangulations
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
HCPO: an efficient insertion order for incremental Delaunay triangulation
Information Processing Letters
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
Illustrating the streaming construction of 2D delaunay triangulations
Proceedings of the twenty-second annual symposium on Computational geometry
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry
Parallel geometric algorithms for multi-core computers
Proceedings of the twenty-fifth annual symposium on Computational geometry
HCPO: an efficient insertion order for incremental Delaunay triangulation
Information Processing Letters
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Parallel geometric algorithms for multi-core computers
Computational Geometry: Theory and Applications
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
Synthesizing concurrent schedulers for irregular algorithms
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A surface reconstruction algorithm using weighted alpha shapes
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Improved implementation of point location in general two-dimensional subdivisions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Deterministic galois: on-demand, portable and parameterless
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
| Hi-index | 0.00 |
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define a biased randomized insertion order which removes enough randomness to significantly improve performance, but leaves enough randomness so that the algorithms remain theoretically optimal.