A unifying approach for a class of problems in the computational geometry of polygons |
| |
Authors: | Francis Chin Jeffrey Sampson Cao An Wang |
| |
Affiliation: | (1) Computer Studies, The University of Hongkong, Pokjulam Road, Hongkong;(2) Department of Computing Science, The University of Alberta, T6G 2H1 Edmonton, Alberta, Canada |
| |
Abstract: | A generalized problem is defined in terms of functions on sets and illustrated in terms of the computational geometry of simple planar polygons. Although its apparent time complexity is O(n2), the problem is shown to be solvable for several cases of interest (maximum and minimum distance, intersection detection and rerporting) in O(n logn), O(n) or O(logn) time, depending on the nature of a specialized selection function. (Some of the cases can also be solved by the Voronoi diagram method; but time complexity increases with that approach.) A new use of monotonicity and a new concept of locality in set mappings contribute significantly to the derivation of the results. |
| |
Keywords: | Computational geometry Locality Monotonicity Polygon distances Polygon intersection Unimodality |
本文献已被 SpringerLink 等数据库收录! |
|