Abstract
Starshaped sets (or stars) are objects defined and studied since early 20th century. Stars are closely related to convexity issues. Results about stars have found numerous applications in several mathematical disciplines, such as computational and convex geometry. With the present paper we are initiating a study on digital stars. This is particularly motivated by possible applications in computer vision. We derive several basic properties of digital stars and consider relations between digital starshapedness, continuous starshapedness, and digital convexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boltianskii, V.G., Soltan, P.S.: Combinatorial Geometry of Various Classes of Convex Sets. Chişinău, Stiinţa (1978)
Bresenham, J.: Algorithm for computer control of a digital plotter. IBM Systems Journal 4, 25–30 (1965)
Brimkov, V.E., Klette, R.: Border and surface tracing – theoretical foundations. IEEE Transactions on Pattern Analysis and Machine Intelligence 30(4), 577–590 (2008)
Breen, M.: A Krasnosel’skii theorem for staircase paths in orthogonal polygons. J. Geometry 51, 22–30 (1994)
Breen, M.: An improved Krasnosel’skii-type theorem for orthogonal polygons which are stairshaped via staircase paths. J. Geometry 51, 31–35 (1994)
Brunn, H.: Über Kerneigebiete. Matt. Ann. 73, 436–440 (1913)
Klette, R., Rosenfeld, A.: Digital Geometry – Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Kong, T.Y., Roscoe, A.W., Rosenfeld, A.: Concepts of digital topology. Topology and its Applications 46, 219–262 (1992)
Krasnoselśkii, M.A.: Sur un critère pour qu’un domain soit étoilé. Mat. Sb. 19, 309–310 (1946)
Motwani, R., Raghunathan, A., Saran, H.: Covering orthogonal polygons with star polygons: the perfect graph approach. J. Comput. System Sci. 40, 19–48 (1990)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, New York (1987)
Reveillès, J.-P.: Géométrie Discrète, Calcul en Nombres Entiers et Algorithmique. Thèse d’État. Univ. Louis Pasteur, Strasbourg (1991)
Rosenfeld, A., Klette, R.: Digital straightness. Electronic Notes in Theoretical Computer Science, vol. 46. Elsevier, Amsterdam (2001)
Valentine, F.A.: Convex Sets. McGraw-Hill, New York (1964)
van der Vel, M.: Theory of Convex Structures. Elsevier, Amsterdam (1993)
Veblen, O.: Theory on plane curves in non-metrical analysis situs. Transactions of the American Mathematical Society 6(1), 83–98 (1905)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brimkov, V.E., Barneva, R.P. (2010). Digital Stars and Visibility of Digital Objects. In: Barneva, R.P., Brimkov, V.E., Hauptman, H.A., Natal Jorge, R.M., Tavares, J.M.R.S. (eds) Computational Modeling of Objects Represented in Images. CompIMAGE 2010. Lecture Notes in Computer Science, vol 6026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12712-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-12712-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12711-3
Online ISBN: 978-3-642-12712-0
eBook Packages: Computer ScienceComputer Science (R0)