Checking geometric programs or verification of geometric structures
From MaRDI portal
Publication:1286479
DOI10.1016/S0925-7721(98)00036-4zbMath0922.68123OpenAlexW1533283911WikidataQ126850642 ScholiaQ126850642MaRDI QIDQ1286479
Thomas Schilz, Michael Seel, Stefan Schirra, Raimund Seidel, Christian Uhrig, Stefan Näher, Kurt Mehlhorn
Publication date: 3 May 1999
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00036-4
Related Items
Constructing convex 3-polytopes from two triangulations of a polygon, Checking the convexity of polytopes and the planarity of subdivisions (extended abstract), Construction sequences and certifying 3-connectivity, Certifying algorithms, An efficient local approach to convexity testing of piecewise-linear hypersurfaces, Efficient authenticated data structures for graph connectivity and geometric search problems, On the design of CGAL a computational geometry algorithms library, Recent progress in exact geometric computation, A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING, Triangulations of Line Segment Sets in the Plane, Short Tops and Semistable Degenerations
Uses Software
