Adaptive Algorithms for Planar Convex Hull Problems
- Adaptive Algorithms for Planar Convex Hull Problems
- Ahn, HK; Okamoto, Y
- Date Issued
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper we generalize the framework to geometric problems. To this end, we think of geometric problems as permutation (or rearrangement) problems of arrays, and define the "presortedness" as a distance from the input array to the desired output array. We call an algorithm adaptive if it runs faster when a given input array is closer to the desired output, and furthermore it does not make use of any information of the presortedness. As a case study, we look into the planar convex hull problem for which we discover two natural formulations as permutation problems. An interesting phenomenon that we prove is that for one formulation the problem can be solved adaptively, but for the other formulation no adaptive algorithm can be better than an optimal output-sensitive algorithm for the planar convex hull problem. To further pursue the possibility of adaptive computational geometry, we also consider constructing a kd-tree.
- Article Type
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, vol. E94D, no. 2, page. 182 - 189, 2011-02
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.