Kevin Buchin
Wolfgang Mulzer
Skip Abstract Section
Abstract
We present several results about Delaunay triangulations (DTs) and convex hulls in transdichotomous and hereditary settings: (i) the DT of a planar point set can be computed in expected time O(sort(n)) on a word RAM, where sort(n) is the time to sort n numbers. We assume that the word RAM supports the shuffle operation in constant time; (ii) if we know the ordering of a planar point set in x- and in y-direction, its DT can be found by a randomized algebraic computation tree of expected linear depth; (iii) given a universe U of points in the plane, we construct a data structure D for Delaunay queries: for any P ⊆ U, D can find the DT of P in expected time O(|P| log log |U|); (iv) given a universe U of points in 3-space in general convex position, there is a data structure D for convex hull queries: for any P ⊆ U, D can find the convex hull of P in expected time O(|P| (log log |U|)2); (v) given a convex polytope in 3-space with n vertices which are colored with χ ≥ 2 colors, we can split it into the convex hulls of the individual color classes in expected time O(n (log log n)2).
The results (i)--(iii) generalize to higher dimensions, where the expected running time now also depends on the complexity of the resulting DT. We need a wide range of techniques. Most prominently, we describe a reduction from DTs to nearest-neighbor graphs that relies on a new variant of randomized incremental constructions using dependent sampling.
- Aggarwal, A. 1988. Lecture notes in computational geometry. Tech. rep. 3, MIT Research Seminar Series MIT/LCS/RSS.Google Scholar
- Ailon, N., Chazelle, B., Clarkson, K. L., Liu, D., Mulzer, W., and Seshadhri, C. 2010. Self-improving algorithms. SIAM J. Comput. To appear. (Manuscript at arXiv:0907.0884v2. See also SODA 2006 and SoCG 2008). Google ScholarDigital Library
- Albers, S., and Hagerup, T. 1997. Improved parallel integer sorting without concurrent writing. Inform. and Comput. 136, 1, 25--51. Google ScholarDigital Library
- Amenta, N., Attali, D., and Devillers, O. 2007. Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM, 1106--1113. Google ScholarDigital Library
- Amenta, N., Choi, S., and Rote, G. 2003. Incremental constructions con BRIO. In Proceedings of the 19th Annual ACM Symposium on Computing Geometry (SoCG). ACM, 211--219. Google ScholarDigital Library
- Amir, A., Efrat, A., Indyk, P., and Samet, H. 2001. Efficient regular data structures and algorithms for dilation, location, and proximity problems. Algorithmica 30, 2, 164--187.Google ScholarDigital Library
- Andersson, A., Hagerup, T., Nilsson, S., and Raman, R. 1998. Sorting in linear time? J. Comput. Syst. Sci. 57, 1, 74--93. Google ScholarDigital Library
- Arora, S., and Barak, B. 2009. Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge, UK. Google ScholarDigital Library
- Attali, D., and Boissonnat, J.-D. 2004. A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces. Disc. Comput. Geom. 31, 3, 369--384. Google ScholarDigital Library
- Batcher, K. E. 1968. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computer Conferences. ACM, 307--314. Google ScholarDigital Library
- Ben-Or, M. 1983. Lower bounds for algebraic computation trees. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC). ACM, 80--86. Google ScholarDigital Library
- Bentley, J. L., Weide, B. W., and Yao, A. C. 1980. Optimal expected-time algorithms for closest-point problems. ACM Trans. Math. Softw. 6, 563--580. Google ScholarDigital Library
- Bern, M., Eppstein, D., and Gilbert, J. 1994. Provably good mesh generation. J. Comput. System Sci. 48, 3, 384--409. Google ScholarDigital Library
- Bern, M., Eppstein, D., and Teng, S.-H. 1999. Parallel construction of quadtrees and quality triangulations. Internat. J. Comput. Geom. Appl. 9, 6, 517--532.Google ScholarCross Ref
- Boissonnat, J.-D., and Yvinec, M. 1998. Algorithmic Geometry. Cambridge University Press, Cambridge, UK. Google ScholarDigital Library
- Buchin, K. 2007. Organizing point sets: Space-filling curves, Delaunay tessellations of random point sets, and flow complexes. Ph.D. dissertation, Free University Berlin. http://www.diss.fu-berlin.de/diss/receive/FUDISS_thesis_000000003494.Google Scholar
- Buchin, K. 2008. Delaunay triangulations in linear time? (part I). arXiv:0812.0387.Google Scholar
- Buchin, K. 2009. Constructing Delaunay triangulations along space-filling curves. In Proceedings of the 17th Annual European Sympos. Algorithms (ESA). Springer-Verlag, 119--130.Google ScholarCross Ref
- Callahan, P. B., and Kosaraju, S. R. 1995. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42, 1, 67--90. Google ScholarDigital Library
- Chan, T. M. 2002. Closest-point problems simplified on the RAM. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM, 472--473. Google ScholarDigital Library
- Chan, T. M. 2008. Well-separated pair decomposition in linear time? Inf. Proc. Lett. 107, 5, 138--141. Google ScholarDigital Library
- Chan, T. M., and Pǎtraşcu, M. 2009. Transdichotomous results in computational geometry, I: Point location in sublogarithmic time. SIAM J. Comput. 39, 2, 703--729. Google ScholarDigital Library
- Chan, T. M., and Pǎtraşcu, M. 2010. Transdichotomous results in computational geometry, II: Offline search. arXiv:1010.1948 (see also STOC 2007).Google Scholar
- Chazelle, B. 1992. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Comput. 21, 4, 671--696. Google ScholarDigital Library
- Chazelle, B., Devillers, O., Hurtado, F., Mora, M., Sacristán, V., and Teillaud, M. 2002. Splitting a Delaunay triangulation in linear time. Algorithmica 34, 1, 39--46.Google ScholarDigital Library
- Chazelle, B., and Mulzer, W. 2009a. Computing hereditary convex structures. In Proceedings of the 25th Annual ACM Symposium on Computing Geometry (SoCG). ACM, 61--70. Google ScholarDigital Library
- Chazelle, B., and Mulzer, W. 2009b. Markov incremental constructions. Disc. Comput. Geom. 42, 3, 399--420.Google ScholarDigital Library
- Chew, L. P., and Fortune, S. 1997. Sorting helps for Voronoi diagrams. Algorithmica 18, 2, 217--228.Google ScholarDigital Library
- Clarkson, K. L. 1983. Fast algorithms for the all nearest neighbors problem. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 226--232. Google ScholarDigital Library
- Clarkson, K. L., and Shor, P. W. 1989. Applications of random sampling in computational geometry. II. Disc. Comput. Geom. 4, 5, 387--421.Google ScholarDigital Library
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2009. Introduction to Algorithms, 3rd Ed. MIT Press, Cambridge, MA. Google ScholarDigital Library
- de Berg, M., Cheong, O., van Kreveld, M., and Overmars, M. 2008. Computational Geometry: Algorithms and Applications, 3rd Ed. Springer-Verlag, Berlin. Google ScholarDigital Library
- de Berg, M., van Kreveld, M., and Snoeyink, J. 1995. Two- and three-dimensional point location in rectangular subdivisions. J. Algorithms 18, 2, 256--277. Google ScholarDigital Library
- Djidjev, H. N., and Lingas, A. 1995. On computing Voronoi diagrams for sorted point sets. Internat. J. Comput. Geom. Appl. 5, 3, 327--337.Google ScholarCross Ref
- van Emde Boas, P. 1977. Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6, 3, 80--82.Google ScholarCross Ref
- van Emde Boas, P., Kaas, R., and Zijlstra, E. 1976. Design and implementation of an efficient priority queue. Math. Systems Theory 10, 2, 99--127.Google ScholarCross Ref
- Fredman, M. L. 1976. How good is the information theory bound in sorting? Theoret. Comput. Sci. 1, 4, 355--361.Google ScholarCross Ref
- Fredman, M. L., and Willard, D. E. 1993. Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47, 3, 424--436. Google ScholarDigital Library
- Gabow, H. N., Bentley, J. L., and Tarjan, R. E. 1984. Scaling and related techniques for geometry problems. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC). ACM, 135--143. Google ScholarDigital Library
- Han, Y. 2004. Deterministic sorting in O(n log log n) time and linear space. J. Algorithms 50, 1, 96--105. Google ScholarDigital Library
- Han, Y., and Thorup, M. 2002. Integer sorting in O(n &sqrt; log log n) expected time and linear space. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 135--144. Google ScholarDigital Library
- Harel, D., and Tarjan, R. E. 1984. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 2, 338--355. Google ScholarDigital Library
- Iacono, J., and Langerman, S. 2000. Dynamic point location in fat hyperrectangles with integer coordinates. In Proceedings of the 12th Canad. Conf. Comput. Geom. (CCCG). CCCG, 181--186.Google Scholar
- Isenburg, M., Liu, Y., Shewchuk, J. R., and Snoeyink, J. 2006. Streaming computation of Delaunay triangulations. ACM Trans. Graph. (Proc.) 25, 3, 1049--1056. Google ScholarDigital Library
- Karlsson, R. G. 1985. Algorithms in a Restricted Universe. Ph.D. dissertation, University of Waterloo. Google ScholarDigital Library
- Karlsson, R. G., and Overmars, M. H. 1988. Scanline algorithms on a grid. BIT 28, 2, 227--241.Google ScholarDigital Library
- Kirkpatrick, D., and Reisch, S. 1984. Upper bounds for sorting integers on random access machines. Theoret. Comput. Sci. 28, 3, 263--276.Google ScholarCross Ref
- Liu, Y., and Snoeyink, J. 2005. A comparison of five implementations of 3d Delaunay tesselation. In Combinatorial and Computational Geometry, MSRI Publications, vol. 52. Cambridge University Press, Cambridge, UK, 439--458.Google Scholar
- Löffler, M., and Mulzer, W. 2011. Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent. In Proceedings of the 22nd Annual ACM-SIAM Symposium Discrete Algorithms (SODA). ACM-SIAM, 1759--1777. Google ScholarDigital Library
- Mehlhorn, K. 1984. Data Structures and Algorithms 1: Sorting and Searching. Monographs in Theoretical Computer Science. An EATCS Series, vol. 1. Springer-Verlag, Berlin, Germany.Google Scholar
- Miller, G. L., Teng, S.-H., Thurston, W., and Vavasis, S. A. 1997. Separators for sphere-packings and nearest neighbor graphs. J. ACM 44, 1, 1--29. Google ScholarDigital Library
- Morton, G. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Tech. rep., IBM Ltd., Ottawa, Canada.Google Scholar
- Motwani, R., and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, UK. Google ScholarDigital Library
- Mulmuley, K. 1994. Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Upper Saddle River, NJ.Google Scholar
- Ohya, T., Iri, M., and Murota, K. 1984a. A fast Voronoi-diagram algorithm with quaternary tree bucketing. Inf. Proc. Lett. 18, 4, 227--231. Google ScholarDigital Library
- Ohya, T., Iri, M., and Murota, K. 1984b. Improvements of the incremental method for the Voronoi diagram with a comparison of various algorithms. J. Oper. Res. Soc. Japan 27, 306--337.Google ScholarCross Ref
- Overmars, M. H. 1987. Computational geometry on a grid: An overview. Tech. rep. RUU-CS-87-04, Rijksuniversiteit Utrecht.Google Scholar
- Preparata, F. P., and Shamos, M. I. 1985. Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, Berlin, Germany. Google ScholarDigital Library
- Raman, R. 1996. Priority queues: Small, monotone and trans-dichotomous. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA). Springer-Verlag, 121--137. Google ScholarDigital Library
- Schönhage, A. 1979. On the power of random access machines. In Proceedings of the 6th International Colloquium on Automata Language Programming (ICALP). Springer-Verlag, 520--529. Google ScholarDigital Library
- Seidel, R. 1984. A method for proving lower bounds for certain geometric problems. Tech. rep. TR84-592, Cornell University, Ithaca, NY. Google ScholarDigital Library
- Su, P., and Drysdale, R. 1997. A comparison of sequential Delaunay triangulation algorithms. Comput. Geom. Theory Appl. 7, 361--386. Google ScholarDigital Library
- Thorup, M. 1998. Faster deterministic sorting and priority queues in linear space. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM, 550--555. Google ScholarDigital Library
- van Kreveld, M. J., Löffler, M., and Mitchell, J. S. B. 2008. Preprocessing imprecise points and splitting triangulations. In Proceedings of the 19th Annual International Symposium on Algorithms in Computing (ISAAC). Springer-Verlag, 544--555. Google ScholarDigital Library
- van Leeuwen, J., and Tsakalides, A. 1988. An optimal pointer machine algorithm for finding nearest common ancestors. Tech. rep. RUU-CS-88-17, Department of Information and Computing Sciences, Utrecht University.Google Scholar
- Willard, D. E. 2000. Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree. SIAM J. Comput. 29, 3, 1030--1049. Google ScholarDigital Library
- Zhou, S., and Jones, C. B. 2005. HCPO: an efficient insertion order for incremental Delaunay triangulation. Inform. Proc. Lett. 93, 1, 37--42. Google ScholarDigital Library
Index Terms
- Delaunay triangulations in O(sort(n)) time and more
Recommendations
Delaunay Triangulations in O(sort(n)) Time and More
FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer ScienceWe present several results about Delaunay triangulations (DTs) and convex hulls in transdichotomous and hereditary settings: (i) the DT of a planar point set can be computed in expected time O(sort(n)) on a word RAM, where sort(n)is the time to sort n ...
Universality Theorems for Inscribed Polytopes and Delaunay Triangulations
We prove that every primary basic semi-algebraic set is homotopy equivalent to the set of inscribed realizations (up to Möbius transformation) of a polytope. If the semi-algebraic set is, moreover, open, it is, additionally, (up to homotopy) the retract ...
The quickhull algorithm for convex hulls
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm. It ...
Comments