Searching for the Kernel of a Polygon: A Competitive Strategy Using Self-Approaching Curves (1995)
| Venue: | In Proc. 11th Annu. ACM Sympos. Comput. Geom |
| Citations: | 25 - 11 self |
BibTeX
@INPROCEEDINGS{Icking95searchingfor,
author = {Christian Icking and Rolf Klein and Elmar Langetepe},
title = {Searching for the Kernel of a Polygon: A Competitive Strategy Using Self-Approaching Curves},
booktitle = {In Proc. 11th Annu. ACM Sympos. Comput. Geom},
year = {1995},
pages = {258--266}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy finds a path to the closest kernel point, k, whose length does not exceed 5.3331 ...times the distance from s to k. This is complemented by a general lower bound of # 2. Our analysis relies on a result about a new and interesting class of curves which are self-approaching in the following sense.
