Largest bounding box, smallest diameter, and related problems on imprecise points (2007)
| Venue: | In Proc. 10th Workshop on Algorithms and Data Structures, LNCS 4619 |
| Citations: | 11 - 7 self |
BibTeX
@INPROCEEDINGS{Kreveld07largestbounding,
author = {Marc Van Kreveld and Maarten Löffler and Maarten Löffler and Marc Kreveld},
title = {Largest bounding box, smallest diameter, and related problems on imprecise points},
booktitle = {In Proc. 10th Workshop on Algorithms and Data Structures, LNCS 4619},
year = {2007},
pages = {447--458}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We model imprecise points as regions in which one point must be located. We study computing the largest and smallest possible values of various basic geometric measures on sets of imprecise points, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others. 1
