skip to main content
article
Free Access

The quickhull algorithm for convex hulls

Published:01 December 1996Publication History
Skip Abstract Section

Abstract

The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm. It is similar to the randomized, incremental algorithms for convex hull and delaunay triangulation. We provide empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it used less memory. computational geometry algorithms have traditionally assumed that input sets are well behaved. When an algorithm is implemented with floating-point arithmetic, this assumption can lead to serous errors. We briefly describe a solution to this problem when computing the convex hull in two, three, or four dimensions. The output is a set of “thick” facets that contain all possible exact convex hulls of the input. A variation is effective in five or more dimensions.

References

  1. ALLEN, S. AND DUTTA, D. 1995. Determination and evaluation of support structures in layered manufacturing. J. Des. Manufactur. 5, 153-162.Google ScholarGoogle Scholar
  2. AURENHAMMER, F. 1991. Voronoi diagrams--A survey of a fundamental geometric data structure. ACM Cornput. Surv. 23, 345-405. Google ScholarGoogle Scholar
  3. Avis, D. AND BREMNER, D. 1995. How good are convex hull Algorithms? In Proceedings of the llth Annual ACM Symposium on Computational Geomett3,. ACM, New York, 20-28. Google ScholarGoogle Scholar
  4. BARBER, C. B., DOBKIN, D. P., AND HUHDANPAA, H. 1993. The Quickhull Algorithm for convex hull. Tech. Rep. GCG53, The Geometry Center, Univ. of Minnesota, Minneapolis, Minn.Google ScholarGoogle Scholar
  5. BOARDMAN, J. 1993. Automating spectral unmixing of AVIRIS data using convex geometry concepts. In the 4th JPL Airborne Geoscience Workshop (Washington, D.C.). JPL, Pasadena, Calif.Google ScholarGoogle Scholar
  6. BOISSONNAT, J.-D. AND TEILLAUD, M. 1993. On the randomized construction of the Delaunay tree. Theoret. Comput. Sci. 112, 339-354. Google ScholarGoogle Scholar
  7. BORDIGNON, K. A. AND DURHAM, W. C. 1995. Closed-form solutions to constrained control allocation problem. J. Guidance Contr. Dynam. 18, 5, 1000-1007.Google ScholarGoogle Scholar
  8. BROWN, D. 1979. Voronoi diagrams from convex hulls. Inf. Process. Lett. 9, 223-228.Google ScholarGoogle Scholar
  9. BYKAT, A. 1978. Convex hull of a finite set of points in two dimensions. Inf. Process. Lett. 7, 296 -298.Google ScholarGoogle Scholar
  10. CHAND, D. AND KAPUR, S. 1970. An algorithm for convex polytopes. J. ACM 7, 1, 78-86. Google ScholarGoogle Scholar
  11. CHAZELLE, B. AND MATOUSEK, J. 1992. Randomizing an output-sensitive convex hull algorithm in three dimensions. Tech. Rep. TR-361-92, Princeton Univ., Princeton, N.J.Google ScholarGoogle Scholar
  12. CLARKSON, K. AND SHOR, P. 1989. Applications of random sampling in computational geometry, ii. Discr. Comput. Geom. 4, 387-421. Google ScholarGoogle Scholar
  13. CLARKSON, K.L. 1992. Safe and effective determinant evaluation. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science. IEEE, New York, 387-395.Google ScholarGoogle Scholar
  14. CLARKSON, K. L. 1995. A program for convex hulls. ATT, Murray Hill, N.J. Available as http://netlib.att.com/netlib/voronoi/hull.html.Google ScholarGoogle Scholar
  15. CLARKSON, K. L., MEHLHORN, K., AND SEIDEL, R. 1993. Four results on randomized incremental constructions. Comput. Geom. Theory Appl. 3, 185-211. Also in Lecture Notes in Computer Science. Vol. 577, pp. 463-474. Google ScholarGoogle Scholar
  16. CUCKA, P., NETANYAHU, N., AND ROSENFELD, A. 1995. Learning in navigation: Goal finding in graphs. Tech. Rep. CAR-TR-759, Center for Automation Research, Univ. of Maryland, College Park, Md.Google ScholarGoogle Scholar
  17. DEY, T. K., SUGIHARA, K., AND BAJAJ, C.L. 1992. Delaunay triangulations in three dimensions with finite precision arithmetic. Comput. Aided Geom. Des. 9, 457-470. Google ScholarGoogle Scholar
  18. EDDY, W. 1977. A new convex hull algorithm for planar sets. ACM Trans. Math. Softw. 3, 4, 398 -403. Google ScholarGoogle Scholar
  19. EDELSBRUNNER, H. AND SHAH, N. 1992. Incremental topological flipping works for regular triangulations. In Proceedings of the Symposium on Computational Geometl),. ACM, New York, 43-52. Google ScholarGoogle Scholar
  20. FORTUNE, S. 1989. Stable maintenance of point-set triangulation in two-dimensions. In the 30th Annual Symposium on the Foundations of Computer Science. IEEE, New York.Google ScholarGoogle Scholar
  21. FORTUNE, S. 1993. Computational geometry. In Directions in Geometric Computing, R. Martin, Ed. Information Geometers, Winchester, U.K.Google ScholarGoogle Scholar
  22. FUKUDA, K. AND PRODON, A. 1996. Double description method revisited. In Lecture Notes in Computer Science, vol. 1120. Springer-Verlag, Berlin. Available also at ftp://ifor13.ethz.ch/ pub/fukudaJcdd. Google ScholarGoogle Scholar
  23. GREEN P. AND SILVERMAN, B. 1979. Constructing the convex hull of a set of points in the plane. Comput. J. 22, 262-266.Google ScholarGoogle Scholar
  24. GRi)NBAUM, B. 1961. Measure of symmetry for convex sets. In Proceedings of the 7th Symposium in Pure Mathematics of the American Mathematical Society, Symposium on Convexity. AMS, Providence, R.I., 233-270.Google ScholarGoogle Scholar
  25. GUIBAS, L., KNUTH, D., AND SHARIR, M. 1992. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 9, 534-560.Google ScholarGoogle Scholar
  26. JoE, B. 1991. Construction of three-dimensional Delaunay triangulations using local transformations. Comput. Aided Geom. Des. 8, 123-142. Google ScholarGoogle Scholar
  27. KALLAY, M. 1981. Convex hull algorithms in higher dimensions. Unpublished manuscript, Dept. of Mathematics, Univ. of Oklahoma, Norman, Okla.Google ScholarGoogle Scholar
  28. KIRKPATRICK, U. AND SEIDEL, R. 1986. The ultimate planar convex hull algorithm? SIAM J. Comput. 15, 287-299. Google ScholarGoogle Scholar
  29. KLEE, V. 1966. Convex polytopes and linear programming. In Proceedings of the IBM Scientific Computing Symposium: Combinatorial Problems. IBM, Armonk, N.Y., 123-158.Google ScholarGoogle Scholar
  30. LI, Z. AND MILENKOVIC, V. 1990. Constructing strongly convex hulls using exact or rounded arithmetic. In Proceedings of the Symposium on Computational Geometry. ACM, New York, 197-207. Google ScholarGoogle Scholar
  31. MOTZKIN, T. S., RAIFFA, H., THOMPSON, G. L., AND THRALL, R.M. 1953. The double description method. In Contributions of the TheolT of Games II, H. W. Kuhn and A. W. Tucker, Eds. Annals of Mathematics, vol. 8. Princeton University Press, Princeton, N.J., 51-73.Google ScholarGoogle Scholar
  32. MULMULEY, D. 1994. Computational Geometry, An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, N.J.Google ScholarGoogle Scholar
  33. PORTER, D., GLAVINAS, E., DHAGAT, P., O'SULLIVAN, J. A., INDECK, R. S., A~D MULLER, M. W. 1996. Irregular grain structure in micromagnetic simulation. J. Appl. Physics 79, 8, 4694-4696.Google ScholarGoogle Scholar
  34. PREPARATA, D. F. AND SHAMOS, M. 1985. Computational GeometlT. An Introduction. Springer- Verlag, Berlin. Google ScholarGoogle Scholar
  35. SEIDEL, R. 1986. Constructing higher-dimensional convex hulls at logarithmic cost per face. In Proceedings of the 18th ACM Symposium on the TheolT of Computing. ACM, New York, 404-413. Google ScholarGoogle Scholar
  36. SHEWCHUK, J.R. 1996. Triangle: Engineering a 2D quality mesh generator and delaunay triangulator. In the 1st Workshop on Applied Computational GeometlT. ACM, New York. Also available as http://www.cs.cmu.edu/~quake/triangle.html. Google ScholarGoogle Scholar
  37. SUGIHARA, K. 1992. Topologically consistent algorithms related to convex polyhedra. In Algorithms and Computation, 3rd International Symposium (ISSAC '92). Lecture Notes in Computer Science, vol. 650. Springer-Verlag, Berlin, 209-218. Google ScholarGoogle Scholar
  38. WEEKS, J. 1991. Convex hulls and isometrics of cusped hyperbolic 3-manifolds. Tech. Rep. TR GCG32, The Geometry Center, Univ. of Minnesota, Minneapolis, Minn. Aug.Google ScholarGoogle Scholar
  39. ZHANG, B., GOODSON, M., AND SCHREIER, R. 1994. Invariant sets for general second-order low-pass delta-sigma modulators with dc inputs. In the IEEE International Symposium on Circuits and Systems. IEEE, New York, 1-4.Google ScholarGoogle Scholar

Index Terms

  1. The quickhull algorithm for convex hulls

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader