Abstract
Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collection ℛ of input regions known in advance. Building on recent work by Löffler and Snoeyink, we show how to leverage our knowledge of ℛ for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, e.g., overlapping disks of different sizes and fat regions.
Article PDF
Similar content being viewed by others
References
Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput. 38(3), 899–921 (2008)
Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: nearest neighbor relations for imprecise points. In: Proc. 15th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 403–412 (2004)
Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proc. 16th Annu. ACM Sympos. Theory Comput. (STOC), pp. 80–86 (1983)
de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica 28(3), 353–366 (2000)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)
de Berg, M., David, H., Katz, M.J., Overmars, M.H., van der Stappen, A.F., Vleugels, J.: Guarding scenes against invasive hypercubes. Comput. Geom. Theory Appl. 26(2), 99–117 (2003)
de Berg, M., van der Stappen, A.F., Vleugels, J., Katz, M.J.: Realistic input models for geometric algorithms. Algorithmica 34(1), 81–97 (2002)
Bern, M., Eppstein, D., Gilbert, J.: Provably good mesh generation. J. Comput. Syst. Sci. 48(3), 384–409 (1994)
Bern, M., Eppstein, D., Teng, S.H.: Parallel construction of quadtrees and quality triangulations. Int. J. Comput. Geom. Appl. 9(6), 517–532 (1999)
Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theory Comput. Syst. 38(4), 411–423 (2005)
Buchin, K., Mulzer, W.: Delaunay triangulations in O(sort(n)) time and more. In: Proc. 50th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pp. 139–148 (2009)
Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42(1), 67–90 (1995)
Chan, T.M.: Well-separated pair decomposition in linear time? Inform. Process. Lett. 107(5), 138–141 (2008)
Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485–524 (1991)
Chazelle, B., Devillers, O., Hurtado, F., Mora, M., Sacristán, V., Teillaud, M.: Splitting a Delaunay triangulation in linear time. Algorithmica 34(1), 39–46 (2002)
Chazelle, B., Mulzer, W.: Computing hereditary convex structures. In: Proc. 25th Annu. ACM Sympos. Comput. Geom. (SoCG), pp. 61–70 (2009)
Clarkson, K.L., Seshadhri, C.: Self-improving algorithms for Delaunay triangulations. In: Proc. 24th Annu. ACM Sympos. Comput. Geom. (SoCG), pp. 148–155 (2008)
Djidjev, H.N., Lingas, A.: On computing Voronoi diagrams for sorted point sets. Int. J. Comput. Geom. Appl. 5(3), 327–337 (1995)
Eppstein, D.: Approximating the minimum weight Steiner triangulation. Discrete Comput. Geom. 11(2), 163–191 (1994)
Finkel, R.A., Bentley, J.L.: Quad trees: a data structure for retrieval on composite keys. Acta Inform. 4(1), 1–9 (1974)
Franciosa, P.G., Gaibisso, C., Gambosi, G., Talamo, M.: A convex hull algorithm for points with approximately known positions. Int. J. Comput. Geom. Appl. 4(2), 153–163 (1994)
Guibas, L.J., Salesin, D., Stolfi, J.: Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. 5th Annu. ACM Sympos. Comput. Geom. (SoCG), pp. 208–217 (1989)
Guibas, L.J., Salesin, D., Stolfi, J.: Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmica 9, 534–560 (1993)
Held, M., Mitchell, J.S.B.: Triangulating input-constrained planar point sets. Inform. Process. Lett. 109(1), 54–56 (2008)
Kirkpatrick, D.G.: Efficient computation of continuous skeletons. In: Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pp. 18–27 (1979)
van Kreveld, M., Löffler, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. Theory Appl. 43(4), 419–433 (2010)
van Kreveld, M.J., Löffler, M., Mitchell, J.S.B.: Preprocessing imprecise points and splitting triangulations. In: Proc. 19th Annu. Internat. Sympos. Algorithms Comput. (ISAAC), pp. 544–555 (2008)
Kruger, H.: Basic measures for imprecise point sets in ℝd. Master’s thesis, Utrecht University (2008)
Löffler, M., Snoeyink, J.: Delaunay triangulation of imprecise points in linear time after preprocessing. Comput. Geom. Theory Appl. 43(3), 234–242 (2010)
Nagai, T., Tokura, N.: Tight error bounds of geometric problems on convex objects with imprecise coordinates. In: Jap. Conf. on Discrete and Comput. Geom. LNCS, vol. 2098, pp. 252–263. Springer, Berlin (2000)
Ostrovsky-Berman, Y., Joskowicz, L.: Uncertainty envelopes. In: Proc. 21st European Workshop Comput. Geom. (EWCG), pp. 175–178 (2005)
van der Stappen, A.F.: Motion planning amidst fat obstacles. Ph.D. thesis, Dept. Comput. Sci., Utrecht Univ., Utrecht, the Netherlands (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by the Netherlands Organisation for Scientific Research (NWO) through the project GOGO, the BRICKS/FOCUS project no. 642.065.503, and project no. 639.022.707. P. Morin was supported by NSERC, CFI, and the Ontario Ministry of Research and Innovation. W. Mulzer was supported in part by a Wallace Memorial Fellowship in Engineering and NSF grant CCF-0634958 and NSF CCF 0832797.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Buchin, K., Löffler, M., Morin, P. et al. Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. Algorithmica 61, 674–693 (2011). https://doi.org/10.1007/s00453-010-9430-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-010-9430-0