Delaunay triangulations in O(sort(n)) time and more

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 139-148

  Buchin, Kevin ^a   Mulzer, Wolfgang ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

2-COLOR; ALGEBRAIC COMPUTATIONS; CONSTANT TIME; CONVEX HULL; CONVEX POLYTOPES; DELAUNAY; DELAUNAY TRIANGULATION; EXPECTED TIME; HIGHER DIMENSIONS; NEAREST-NEIGHBORS; PLANAR POINT SETS; RANDOMIZED INCREMENTAL CONSTRUCTION;

COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; DATA STRUCTURES; FIBER OPTIC CHEMICAL SENSORS; TRIANGULATION;

TREES (MATHEMATICS);

EID: 77952399260     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.53     Document Type: Conference Paper

References (45)

1. A. Aggarwal, "Lecture notes in computational geometry," MIT Research Seminar Series MIT/LCS/RSS, vol. 3, August 1988.
2. S. Albers and T. Hagerup, "Improved parallel integer sorting without concurrent writing," Inform. and Comput., vol. 136, no. 1, pp. 25-51, 1997.
3. N. Amenta, D. Attali, and O. Devillers, "Complexity of Delaunay triangulation for points on lower-dimensional poly-hedra," in Proc. 18th SODA, 2007, pp. 1106-1113.
4. N. Amenta, S. Choi, and G. Rote, "Incremental constructions con BRIO," in Proc. 19th SoCG, 2003, pp. 211-219.
5. A. Amir, A. Efrat, P. Indyk, and H. Samet, "Efficient regular data structures and algorithms for dilation, location, and proximity problems," Algorithmica, vol. 30, no. 2, pp. 164-187, 2001.
6. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, "Sorting in linear time?" JCSS, vol. 57, no. 1, pp. 74-93, 1998.
7. S. Arora and B. Barak, Computational complexity: A Modern Approach. Cambridge University Press, 2009.
8. D. Attali and J.-D. Boissonnat, "A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces," DCG, vol. 31, no. 3, pp. 369-384, 2004.
9. K. E. Batcher, "Sorting networks and their applications," in Proc. AFIPS Spring Joint Computer Conferences. ACM Press, 1968, pp. 307-314.
10. M. Bern, D. Eppstein, and J. Gilbert, "Provably good mesh generation," JCSS, vol. 48, no. 3, pp. 384-409, 1994.
11. M. Bern, D. Eppstein, and S.-H. Teng, "Parallel construction of quadtrees and quality triangulations," IJCGA, vol. 9, no. 6, pp. 517-532, 1999.
12. K. Buchin, "Organizing point sets: Space-filling curves, Delaunay tessellations of random point sets, and flow complexes," Ph.D. dissertation, Free University Berlin, 2007, http://www.diss.fu-berlin.de/diss/ receive/FUDISS-thesis-000000003494.
13. P. B. Callahan and S. R. Kosaraju, "A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields," JACM, vol. 42, no. 1, pp. 67-90, 1995.
14. T. M. Chan, "Closest-point problems simplified on the RAM," in Proc. 13th SODA, 2002, pp. 472-473.
15. -, "Well-separated pair decomposition in linear time?" IPL, vol. 107, no. 5, pp. 138-141, 2008.
16. T. M. Chan and M. Pǎtraşcu, "Transdichotomous results in computational geometry, I: Point location in sublogarithmic time," sICOMP To appear.
17. O(√lg lg n) time," in Proc. 39th STOC, 2007, pp. 31-39.
18. B. Chazelle, O. Devillers, F. Hurtado, M. Mora, V. Sacristán, and M. Teillaud, "Splitting a Delaunay triangulation in linear time," Algorithmica, vol. 34, no. 1, pp. 39-46, 2002.
19. B. Chazelle, "An optimal algorithm for intersecting three-dimensional convex polyhedra," SICOMP, vol. 21, no. 4, pp. 671-696, 1992.
20. B. Chazelle and W. Mulzer, "Computing hereditary convex structures," in Proc. 25th SoCG, 2009, pp. 61-70.
21. L. P. Chew and S. Fortune, "Sorting helps for Voronoi diagrams," Algorithmica, vol. 18, no. 2, pp. 217-228, 1997.
22. K. L. Clarkson, "Fast algorithms for the all nearest neighbors problem," in Proc. 24th FOCS, 1983, pp. 226-232.
23. K. L. Clarkson and C. Seshadhri, "Self-improving algorithms for Delaunay triangulations," in Proc. 24th SoCG, 2008, pp. 148-155.
24. K. L. Clarkson and P. W. Shor, "Applications of random sampling in computational geometry. II," DCG, vol. 4, no. 5, pp. 387-421, 1989.
25. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.
26. M. de Berg, O. Cheong, M. van Kreveld, and M. Over-mars, Computational Geometry: Algorithms and Applications, 3rd ed. Springer-Verlag, 2008.
27. M. de Berg, M. van Kreveld, and J. Snoeyink, "Two- and three-dimensional point location in rectangular subdivisions," J. Algorithms, vol. 18, no. 2, pp. 256-277, 1995.
28. H. N. Djidjev and A. Lingas, "On computing Voronoi diagrams for sorted point sets," IJCGA, vol. 5, no. 3, pp. 327-337, 1995.
29. M. L. Fredman, "How good is the information theory bound in sorting?" TCS, vol. 1, no. 4, pp. 355-361, 1975/76.
30. M. L. Fredman and D. E. Willard, "Surpassing the information theoretic bound with fusion trees," JCSS, vol. 47, no. 3, pp. 424-436, 1993.
31. Y. Han and M. Thorup, "Integer sorting in O(n √log log n) expected time and linear space," in Proc. 43rd FOCS, 2002, pp. 135-144.
32. J. Iacono and S. Langerman, "Dynamic point location in fat hyperrectangles with integer coordinates," in Proc. 12th CCCG, 2000, pp. 181-186.
33. R. G. Karlsson and M. H. Overmars, "Scanline algorithms on a grid," BIT, vol. 28, no. 2, pp. 227-241, 1988.
34. D. Kirkpatrick and S. Reisch, "Upper bounds for sorting integers on random access machines," TCS, vol. 28, no. 3, pp. 263-276, 1984.
35. J. v. Leeuwen and A. Tsakalides, "An optimal pointer machine algorithm for finding nearest common ancestors," Department of Information and Computing Sciences, Utrecht University, Tech. Rep. RUU-CS-88-17, 1988.
36. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, ser. Monographs in Theoretical Computer Science. An EATCS Series. Springer-Verlag, 1984, vol. 1.
37. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis, "Separators for sphere-packings and nearest neighbor graphs," JACM, vol. 44, no. 1, pp. 1-29, 1997.
38. R. Motwani and P. Raghavan, Randomized algorithms. Cambridge University Press, 1995.
39. K. Mulmuley, Computational Geometry: An Introduction through Randomized Algorithms. Prentice Hall, 1994.
40. M. H. Overmars, "Computational geometry on a grid: An overview," Rijksuniversiteit Utrecht, Tech. Rep. RUU-CS-87-04, 1987.
41. A. Schönhage, "On the power of random access machines," in Proc. 6th ICALP, 1979, pp. 520-529.
42. R. Seidel, "A method for proving lower bounds for certain geometric problems," Cornell University, Ithaca, NY, USA, Tech. Rep. TR84-592, 1984.
43. P. van Emde Boas, R. Kaas, and E. Zijlstra, "Design and implementation of an efficient priority queue," Math. Systems Theory, vol. 10, no. 2, pp. 99-127, 1976/77.
44. M. J. van Kreveld, M. Löffler, and J. S. B. Mitchell, "Preprocessing imprecise points and splitting triangulations," in Proc. 19th ISAAC, 2008, pp. 544-555.
45. D. E. Willard, "Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree," SICOMP, vol. 29, no. 3, pp. 1030-1049, 2000.