Abstract
Imprecise points are regions in which one point should be placed. We study computing the largest and smallest possible values of various basic geometric measures on sets of imprecise points, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others.
This research was partially supported by the Netherlands Organisation for Scientific Research (NWO) through the project GOGO.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abellanas, M., Hurtado, F., Ramos, P.A.: Structural tolerance and Delaunay triangulation. Inf. Proc. Lett. 71, 221–227 (1999)
Averbakh, I., Bereg, S.: Facility location problems with uncertainty on the plane. Discrete Optimization 2, 3–34 (2005)
Cabello, S.: Approximation algorithms for spreading points. Journal of Algorithms (to appear)
Colley, P., Meijer, H., Rappaport, D.: Optimal nearly-similar polygon stabbers of convex polygons. In: Proc. 6th Canad. Conf. Comput. Geom., pp. 269–274 (1994)
Fiala, J., Kratochvil, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics 145, 306–316 (2005)
Guibas, L.J., Salesin, D., Stolfi, J.: Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmica 9, 534–560 (1993)
Jadhav, S., Mukhopadhyay, A., Bhattacharya, B.K.: An optimal algorithm for the intersection radius of a set of convex polygons. J. Algorithms 20, 244–267 (1996)
Löffler, M., van Kreveld, M.: Largest and smallest tours and convex hulls for imprecise points. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 375–387. Springer, Heidelberg (2006)
Megiddo, N.: On the ball spanned by balls. Discrete Comput. Geom. 4, 605–610 (1989)
Nagai, T., Tokura, N.: Tight error bounds of geometric problems on convex objects with imprecise coordinates. In: Proc. Jap. Conf. on Discrete and Comput. Geom., pp. 252–263 (2000)
Nagai, T., Yasutome, S., Tokura, N.: Convex hull problem with imprecise input. In: Akiyama, J., Kano, M., Urabe, M. (eds.) Discrete and Computational Geometry. LNCS, vol. 1763, pp. 207–219. Springer, Heidelberg (2000)
Rappaport, D.: A convex hull algorithm for discs, and applications. Comput. Geom. Theory Appl. 1(3), 171–181 (1992)
Robert, J., Toussaint, G.: Computational geometry and facility location. Technical Report SOCS 90.20, McGill Univ., Montreal, PQ (1990)
Welzl, E.: Smallest enclosing discs (balls and ellipsoids). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359–370. Springer, Heidelberg (1991)
Yap, C.K.: An O(n logn) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom. 2, 365–393 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Löffler, M., van Kreveld, M. (2007). Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)