Hull is an ANSI C program that computes the convex hull of a point set in general (but small!) dimension. The input is a list of points, and the output is a list of facets of the convex hull of the points, each facet presented as a list of its vertices. (The facets are assumed to be simplices, such as triangles in 3d; this is enforced by tiebreaking, giving a triangulation of a facet by ”placing”.) The program can also compute Delaunay triangulations and alpha shapes, and volumes of Voronoi regions. The program uses exact arithmetic when possible, with a moderate speed penalty. (Typically a factor of 2 or 3 for Delaunay triangulation, less for convex hulls). Output in postscript and OFF format for geomview is supported. (netlib voronoi)

References in zbMATH (referenced in 67 articles , 1 standard article )

Showing results 1 to 20 of 67.
Sorted by year (citations)

1 2 3 4 next

  1. Chang, Hsien-Chih; Har-Peled, Sariel; Raichel, Benjamin: From proximity to utility: a Voronoi partition of Pareto optima (2016)
  2. Fisikopoulos, Vissarion; Peñaranda, Luis: Faster geometric algorithms via dynamic determinant computation (2016)
  3. Pellikka, M.; Suuriniemi, S.; Kettunen, L.; Geuzaine, C.: Homology and cohomology computation in finite element modeling (2013)
  4. Emiris, Ioannis Z.; Fisikopoulos, Vissarion; Konaxis, Christos; Peñaranda, Luis: An output-sensitive algorithm for computing projections of resultant polytopes (2012)
  5. Fisikopoulos, Vissarion; Peñaranda, Luis: Faster geometric algorithms via dynamic determinant computation (2012)
  6. Ozaki, Katsuhisa; Ogita, Takeshi; Oishi, Shin\rqichi: A robust algorithm for geometric predicate by error-free determinant transformation (2012)
  7. Kaplan, Haim; Ramos, Edgar; Sharir, Micha: Range minima queries with respect to a random permutation, and approximate range counting (2011)
  8. Koeppl, Heinz; Andreozzi, Stefano; Steuer, Ralf: Guaranteed and randomized methods for stability analysis of uncertain metabolic networks (2011)
  9. McConnell, R.M.; Mehlhorn, K.; Näher, S.; Schweitzer, P.: Certifying algorithms (2011)
  10. Chazelle, Bernard; Mulzer, Wolfgang: Markov incremental constructions (2009)
  11. Luo, Gang; Wu, Kun-Lung; Yu, Philip S.: Answering linear optimization queries with an approximate stream index (2009)
  12. Coll, Narcís; Guerrieri, Marité; Sellarès, J.Antoni: Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes (2008)
  13. Demmel, James; Dumitriu, Ioana; Holtz, Olga; Koev, Plamen: Accurate and efficient expression evaluation and linear algebra (2008)
  14. Borgwardt, Karl Heinz: Average-case analysis of the double description method and the beneath-beyond algorithm (2007)
  15. Clarkson, Kenneth L.; Varadarajan, Kasturi: Improved approximation algorithms for geometric set cover (2007)
  16. Liu, Jinjie; Lim, Hyun-Kyung; Glimm, James; Li, Xiaolin: A conservative front tracking method in $N$ dimensions (2007)
  17. Chan, Timothy M.: A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries (2006)
  18. González-Escribano, Arturo; Llanos, Diego R.; Davidorden; Palop, Belén: Parallelization alternatives and their performance for the convex hull problem (2006)
  19. Langetepe, Elmar; Zachmann, Gabriel: Geometric data structures for computer graphics. (2006)
  20. Liu, Yuanxin; Snoeyink, Jack: A comparison of five implementations of 3D Delaunay tessellation (2005)

1 2 3 4 next