Largest bounding box, smallest diameter, and related problems on imprecise points

Computational Geometry: Theory and Applications

Volumn 43, Issue 4, 2010, Pages 419-433

  Löffler, Maarten ^a   Van Kreveld, Marc ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Bounding box; Data imprecision; Diameter; Smallest enclosing circle; Width

Indexed keywords

EID: 73549120398     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2009.03.007     Document Type: Article

References (23)

1. M. Abellanas, F. Hurtado, and P.A. Ramos Structural tolerance Delaunay triangulation Inform. Process. Lett. 71 1999 221 227
2. I. Averbakh, and S. Bereg Facility location problems with uncertainty on the plane Discrete Optimization 2 2005 3 34
3. S. Cabello Approximation algorithms for spreading points J. Algorithms 62 2 2007 49 73
4. B. Chazelle, and J. Matouek On linear-time deterministic algorithms for optimization problems in fixed dimension J. Algorithms 21 1996 579 597
5. P. Colley, H. Meijer, D. Rappaport, Optimal nearly-similar polygon stabbers of convex polygons, in: Proc. 6th Canad. Conf. Comput. Geom., 1994, pp. 269-274
6. J. Fiala, J. Kratochvil, and A. Proskurowski Systems of distant representatives Discrete Appl. Math. 145 2005 306 316
7. L.J. Guibas, D. Salesin, and J. Stolfi Constructing strongly convex approximate hulls with inaccurate primitives Algorithmica 9 1993 534 560
8. S. Jadhav, A. Mukhopadhyay, and B.K. Bhattacharya An optimal algorithm for the intersection radius of a set of convex polygons J. Algorithms 20 1996 244 267
9. W.S. Kendall, O. Barndorff-Nielson, and M.C. van Lieshout Current Trends in Stochastic Geometry: Likelihood and Computation 1998 CRC Press Boca Raton, FL
10. H. Kruger, Basic measures for imprecise point sets in R d, Master's thesis, Utrecht University, 2008
11. M. Löffler, and M. van Kreveld Approximating largest convex hulls for imprecise points J. Discrete Algorithms 6 4 2008 583 594
12. M. Löffler, M. van Kreveld, Largest and smallest convex hulls for imprecise points, Algorithmica (2008), doi:10.1007/s00453-008-9174-2, in press
13. J. Matouek, M. Sharir, and E. Welzl A subexponential bound for linear programming Algorithmica 16 1996 498 516
14. N. Megiddo Linear-time algorithms for linear programming in R 3 and related problems SIAM J. Comput. 12 4 1983 759 776
15. N. Megiddo On the ball spanned by balls Discrete Comput. Geom. 4 1989 605 610
16. T. Nagai, N. Tokura, Tight error bounds of geometric problems on convex objects with imprecise coordinates, in: Proc. Jap. Conf. on Discrete and Comput. Geom., 2000, pp. 252-263
17. T. Nagai, S. Yasutome, and N. Tokura Convex hull problem with imprecise input its solution Systems and Computers in Japan 30 3 1999 31 42
18. D. Rappaport A convex hull algorithm for discs applications Comput. Geom. Theory Appl. 1 3 1992 171 181
19. D. Rappaport Minimum polygon transversals of line segments Internat. J. Comput. Geom. Appl. 5 1995 243 256
20. J. Robert, G. Toussaint, Computational geometry and facility location, Technical Report SOCS 90.20, McGill Univ., Montreal, PQ, 1990
21. A. Rosenfeld Fuzzy geometry: An updated overview Inform. Sci. 110 3-4 1998 127 133
22. M.I. Shamos, Computational geometry, Ph.D. thesis, Dept. Comput. Sci., Yale Univ., New Haven, CT, 1978
23. C.K. Yap An O (n log n ) algorithm for the Voronoi diagram of a set of simple curve segments Discrete Comput. Geom. 2 1987 365 393