An algorithm for recognizing palm polygons

Ghosh, Subir Kumar ; Maheshwari, Anil ; Pal, Sudebkumar Prasant ; Veni Madhavan, C. E. (1993) An algorithm for recognizing palm polygons Visual Computer, 10 (8). pp. 443-451. ISSN 0178-2789

Full text not available from this repository.

Official URL:

Related URL:


A polygon P is said to be apalm polygon if there exists a point x∈P such that the Euclidean shortest path from x to any point y∈P makes only left turns or only right turns. The set of all such points x is called the palm kernel. In this paper we propose an O(E) time algorithm for recognizing a palm polygon P, where E is the size of the visibility graph of P. The algorithm recognizes the given polygon P as a palm polygon by computing the palm kernel of P. If the palm kernel is not empty,P is a palm polygon.

Item Type:Article
Source:Copyright of this article belongs to Springer.
Keywords:Computational Geometry; Palm Polygon; Weak Visibility Polygon; Visibility Graph; Kernel
ID Code:76276
Deposited On:31 Dec 2011 08:56
Last Modified:31 Dec 2011 08:56

Repository Staff Only: item control page