Paper Info
Title
Searching for the kernel of a polygon—a competitive strategy
Abstract
Abstract: We present a competitive strategy for walking into the kernel of an initiallyunknown star-shaped polygon. From an arbitrary start point, s, within thepolygon, our strategy finds a path to the closest kernel point, k, whose lengthdoes not exceed 5.3331 ...times the distance from s to k. This is complementedby a general lower bound of # 2. Our analysis relies on a result about a newand interesting class of curves which are self-approaching in the following sense.
Year
DOI
Venue
1995
10.1145/220279.220307
Symposium on Computational Geometry 2013
Keywords
Field
DocType
curves with increasing chords,. competitive strategy,competitive strategy,kernel,self-approaching curves.,simple polygon,lower bound
Kernel (linear algebra),Discrete mathematics,Polygon,Computer science,Competitive advantage,Theoretical computer science
Conference
ISBN
Citations 
PageRank 
0-89791-724-3
31
2.52
References 
Authors
10
2
Name
Order
Citations
PageRank
Christian Icking136433.17
Rolf Klein223719.69