Skip to main content
SpringerLink
Log in

Construction of the Convex Hull of a Set for a Minimum Number of Iterations

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

An algorithm for constructing the convex hull of a finite set of points in a d-dimensional space for a minimum number of iterations is proposed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Emelichev, V.A., Kovalev, M.M., and Kravtsov, M.K., Mnogogranniki. Grafy. Optimizatsiya (Polyhedra. Graphs. Optimization), Moscow: Nauka, 1981.

    Google Scholar 

  2. Aurenhammer, F., Voronoy Diagrams-A Survey of a Fundamental Geometric Data Structure, ACM Comput. Surv., 1991, vol. 23, pp. 345–405.

    Google Scholar 

  3. Barber, C.B., Dobkin, D.P., and Hundanpaa, H., The Quickhull Algorithm for Convex Hull, ACM Trans. Math. Software, 1996, vol. 22, pp. 469–483.

    Google Scholar 

  4. Chand, D.H. and Kapur, S.S., An Algorithm for Convex Polytope, J. ACM, 1970, vol. 17, pp. 78–86.

    Google Scholar 

  5. Fernandez-Baca, D. and Srinivasan, S., Constructing the Minimization Diagram of a Two-Parameter Problem, Operations Res. Lett., 1991, vol. 10, pp. 87–93.

    Google Scholar 

  6. Kirkpatric, D. and Seidel, R., The Ultimate Planar Convex Hull Algorithm?, SIAM J. Comput., 1986, pp. 287–299.

  7. Mathematical Methods for DNA Sequences, Waterman, M.S., Ed., Boca Raton: CRC, 1989, pp. 55–56.

    Google Scholar 

  8. Zimmer, R. and Lengauer, T., Fast and Numerically Stable Parametric Alignment of Biosequences, Proc. 1st Int. Conf. on Comput. Mol. Biol., ASM, 1997, pp. 344–353.

  9. Preparata, F. and Shamos, M., Computational Geometry: An Introduction, New York: Springer, 1985. Translated under the title Vychislitel'naya geometriya: vvedenie, Moscow: Mir, 1989.

    Google Scholar 

  10. Aleksandrov, A.A., Aleksandrov, N.N., Borodovskii, M.Yu., Kalambet, Yu.A., Kister, A.Z., Mironov, A.A., Pevzner, P.A., and Shepelev, V.A., Komp'yuternyi analiz geneticheskikh tekstov (Computer Analysis of Genetic Texts), Moscow: Nauka, 1990.

    Google Scholar 

  11. Aho, A.V., Horcroft, J.E., and Ulman, J.D., Analysis and Design of Computer Algorithms, Reading, Mass.: Addison-Wesley, 1974. Translated under the title Postroenie i analiz vychislitel'nykh algoritmov, Moscow: Mir, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematical Problems of Biology, Russian Academy of Sciences, ul. Institutskaya 4, Pushchino, Moscow oblast, 142290, Russia

    V. V. Panyukov

Authors
  1. V. V. Panyukov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Panyukov, V.V. Construction of the Convex Hull of a Set for a Minimum Number of Iterations. Programming and Computer Software 29, 112–119 (2003). https://doi.org/10.1023/A:1022956901778

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022956901778

Keywords

Search

Navigation