Incremental constructions con BRIO

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 211-219

  Amenta, Nina ^a   Choi, Sunghee ^b   Rote, Günter ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Delaunay triangulation; Randomized incremental construction; Virtual memory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; RANDOM ACCESS STORAGE; TREES (MATHEMATICS);

BIASED RANDOMIZED INSERTION ORDER (BRIO);

COMPUTATIONAL GEOMETRY;

EID: 0038714810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777819.777824     Document Type: Conference Paper

References (34)

1. AGARWAL, P. K., DE BERG, M., MATOUŠEK, J., AND SCHWARZKOPF, O. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput. 27 (1998), 654-667.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. 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.
8. 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.
9. 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.
10. d. Computer-Aided Design 30, 5 (1998), 333-341.
11. CLARKSON, K. L. New applications of random sampling in computational geometry. Discrete Comput. Geom. 2 (1987), 195-222.
12. CLARKSON, K. L., MEHLHORN, K., AND SEIDEL, R. Four results on randomized incremental constructions. Comput. Geom. Theory Appl. 3, 4 (1993), 185-212.
13. CLARKSON, K. L., AND SHOR, P. W. Applications of random sampling in computational geometry, II. Discrete Comput Geom. 4 (1989), 387-421.
14. DE BERG, M., VAN KREVELD, M., OVERMARS, M., AND SCHWARZKOPF, O. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
15. DEVILLERS, O. The Delaunay hierarchy. Int. Journ. Found, of Comp. Sci., 13 (2002), 163-180.
16. DEVILLERS, O., AND GUIGUE, P. The shuffling buffer. Internat. J. Comput. Geom. Appl. 11 (2001), 555-572
17. 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.
18. DWYER, R. A. Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput. Geom. 6 (1991), 343-367.
19. 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.
20. 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.
21. 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.
22. 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.
23. MULMULEY, K. A fast planar partition algorithm, I. J. Symbolic Comput. 10, 3-4 (1990), 253-280.
24. MULMULEY, K. A fast planar partition algorithm, II. J. Assoc. Comput. Mach. 38 (1991), 74-103.
25. MULMULEY, K. On levels in arrangements and Voronoi diagrams. Discrete Comput. Geom. 6 (1991), 307-338.
26. MULMULEY, K. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.
27. 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.
28. PLATZMAN, L. K., AND BARTHOLDI III, J. J. Spacefilling curves and the planar travelling salesman problem. J. Assoc. Comput. Mach. 39 (1989), 719-737.
29. SAGAN, H. Space-filling curves. Springer-Verlag, New York, 1994.
30. 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.
31. SEIDEL, R. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6 (1991), 423-434.
32. 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.
33. 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.
34. 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.