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.
2015
2015
Extending Convex Partial Drawings of Graphs
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2001
Highly Cited
2001
Online routing in geometric graphs
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
  • figure 3.9
  • figure 7.1
  • figure 7.2
  • figure 7.4
  • figure 7.5
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
1996
1996
On-line target searching in bounded and unbounded domains
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
  • figure V
  • figure I
  • figure I
  • figure V
1995
1995
Recognizing s-star polygons
  • 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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1994
1994
Geometric and computational aspects of manufacturing processes
Two of the fundamental questions that arise in the manufacturing industry concerning every type of manufacturing process are: (1… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
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
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
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
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