Skip to search formSkip to main content
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

Related topics

Related topics

6 relations
Bowyer–Watson algorithmLink distanceMonotone polygonPoint in polygon
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
An algorithm to searching for the kernel of a simple polygon
  • Jun Zhao, Xin Wang
  • International Conference on Computer Application…
  • 2010
    • Corpus ID: 15535479
In this paper, an algorithm to searching for the kernel of a simple polygon is proposed. The concave vertices of the polygon are… Expand
  • figure 2
  • figure I
  • table 1
Is this relevant?
2008
2008
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
A star-shapeddrawing of a graph is a straight-line drawing such that each inner facial cycle is drawn as a star-shaped polygon… Expand
Is this relevant?
1999
1999
Generating random star-shaped polygons
In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly at… Expand
Is this relevant?
1994
1994
Recognizing s-star polygons
Abstract We consider the problem of recognizing star-polygons under staircase visibility (s-visibility). We show that the s… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1991
1991
Restricted Orientation Visibility
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
  • figure 6
  • figure 7
  • figure 15
  • figure 36
  • figure 37
Is this relevant?
1990
1990
Searching for empty convex polygons
A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study… Expand
  • figure 1
Is this relevant?
1986
1986
On Gallery Watchmen in Grids
A new and distinct interspecific rootstock tree having the following unique combination of outstanding features that are… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Decomposing a Polygon into Simpler Components
The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntactic… Expand
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An efficient algorithm for decomposing a polygon into star-shaped polygons
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
An Optimal Algorithm for Finding the Kernel of a Polygon
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
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE