An output sensitive algorithm for discrete convex hulls

Computational Geometry: Theory and Applications

Volumn 10, Issue 2, 1998, Pages 125-138

  Har Peled, Sariel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Continued fractions; Convex hull; Discrete hull

Indexed keywords

EID: 0040757539     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00031-X     Document Type: Article

References (17)

1. G.E. Andrews, A lower bound for the volume of strictly convex bodies with many boundary lattice points, Trans. Amer. Math. Soc. 106 (1963) 270-279.
2. A. Balog, I. Bárány, On the convex hull of the integer points in a disc, in: Proc. 7th Annu. ACM Sympos. Comput. Geom., 1991, pp. 162-165.
3. I. Bárány, Personal communication, 1996.
4. I. Bárány, D.G. Larman, The convex hull of the integer points in a large ball, Manuscript, 1996.
5. I. Bárány, A.M. Vershik, On the number of convex lattice polytopes, Geometry and Functional Analysis 2 (1992) 381-393.
6. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
7. H. Davenport, The Higher Arithmetic: Introduction to the Theory of Numbers, Oxford University Press, Oxford, 1983.
8. D.P. Dobkin, D.G. Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra, J. Algorithms 6 (1985) 381-392.
9. A. Efrat, C. Gotsman, Subpixel image registration using circular fiducials, Internat. J. Comput. Geom. Appl. 4 (4) (1994) 403-422.
10. D.H. Greene, F.F. Yao, Finite-resolution computational geometry, in: Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci., 1986, pp. 143-152.
11. G. Hardy, E. Wright, The Theory of Numbers, Oxford University Press, London, 4th ed., 1965.
12. S. Har-Peled, M. Sharir, K.R. Varadarajan, Approximate shortest paths on a convex polytope in three dimensions, in: Proc. 12th Annu. ACM Sympos. Comput. Geom., 1996 pp. 329-338.
13. S. Kahan, J. Snoeyink, On the bit complexity of minimum link paths: Superquadratic algorithms for problems solvable in linear time, in: Proc. 12th Annu. ACM Sympos. Comput. Geom., 1996 pp. 151-158.
14. M.D. Katz, D.J. Volper, Data structures for retrieval on square grids, SIAM J. Comput. 15 (4) (1986) 919-931.
15. H.S. Lee, R.C. Chang, Approximating vertices of a convex polygon with grid points in the polygon, in: Proc. 3rd Annu. Internat. Sympos. Algorithms Comput. (ISAAC '92), Lecture Notes in Computer Science 650, Springer, Berlin, 1992, pp. 269-278.
16. J. O'Rourke, Computational Geometry in C, Cambridge University Press, Cambridge, 1994.
17. T. Thiele, Diplomarbeit, Free University Berlin, August 1991.