Skip to main content
Log in

A new representation and algorithm for constructing convex hulls in higher dimensional spaces

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper presents a new and simple scheme to describe the convex hull in Rd, which only uses three kinds of the faces of the convex hull, i. e., thed-1-faces,d-2-faces and 0-faces. Thus, we develop an efficient new algorithm for constructing the convex hull of a finite set of points incrementally. This algorithm employs much less storage and time than that of the previously existing approaches. The analysis of the running time as well as the storage for the new algorithm is also theoretically made. The algorithm is optimal in the worst case for evend.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. A. Preparata and M. I. Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.

  2. H. Edelsbrunner, Algorithms in Combinational Geometry, Springer-Verlag, 1987.

  3. A. M. Day, Planar convex hull algorithms in theorey and practice.Comput. Graph. Forum, 1988, 7, 177–193.

    Article  Google Scholar 

  4. K. Q. Brown, Geometric Transformations for Fast Geometric Algorithms. Ph. D Thesis, Carmegic Mellon Univ., 1979.

  5. D. Avis and B. K. Bhattacharya, Algorithm for computingd-dimensional Voronoi Diagrams and Their Duals. InComputational Geometry, F. A. Preparata ed., JAT Press, INC, 1984, 159–180.

  6. W. Lü, On Multidimensional Models for CAD. Ph. D. Thesis, Zhejiang University, 1989.

  7. D. R. Chang and S. S. Kapur, An algorithm for convex polytopes.J. ACM, 1970, 17 (1), 78–86.

    Article  Google Scholar 

  8. M. Kallay, Convex Hull Algorithms in Higher Dimensions. Dept. of Math., Univ. of Oklahoma, 1981.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work is supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lü, W., Liang, Y. A new representation and algorithm for constructing convex hulls in higher dimensional spaces. J. of Comput. Sci. & Technol. 7, 1–5 (1992). https://doi.org/10.1007/BF02946159

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946159

Keywords

Navigation