Constructing a strongly convex superhull of points

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1276, Issue , 1997, Pages 42-51

  Chen, Wei ^a   Deng, Xiao Wen ^a   Wada, Koichi ^a   Kawaguchi, Kimio ^b  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b OSAKA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

CONVEX HULL;

COMPUTATIONAL GEOMETRY;

EID: 33746674719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0045071     Document Type: Conference Paper

References (12)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap: Parallel computational geometry. Algorithmica, 3, 293-327, 1988.
2. M. J. Atallah and M. T. Goodrich: Efficient parallel solutions to some geometric problems. Parallel and Distributed Computing, 3, 492-507, 1986.
3. M. J. Atallah and M. T. Goodrich: Parallel algorithms for some functions of two convex polygons. Algorithmica, 3, 535-548, 1988.
4. 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.
5. 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.
6. 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.
7. 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.
8. R. Cole and M. T. Goodrich: Optimal parallel algorithms for point-set polygon problems. Algorithmica, vol. 7, pp.3-23, 1992.
9. P-O. Fjällström,J. Katajainen, C. Levcopoulos and O. Petersson: A sublogarithmic convex hull algorithm. Bit, 30, 378-384, 1990.
10. L. Guibas, D Salesin and J. Stolfi: Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmiea, 9, 534-560, 1993.
11. Z. Li and V. J. Milenkovic: Constructing strongly convex hulls using exact or rounded arithmetic. Atgorithmica, vol. 8, 345-364, 1992.
12. F. P. Preparata and M. L. Shamos, Computational Geometry: An Introduction (Springer- Verlag, 1985).