Approximating largest convex hulls for imprecise points

Journal of Discrete Algorithms

Volumn 6, Issue 4, 2008, Pages 583-594

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

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Computational geometry; Convex hull; Core sets; Data imprecision

Indexed keywords

NUCLEAR PROPULSION;

APPROXIMATION SCHEMES; CONVEX HULL; CONVEX HULLS; CORE-SETS; DATA IMPRECISION; LINE SEGMENTS; LINEAR TIMES; NP-HARDNESS;

COMPUTATIONAL GEOMETRY;

EID: 54449098380     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2008.04.002     Document Type: Article

References (18)

1. Abellanas M., Hurtado F., and Ramos P.A. Structural tolerance and Delaunay triangulation. Inf. Proc. Lett. 71 (1999) 221-227
2. P.K. Agarwal, S. Har-Peled, Approximating extent measures of points, in: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 148-157
3. Agarwal P.K., Har-Peled S., and Varadarajan K.R. Geometric approximation via coresets. In: Goodman J.E., Pach J., and Welzl E. (Eds). Combinatorial and Computational Geometry. MSRI Publications vol. 52 (2005), Cambridge University Press
4. D. Bandyopadhyay, J. Snoeyink, Almost-Delaunay simplices: Nearest neighbour relations for imprecise points, in: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 410-419
5. C.B. Barber, Computational geometry with imprecise data and arithmetic, PhD thesis, Princeton Univ., Princeton, NJ, 1993
6. Chan T.M. Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Int. J. Comput. Geometry Appl. 12 1-2 (2002) 67-85
7. Desaulniers H., and Stewart N.F. Robustness of numerical methods in geometric computation when problem data is uncertain. Comput.-Aided Design 25 (1993) 539-545
8. Fiala J., Kratochvil J., and Proskurowski A. Systems of distant representatives. Discrete Appl. Math. 145 (2005) 306-316
9. G. Frahling, C. Sohler, A fast k-means implementation using coresets, in: Proc. 22nd Annual ACM Symposium on Computational Geometry, 2006, pp. 135-143
10. J. Gao, M. Langberg, L.J. Schulman, Analysis of incomplete data and an intrinsic dimension Helly theorem, in: Proc. 17th Symposium on Discrete Algorithms, 2006, pp. 464-473
11. Guibas L.J., Salesin D., and Stolfi J. Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmica 9 (1993) 534-560
12. frac(5, 2) algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 4 (1973) 225-231
13. Jadhav S., Mukhopadhyay A., and Bhattacharya B.K. An optimal algorithm for the intersection radius of a set of convex polygons. J. Algorithms 20 (1996) 244-267
14. A.A. Khanban, A. Edalat, Computing Delaunay triangulation with imprecise input data, in: Proc. 15th Canad. Conf. on Comput. Geom., 2003, pp. 94-97
15. Li Z., and Milenkovic V. Constructing strongly convex hulls using exact or rounded arithmetic. Algorithmica 8 (1992) 345-364
16. M. Löffler, M. van Kreveld, Largest bounding box, smallest diameter, and related problems on imprecise points, in: Proc. 10th Workshop on Algorithms and Data Structures, LNCS, vol. 4619, 2007, pp. 447-458
17. 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
18. Yap C.-K. Robust geometric computation. In: Goodman J.E., and O'Rourke J. (Eds). Handbook of Discrete and Computational Geometry (2004), Chapman & Hall/CRC 927-952 (Chapter 41)