Largest and smallest convex hulls for imprecise points

Algorithmica (New York)

Volumn 56, Issue 2, 2010, Pages 235-269

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

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Computational geometry; Convex hulls; Data imprecision; Imprecision

Indexed keywords

CONVEX HULL; CONVEX HULLS; NP-HARDNESS; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME;

POLYNOMIAL APPROXIMATION;

COMPUTATIONAL GEOMETRY;

EID: 74849124973     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9174-2     Document Type: Article

References (30)

1. M. Abellanas F. Hurtado P.A. Ramos 1999 Structural tolerance and Delaunay triangulation Inf. Process. Lett. 71 221 227 0999.68220 10.1016/S0020-0190(99) 00107-6 1726980 (Pubitemid 30516894)
2. 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)
3. C. Bajaj 1988 The algebraic degree of geometric optimization problems Discrete Comput. Geom. 3 177 191 0647.90087 10.1007/BF02187906 920702
4. Barber, B.C.: Computational geometry with imprecise data and arithmetic. TR-377-91, Ph.D. Thesis, Princeton University, Department of Computer Science (1993)
5. Boissonnat, J.-D., Lazard, S.: Convex hulls of bounded curvature. In: Proceedings of the 8th Canadian Conference on Computational Geometry, pp. 14-19 (1996)
6. L. Cai J.M. Keil 1997 Computing visibility information in an inaccurate simple polygon Int. J. Comput. Geom. Appl. 7 515 538 0887.68108 10.1142/S0218195997000326 1487489 (Pubitemid 128005113)
7. M. de Berg J. Gudmundsson M.J. Katz C. Levcopoulos M.H. Overmars A.F. van der Stappen 2005 TSP with neighborhoods of varying size J. Algorithms 57 1 22 36 1101.68919 10.1016/j.jalgor.2005.01.010 2167166 (Pubitemid 41328529)
8. M. de Berg H. Meijer M.H. Overmars G.T. Wilfong 1998 Computing the angularity tolerance Int. J. Comput. Geom. Appl. 8 467 482 1035.68527 10.1142/S0218195998000242
9. H. Desaulniers N.F. Stewart 1993 Robustness of numerical methods in geometric computation when problem data is uncertain Comput. Aided Des. 25 539 545 0779.65097 10.1016/0010-4485(93)90070-5
10. 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)
11. H. Edelsbrunner 1985 Finding transversals for sets of simple geometric figures Theor. Comput. Sci. 35 55 69 0604.68080 10.1016/0304-3975(85)90005-2 785907
12. J. Fiala J. Kratochvil A. Proskurowski 2005 Systems of distant representatives Discrete Appl. Math. 145 306 316 1084.05059 10.1016/j.dam.2004. 02.018 2113150
13. M. Garey R. Graham D. Johnson 1977 The complexity of computing Steiner minimal trees SIAM J. Appl. Math. 32 835 859 0399.05023 10.1137/0132072 443427
14. M.T. Goodrich J. Snoeyink 1990 Stabbing parallel segments with a convex polygon Comput. Vis. Graph. Image Process. 49 152 170 0771.68104 10.1016/0734-189X(90)90135-I
15. L. Guibas D. Salesin J. Stolfi 1993 Constructing strongly convex approximate hulls with inaccurate primitives Algorithmica 9 534 560 0797.68158 10.1007/BF01190154 1221817
16. 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)
17. 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)
18. Z. Li V. Milenkovic 1992 Constructing strongly convex hulls using exact or rounded arithmetic Algorithmica 8 345 364 0772.68104 10.1007/BF01758851 1195157
19. 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)
20. 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)
21. A. Mukhopadhyay C. Kumar E. Greene B. Bhattacharya 2008 On intersecting a set of parallel line segments with a convex polygon of minimum area Inf. Process. Lett. 105 2 58 64 10.1016/j.ipl.2007.08.029 2364038 (Pubitemid 350011076)
22. 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)
23. D. Rappaport 1995 Minimum polygon transversals of line segments Int. J. Comput. Geom. Appl. 5 3 243 256 0834.68119 10.1142/S0218195995000143 1339186
24. O'Rourke, J.: Sum of Square Roots. http://maven.smith.edu/~orourke/TOPP/ P33.html
25. Ostrovsky-Berman, Y., Joskowicz, L.: Uncertainty envelopes. In: Proceedings of the 21st European Workshop on Computational Geometry, pp. 175-178 (2005)
26. 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)
27. 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)
28. J. Sellen J. Choi C.-K. Yap 2000 Precision-sensitive Euclidean shortest paths in 3-space SIAM J. Comput. 29 1577 1595 0949.68072 10.1137/ S0097539798340205 1744838 (Pubitemid 32021657)
29. Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE Mediterranean Electrotechnical Conference (1983)
30. 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