Abstract
A polygonP is said to be apalm polygon if there exists a pointx∈P such that the Euclidean shortest path fromx to any pointy∈P makes only left turns or only right turns. The set of all such pointsx is called thepalm kernel. In this paper we propose an O(E) time algorithm for recognizing a palm polygonP, whereE is the size of the visibility graph ofP. The algorithm recognizes the given polygonP as a palm polygon by computing the palm kernel ofP. If the palm kernel is not empty,P is a palm polygon.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chazelle B (1991) Triangulating a simple polygon in linear time; Discrete Comput Geom 6:485–524
ElGindy H, Toussaint GT (1989) On geodesic properties of polygons relevant to linear time triangulation. Vis Comput 5:68–74
Ghosh SK (1991) Computing the visibility polygon from a convex set and related problems. J Algorithms 12:75–95
Ghosh SK, Maheshwari A, Pal SP, Saluja S, Veni Madhavan CE Characterizing and recognizing weak visibility polygons. Comput Geom Theory Appl (1993) 3:213–233
Guibas L, Hershberger J, Leven D, Sharir M, Tarjan RE (1987) Linear time algorithms in triangulated simple polygons. Algorithmica 2:209–233
Hershberger J (1989) An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica 4:141–155
Author information
Authors and Affiliations
Additional information
The extended abstract of this paper was reported at the Second Canadian Conference in Computational Geometry, pp. 246–251, 1990
Rights and permissions
About this article
Cite this article
Ghosh, S.K., Maheshwari, A., Pal, S.P. et al. An algorithm for recognizing palm polygons. The Visual Computer 10, 443–451 (1994). https://doi.org/10.1007/BF01910634
Issue Date:
DOI: https://doi.org/10.1007/BF01910634