Digital stars and visibility of digital objects

Authors:
Valentin E. Brimkov;Reneta P. Barneva
Affiliations:
Mathematics Department, SUNY Buffalo State College, Buffalo, NY;Department of Computer Science, SUNY Fredonia, NY
Venue:
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Year:
2010

Citing 5
Cited 0

Art gallery theorems and algorithms

Art gallery theorems and algorithms
Covering orthogonal polygons with star polygons: the perfect graph approach

Journal of Computer and System Sciences
Digital Geometry: Geometric Methods for Digital Picture Analysis

Digital Geometry: Geometric Methods for Digital Picture Analysis
Border and Surface Tracing - Theoretical Foundations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithm for computer control of a digital plotter

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

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.