Abstract
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest possible convex hulls, measured by length and by area. Generally we assume the imprecision region to be a square, but we discuss the case where it is a segment or circle as well. We give polynomial time algorithms for several variants of this problem, ranging in running time from O(nlog n) to O(n 13), and prove NP-hardness for some other variants.
Article PDF
Similar content being viewed by others
References
Abellanas, M., Hurtado, F., Ramos, P.A.: Structural tolerance and Delaunay triangulation. Inf. Process. Lett. 71, 221–227 (1999)
Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: nearest neighbour relations for imprecise points. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 410–419 (2004)
Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3, 177–191 (1988)
Barber, B.C.: Computational geometry with imprecise data and arithmetic. TR-377-91, Ph.D. Thesis, Princeton University, Department of Computer Science (1993)
Boissonnat, J.-D., Lazard, S.: Convex hulls of bounded curvature. In: Proceedings of the 8th Canadian Conference on Computational Geometry, pp. 14–19 (1996)
Cai, L., Keil, J.M.: Computing visibility information in an inaccurate simple polygon. Int. J. Comput. Geom. Appl. 7, 515–538 (1997)
de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57(1), 22–36 (2005)
de Berg, M., Meijer, H., Overmars, M.H., Wilfong, G.T.: Computing the angularity tolerance. Int. J. Comput. Geom. Appl. 8, 467–482 (1998)
Desaulniers, H., Stewart, N.F.: Robustness of numerical methods in geometric computation when problem data is uncertain. Comput. Aided Des. 25, 539–545 (1993)
Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 473–482 (2003)
Edelsbrunner, H.: Finding transversals for sets of simple geometric figures. Theor. Comput. Sci. 35, 55–69 (1985)
Fiala, J., Kratochvil, J., Proskurowski, A.: Systems of distant representatives. Discrete Appl. Math. 145, 306–316 (2005)
Garey, M., Graham, R., Johnson, D.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32, 835–859 (1977)
Goodrich, M.T., Snoeyink, J.: Stabbing parallel segments with a convex polygon. Comput. Vis. Graph. Image Process. 49, 152–170 (1990)
Guibas, L., Salesin, D., Stolfi, J.: Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmica 9, 534–560 (1993)
Khanban, A.A., Edalat, A.: Computing Delaunay triangulation with imprecise input data. In: Proceedings of the 15th Canadian Conference on Computational Geometry, pp. 94–97 (2003)
van Kreveld, M., Löffler, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. In: Proceedings of the 10th Workshop on Algorithms and Data Structures. LNCS, vol. 4619, pp. 447–458. Springer, Berlin (2007)
Li, Z., Milenkovic, V.: Constructing strongly convex hulls using exact or rounded arithmetic. Algorithmica 8, 345–364 (1992)
Löffler, M., van Kreveld, M.: Approximating largest convex hulls for imprecise points. In: Proceedings of the 5th Workshop on Approximation and Online Algorithms. LNCS, vol. 4927, pp. 89–102. Springer, Berlin (2008)
Mata, C., Mitchell, J.S.: Approximation algorithms for geometric tour and network design problems. In: Proceedings of the 11th ACM Symposium on Computational Geometry, pp. 360–369 (1995)
Mukhopadhyay, A., Kumar, C., Greene, E., Bhattacharya, B.: On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Process. Lett. 105(2), 58–64 (2008)
Nagai, T., Tokura, N.: Tight error bounds of geometric problems on convex objects with imprecise coordinates. In: Proceedings of the 4th Japanese Conference on Discrete and Computational Geometry. LNCS, vol. 2098, pp. 252–263. Springer, Berlin (2000)
Rappaport, D.: Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 5(3), 243–256 (1995)
O’Rourke, J.: Sum of Square Roots. http://maven.smith.edu/~orourke/TOPP/P33.html
Ostrovsky-Berman, Y., Joskowicz, L.: Uncertainty envelopes. In: Proceedings of the 21st European Workshop on Computational Geometry, pp. 175–178 (2005)
Polishchuk, V., Mitchell, J.S.B.: Touring convex bodies—a conic programming solution. In: Proceedings of the 17th Canadian Conference on Computational Geometry, pp. 290–293 (2005)
Safra, S., Schwartz, O.: On the complexity of approximating TSP with neighborhoods and related problems. In: Proceedings of the European Symposium on Algorithms. LNCS, vol. 2832, pp. 446–458. Springer, Berlin (2003)
Sellen, J., Choi, J., Yap, C.-K.: Precision-sensitive Euclidean shortest paths in 3-space. SIAM J. Comput. 29, 1577–1595 (2000)
Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE Mediterranean Electrotechnical Conference (1983)
Yap, C.-K.: Robust geometric computation. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 927–952. Chapman & Hall/CRC, Boca Raton (2004). Chap. 41
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by the Netherlands Organisation for Scientific Research (NWO) under BRICKS/FOCUS grant number 642.065.503 and under the open competition project GOGO.
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
Löffler, M., van Kreveld, M. Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica 56, 235–269 (2010). https://doi.org/10.1007/s00453-008-9174-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-008-9174-2