Abstract
Access to the shape by its exterior is solved using convex hull. Many algorithms have been proposed in that way. This contribution addresses the open problem of the access of the shape by its interior also called convex skull. More precisely, we present approaches in discrete case. Furthermore, a simple algorithm to approximate the maximum convex subset of star-shaped polygons is described.
Keywords
- shape approximation
- convex hull
- convex skull
- potato peeling
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear time algorithm for computing the Voronoi diagram of a convex polygon. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 39–45, New York City, 25–27 May 1987.
C. Andjar, C. Saona-Vzquez, and I. Navazo. LOD visibility culling and occluder synthesis. Computer Aided Design, 32(13):773–783, November 2000.
J. S. Chang and C. K. Yap. A polynomial solution for the potato-peeling problem. Discrete & Computational Geometry, 1:155–182, 1986.
J.M. Chassery. Discrete and computational geometry approaches applied to a problem of figure approximation. In Proc. 6th Scandinzvian Conf. on Image Analysis (SCIA 89), pages 856–859, Oulu City, 19–22 june 1989.
K. Daniels, V. Milenkovic, and D. yRoth. Finding the largest area axis-parallel rectangle in a polygon. Computational Geometry: Theory and Applications, 7:125–148, 1997.
H. Edelsbrunner. Computing the extreme distances between two convex polygons. Journal of Algorithms, 6:213–224, 1985.
J. E. Goodman. On the largest convex polygon contained in a non-convex n-gon or how to peel a potato. Geometricae Dedicata, 11:99–106, 1981.
D. Roth K. Daniels, V. Milekovic. Finding the largest area axis-parallel rectangle in a polygon. Comput. Geom. Theory Appl, 7:125–148, 1997.
J. O’Rourke, A. Aggarwal, Sanjeev, R. Maddila, and M. Baldwin. An optimal algorithm for finding minimal enclosing triangles. J. Algorithms, 7(2):258–269, 1986.
Joseph O’Rourke. Computational Geometry in C. Cambridge University Press, 1993. ISBN 0-521-44034-3.
F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
D. Wood and C. K. Yap. The orthogonal convex skull problem. Discrete and Computational Geometry, 3:349–365, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer
About this paper
Cite this paper
Chassery, JM., Coeurjolly, D. (2005). Optimal Shape and Inclusion. In: Ronse, C., Najman, L., Decencière, E. (eds) Mathematical Morphology: 40 Years On. Computational Imaging and Vision, vol 30. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3443-1_21
Download citation
DOI: https://doi.org/10.1007/1-4020-3443-1_21
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3442-8
Online ISBN: 978-1-4020-3443-5
eBook Packages: Computer ScienceComputer Science (R0)