Guarding the Vertices of an Orthogonal Terrain using Vertex Guards
classification
💻 cs.CG
keywords
orthogonalterrainverticesguardingalgorithmchainconvexedge
read the original abstract
A terrain T is an x-monotone polygonal chain in the plane; T is orthogonal if each edge of T is either horizontal or vertical. In this paper, we give an exact algorithm for the problem of guarding the convex vertices of an orthogonal terrain with the minimum number of reflex vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.