On overlays and minimization diagrams

Discrete and Computational Geometry

Volumn 41, Issue 3, 2009, Pages 385-397

  Koltun, Vladlen ^a   Sharir, Micha ^b,c  

^a Stanford University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Arrangements; Combinatorial complexity; Lower envelopes; Minimization diagrams; Overlays

Indexed keywords

EID: 62249096226     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-009-9139-5     Document Type: Article

References (22)

1. Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49-119. Elsevier, Amsterdam (2000)
2. P.K. Agarwal O. Schwarzkopf M. Sharir 1996 The overlay of lower envelopes and its applications Discrete Comput. Geom. 15 1 13
3. P.K. Agarwal B. Aronov M. Sharir 1997 Computing envelopes in four dimensions with applications SIAM J. Comput. 26 1714 1732
4. P.K. Agarwal B. Aronov S. Har-Peled M. Sharir 2000 Approximation and exact algorithms for minimum-width annuli and shells Discrete Comput. Geom. 24 4 687 705
5. P.K. Agarwal B. Aronov M. Sharir 2001 Exact and approximation algorithms for minimum-width cylindrical shells Discrete Comput. Geom. 26 307 320
6. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2003)
7. P.J. Besl N.D. [tmp] McKay 1992 A method for registration of 3-d shapes IEEE Trans. Pattern Anal. Mach. Intell. 14 2 239 256
8. T.M. Chan 2002 Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus Int. J. Comput. Geom. Appl. 12 2 67 85
9. B. Chazelle 1993 An optimal convex hull algorithm in any fixed dimension Discrete Comput. Geom. 10 377 409
10. K.L. Clarkson 1988 A randomized algorithm for closest-point queries SIAM J. Comput. 17 830 847
11. Duncan, C.A., Goodrich, M.T., Ramos, E.A.: Efficient approximation and optimization algorithms for computational metrology. In: Proc. 8th ACM-SIAM Annu. Sympos. Discrete Algo., pp. 121-130 (1997)
12. Ebara, H., Fukuyama, N., Nakano, H., Nakanishi, Y.: Roundness algorithms using the Voronoi diagrams. In: Abstracts 1st Canad. Conf. Comput. Geom., p. 41 (1989)
13. H. Edelsbrunner 1989 The upper envelope of piecewise linear functions: Tight complexity bounds in higher dimensions Discrete Comput. Geom. 4 337 343
14. H. Edelsbrunner R. Seidel 1986 Voronoi diagrams and arrangements Discrete Comput. Geom. 1 25 44
15. Ezra, E., Sharir, M., Efrat, A.: On the ICP algorithm. In: Proc. 22nd ACM Symposium on Computational Geometry, pp. 95-104 (2006)
16. L.J. Guibas D. Halperin J. Matoušek M. Sharir 1995 On vertical decomposition of arrangements of hyperplanes in four dimensions Discrete Comput. Geom. 14 113 122
17. V. Koltun M. Sharir 2003 The partition technique for overlays of envelopes SIAM J. Comput. 32 841 863
18. V. Koltun C. Wenk 2005 Matching polyhedral terrains using overlays of envelopes Algorithmica 41 159 183
19. P. [tmp] McMullen 1970 The maximal number of faces of a convex polytope Mathematika 17 179 184
20. M. Sharir 1994 Almost tight upper bounds for lower envelopes in higher dimensions Discrete Comput. Geom. 12 327 345
21. Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)
22. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995). Revised edition 1998