You are currently offline. Some features of the site may not work correctly.

# Star-shaped polygon

Known as: Kernel (geometry), Kernel of a polygon, Polygon kernel
A star-shaped polygon is a polygonal region in the plane that is a star domain, that is, a polygon that contains a point from which the entire… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
• Algorithmica
• 2015
• Corpus ID: 17993965
Given a plane graph G (i.e., a planar graph with a fixed planar embedding and outer face) and a biconnected subgraph G^{\prime… Expand
Highly Cited
2001
Highly Cited
2001
• 2001
• Corpus ID: 118489060
This thesis considers the problem of finding a path from a source to a destination in a graph in which only local information is… Expand
1999
1999
In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly at… Expand
1996
1996
• 1996
• Corpus ID: 117556433
In this work we study the problem of a robot searching for a target on bounded and unbounded domains, specifically in one and two… Expand
1995
1995
• L. Gewali
• Pattern Recognit.
• 1995
• Corpus ID: 7730286
Abstract We consider the problem of recognizing star-polygons under staircase visibility (s-visibility). We show that the s… Expand
1994
1994
• Comput. Graph.
• 1994
• Corpus ID: 205032940
Two of the fundamental questions that arise in the manufacturing industry concerning every type of manufacturing process are: (1… Expand
1991
1991
• 1991
• Corpus ID: 17999318
Let O be some set of orientations, i.e., O 0 ; 360). In this paper we look at the consequences of deening visibility based on… Expand
Highly Cited
1985
Highly Cited
1985
The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntactic… Expand
Highly Cited
1981
Highly Cited
1981
• Pattern Recognit.
• 1981
• Corpus ID: 7230110
Abstract In this paper we show how a theorem in plane geometry can be converted into a O(n log n) algorithm for decomposing a… Expand
Highly Cited
1979
Highly Cited
1979
• JACM
• 1979
• Corpus ID: 6156190
The kernel K(P) of a simple polygon P wah n verUces is the locus of the points internal to P from which all verUces of P are… Expand