Abstract
Let S be a set of n points in the plane and CH(S) be the convex hull of S. An ε-strongly convex δ-superhull is a polygon P satisfying the following conditions: (1) P has at most O(n) vertices, (2) P contains all the points of S, (3) no vertex of P lies farther than δ outside CH(S), and (4) P is convex and remains convex even if its vertices are perturbed by as much as ε (when ε = δ = 0, P is equal to CH(S)). In this paper, we give the first method for finding such a generalized convex hull. We construct an ε-strongly convex (2 + 4√2)ε-superhull with at most n + 1 vertices in O (n log n) time for any ε ≥ 0.
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap: Parallel computational geometry. Algorithmica, 3, 293–327, 1988.
M. J. Atallah and M. T. Goodrich: Efficient parallel solutions to some geometric problems. Parallel and Distributed Computing, 3, 492–507, 1986.
M. J. Atallah and M. T. Goodrich: Parallel algorithms for some functions of two convex polygons. Algorithmica, 3, 535–548, 1988.
W. Chen,K. Nakano, T. Masuzawa, and N. Tokura: Optimal parallel algorithms for finding the convex hull of a sorted point set (in Japanese). IEICE Trans. J74-D-I, 12, 814–825, 1991.
W. Chen, K. Nakano, T. Masuzawa and N. Tokura: A parallel method for the prefix convex hulls problem. IEICE Trans. Fundamentals, E77-A, 10, 1675–1683, 1994.
W. Chen, K. Wada and K. Kawaguchi: Construct A Strongly convex superhull of points. Technical Report of Kawaguchi Lab., Dept. of Electrical and Computer Engineering, Nagoya Institute of Technology, TR97-02, Jan. 1996.
W. Chen, K. Wada and K. Kawaguchi: Parallel Robust Algorithms for Constructing Strongly Convex Hulls. Proc. of the 12th Annual ACM Symposium on Computational Geometry, pp.133–140, 1996.
R. Cole and M. T. Goodrich: Optimal parallel algorithms for point-set polygon problems. Algorithmica, vol. 7, pp.3–23, 1992.
P-O. Fjällström,J. Katajainen, C. Levcopoulos and O. Petersson: A sublogarithmic convex hull algorithm. Bit, 30, 378–384, 1990.
L. Guibas, D Salesin and J. Stolfi: Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmica, 9, 534–560, 1993.
Z. Li and V. J. Milenkovic: Constructing strongly convex hulls using exact or rounded arithmetic. Algorithmica, vol. 8, 345–364, 1992.
F. P. Preparata and M. L. Shamos, Computational Geometry: An Introduction (Springer-Verlag, 1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, W., Deng, X.W., Wada, K., Kawaguchi, K. (1997). Constructing a strongly convex superhull of points. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045071
Download citation
DOI: https://doi.org/10.1007/BFb0045071
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive