Abstract
In this article, we present a discrete definition of the classical visibility in computational geometry. We present algorithms to compute the set of pixels in a non-convex domain that are visible from a source pixel. Based on these definitions, we define discrete geodesic paths in discrete domain with obstacles. This allows us to introduce a new geodesic metric in discrete geometry.KeywordsGeodesic DistanceVisibility ProblemChain CodeDistance LabellingBinary RelationshipThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
