Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,157,132 papers from all fields of science
Search
Sign In
Create Free Account
Star-shaped polygon
Known as:
Kernel (geometry)
, Kernel of a polygon
, Polygon kernel
Expand
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
Create Alert
Alert
Related topics
Related topics
6 relations
Bowyer–Watson algorithm
Link distance
Monotone polygon
Point in polygon
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Extending Convex Partial Drawings of Graphs
T. Mchedlidze
,
M. Nöllenburg
,
Ignaz Rutter
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
1999
1999
Generating random star-shaped polygons
C. Sohler
CCCG
1999
Corpus ID: 9867154
In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly at…
Expand
1999
1999
Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem
Jae-Ha Lee
,
Kyung-Yong Chwa
Inf. Process. Lett.
1999
Corpus ID: 38268673
1996
1996
On-line target searching in bounded and unbounded domains
P. Ragde
,
A. López-Ortiz
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
1994
1994
Geometric and computational aspects of manufacturing processes
P. Bose
,
G. Toussaint
Comput. Graph.
1994
Corpus ID: 205032940
Review
1992
Review
1992
Interactive reconstruction via geometric probing
S. Skiena
Proc. IEEE
1992
Corpus ID: 2155415
Geometric probing considers problems of determining a geometric structure or some aspect of that structure from the results of a…
Expand
1991
1991
Restricted Orientation Visibility
Sven Schuierery
,
D. Wood
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
1986
1986
On Gallery Watchmen in Grids
S. Ntafos
Inf. Process. Lett.
1986
Corpus ID: 42536420
Highly Cited
1985
Highly Cited
1985
Decomposing a Polygon into Simpler Components
J. Keil
SIAM J. Comput.
1985
Corpus ID: 26105634
The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntactic…
Expand
Highly Cited
1979
Highly Cited
1979
An Optimal Algorithm for Finding the Kernel of a Polygon
D. T. Lee
,
F. Preparata
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
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