Nina Amenta
ABSTRACT
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.
- Agarwal, P. K., de~Berg, M., Matouaek, J., and Schwarzkopf, O. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput. 27 (1998), 654--667. Google Scholar
Digital Library
- Arge, L. External memory data structures. In Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, and M. G. C. Resende, Eds., vol. 4 of Massive Computing. Kluwer Academic Publishers, 2002, ch. 9, pp. 313--357. Google ScholarDigital Library
- Asano, T., Ranjan, D., Roos, T., Welzl, E., and Widmayer, P. Space-filling curves and their use in the design of geometric data structures. Theoret. Comput. Sci. 181, 1 (July 1997), 3--15. Google ScholarDigital Library
- Barber, C. B., Dobkin, D. P., and Huhdanpaa, H. The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 4 (Dec. 1996), 469--483. Google ScholarDigital Library
- Bartholdi, III, J. J., and Platzman, L. K. A fast heuristic based on spacefilling curves for minimum-weight matching in the plane. Inform. Process. Lett. 17 (1983), 177--180.Google ScholarCross Ref
- Blelloch, G. E., Miller, G. L., Hardwick, J. C., and Talmor, D. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica 24, 3 (1999), 243--269.Google ScholarCross Ref
- Chan, T. M., Snoeyink, J., and Yap, C. K. Primal dividing and dual pruning: Output-sensitive construction of 4-d polytopes and 3-d Voronoi diagrams. Discrete Comput. Geom. 18 (1997), 433--454.Google ScholarCross Ref
- Chew, L. P. Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Dept. Math. Comput. Sci., Dartmouth College, Hanover, NH, 1986. Google ScholarDigital Library
- Choi, S., and Amenta, N. Delaunay triangulation programs on surface data. In Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms, January 6--8, 2002, San Francisco (2002), ACM/SIAM, pp. 135--136. Google ScholarDigital Library
- Cignoni, P., Montani, C. and Scopigno, R. DeWall: a fast divide and conquer Delaunay triangulation algorithm in Ed. Computer-Aided Design 30, 5 (1998), 333--341.Google ScholarCross Ref
- Clarkson, K. L. New applications of random sampling in computational geometry. Discrete Comput. Geom. 2 (1987), 195--222.Google ScholarDigital Library
- Clarkson, K. L., Mehlhorn, K., and Seidel, R. Four results on randomized incremental constructions. Comput. Geom. Theory Appl. 3, 4 (1993), 185--212. Google ScholarDigital Library
- Clarkson, K. L., and Shor, P. W. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4 (1989), 387--421.Google ScholarDigital Library
- de~Berg, M., van Kreveld, M., Overmars, M., and Schwarzkopf, O. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997. Google ScholarDigital Library
- Devillers, O. The Delaunay hierarchy. Int. Journ. Found. of Comp. Sci., 13 (2002), 163--180.Google ScholarCross Ref
- Devillers, O., and Guigue, P. The shuffling buffer. Internat. J. Comput. Geom. Appl. 11 (2001), 555--572.Google ScholarCross Ref
- Dwyer, R. A. Average-case analysis of algorithms for convex hulls and Voronoi diagrams. Ph.D. thesis, Comput. Sci. Dept., Carnegie-Mellon Univ., Pittsburgh, PA, 1988. Report CMU-CS-88--132. Google ScholarDigital Library
- Dwyer, R. A. Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput. Geom. 6 (1991), 343--367.Google ScholarDigital Library
- Golin, M. J., and Na, H.-S. On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes. In Proc. 12th Annu. ACM Sympos. Comput. Geom. (2000), pp. 127--135.Google Scholar
- Golin, M. J., and Na, H.-S. On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes. Tech. Rep. Tech. report HKUST-TCSC-2001-08, Hong Kong University of Science and Technology, 2001. http://www.cs.ust.hk/tcsc/RR/2001-08.ps.gz.Google Scholar
- Golin, M. J., and Na, H.-S. On the proofs of two lemmas describing the intersections of spheres with the boundary of a convex polytope. Tech. Rep. Tech. report HKUST-TCSC-2001-09, Hong Kong University of Science and Technology, 2001. http://www.cs.ust.hk/tcsc/RR/2001-09.ps.gz.Google Scholar
- Goodrich, M. T., Tsay, J.-J., Vengroff, D. E., and Vitter J. S. External-Memory Computational Geometry, In Proc. 34th Foundations of Computer Science (FOCS) (1993), pp. 714--723.Google ScholarDigital Library
- Mulmuley, K. A fast planar partition algorithm, I. J. Symbolic Comput. 10, 3-4 (1990), 253--280. Google ScholarDigital Library
- Mulmuley, K. A fast planar partition algorithm, II. J. Assoc. Comput. Mach. 38 (1991), 74--103. Google ScholarDigital Library
- Mulmuley, K. On levels in arrangements and Voronoi diagrams. Discrete Comput. Geom. 6 (1991), 307--338.Google ScholarDigital Library
- Mulmuley, K. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.Google Scholar
- Mulmuley, K., and Schwarzkopf, O. Randomized algorithms. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, 1997, ch. 34, pp. 633--652. Google ScholarDigital Library
- Platzman, L. K., and Bartholdi III, J. J. Spacefilling curves and the planar travelling salesman problem. J. Assoc. Comput. Mach. 39 (1989), 719--737. Google ScholarDigital Library
- Sagan, H. Space-filling curves. Springer-Verlag, New York, 1994.Google ScholarCross Ref
- Seidel, R. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl. 1, 1 (1991), 51--64. Google ScholarDigital Library
- Seidel, R. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6 (1991), 423--434. Google ScholarDigital Library
- Seidel, R. Backwards analysis of randomized geometric algorithms. In New Trends in Discrete and Computational Geometry, J. Pach, Ed., vol. 10 of Algorithms and Combinatorics. Springer-Verlag, 1993, pp. 37--68.Google ScholarCross Ref
- Welzl, E. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science, H. Maurer, Ed., vol. 555 of Lecture Notes Comput. Sci. Springer-Verlag, 1991, pp. 359--370.Google ScholarCross Ref
- Zhu, B. Further computational geometry in secondary memory, In 5th Annual International Symposium on Algorithms and Computation (ISAAC) vol. 834 of Lecture Notes Comput. Sci. Springer-Verlag, 1994, pp. 514--522. Google ScholarDigital Library
Index Terms
- Incremental constructions con BRIO
Recommendations
Fast segment insertion and incremental construction of constrained delaunay triangulations
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometryThe most commonly implemented method of constructing a constrained Delaunay triangulation (CDT) in the plane is to first construct a Delaunay triangulation, then incrementally insert the input segments one by one. For typical implementations of segment ...
Fast segment insertion and incremental construction of constrained Delaunay triangulations
The most commonly implemented method of constructing a constrained Delaunay triangulation (CDT) in the plane is to first construct a Delaunay triangulation, then incrementally insert the input segments one by one. For typical implementations of segment ...
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
The Hausdorff Voronoi diagram of clusters of points in the plane is a generalization of Voronoi diagrams based on the Hausdorff distance function. Its combinatorial complexity is $$O(n+m)$$O(n+m), where n is the total number of points and $$m$$m is the ...
Comments