A computational basis for higher-dimensional computational geometry and applications

DOI10.1016/S0925-7721(98)00011-XzbMath0905.68162OpenAlexW2213377197MaRDI QIDQ1265288

K. Appert

Publication date: 10 November 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00011-x

zbMATH Keywords

convex hullsDelaunay triangulationssoftware library

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Certifying algorithms ⋮ A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING

Uses Software

• LEDA
• Qhull
• Hull

Cites Work

• Four results on randomized incremental constructions
• The quickhull algorithm for convex hulls
• Systems of distinct representatives and linear algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A computational basis for higher-dimensional computational geometry and applications