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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
012319792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random… (More)
Is this relevant?
2003
2003
We study the problem of on-line searching for a target inside a polygon. In particular, we propose a strategy for finding a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
Is this relevant?
1997
1997
We consider searching problems in robotics that a robot has to find a path to a target by traveling in an unknown starshaped… (More)
  • figure 5
Is this relevant?
1995
1995
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
We consider the problem of recognizing star-polygons under staircase visibility (s-visibility). We show that the s-visibility… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1988
1988
A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study… (More)
Is this relevant?
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… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
Is this relevant?
Review
1981
Review
1981
In this paper we show how a theorem in plane geometry can be converted into an O(n log n) algorithm for decomposing a polygon… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
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… (More)
Is this relevant?