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 76 articles , 1 standard article )

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

1 2 3 4 next

  1. Clarkson, Kenneth L.; Gärtner, Bernd; Lengler, Johannes; Szedlák, May: Random sampling with removal (2020)
  2. Ezra, Esther; Har-Peled, Sariel; Kaplan, Haim; Sharir, Micha: Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (2020)
  3. Arseneva, Elena; Papadopoulou, Evanthia: Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended (2019)
  4. Bohler, Cecilia; Klein, Rolf; Liu, Chih-Hung: Abstract Voronoi diagrams from closed bisecting curves (2017)
  5. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  6. Chang, Hsien-Chih; Har-Peled, Sariel; Raichel, Benjamin: From proximity to utility: a Voronoi partition of Pareto optima (2016)
  7. Fisikopoulos, Vissarion; Peñaranda, Luis: Faster geometric algorithms via dynamic determinant computation (2016)
  8. Sobamowo, M. G.: On the extension of Sarrus’ rule to (n \timesn) ((n > 3)) matrices: development of new method for the computation of the determinant of (4 \times4) matrix (2016)
  9. Acar, Umut A.; Cotter, Andrew; Hudson, Benoît; Türkoğlu, Duru: Dynamic well-spaced point sets (2013)
  10. Buechler, S. R.; Johnson, S. M.: Efficient generation of densely packed convex polyhedra for 3D discrete and finite-discrete element methods (2013)
  11. Pellikka, M.; Suuriniemi, S.; Kettunen, L.; Geuzaine, C.: Homology and cohomology computation in finite element modeling (2013)
  12. Emiris, Ioannis Z.; Fisikopoulos, Vissarion; Konaxis, Christos; Peñaranda, Luis: An output-sensitive algorithm for computing projections of resultant polytopes (2012)
  13. Fisikopoulos, Vissarion; Peñaranda, Luis: Faster geometric algorithms via dynamic determinant computation (2012)
  14. Ozaki, Katsuhisa; Ogita, Takeshi; Oishi, Shiníchi: A robust algorithm for geometric predicate by error-free determinant transformation (2012)
  15. Kaplan, Haim; Ramos, Edgar; Sharir, Micha: Range minima queries with respect to a random permutation, and approximate range counting (2011)
  16. Koeppl, Heinz; Andreozzi, Stefano; Steuer, Ralf: Guaranteed and randomized methods for stability analysis of uncertain metabolic networks (2011)
  17. McConnell, R. M.; Mehlhorn, K.; Näher, S.; Schweitzer, P.: Certifying algorithms (2011)
  18. Chazelle, Bernard; Mulzer, Wolfgang: Markov incremental constructions (2009)
  19. Luo, Gang; Wu, Kun-Lung; Yu, Philip S.: Answering linear optimization queries with an approximate stream index (2009) ioport
  20. Coll, Narcís; Guerrieri, Marité; Sellarès, J. Antoni: Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes (2008)

1 2 3 4 next