Checking geometric programs or verification of geometric structures
From MaRDI portal
Recommendations
Cited in
(15)- Checking the convexity of polytopes and the planarity of subdivisions
- FO model checking on geometric graphs
- Recent progress in exact geometric computation
- Construction sequences and certifying 3-connectivity
- Certifying algorithms
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- On the design of CGAL a computational geometry algorithms library
- scientific article; zbMATH DE number 1390248 (Why is no real title available?)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
- Automatic Verification of Regular Constructions in Dynamic Geometry Systems
- Triangulations of Line Segment Sets in the Plane
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Short tops and semistable degenerations
- Constructing convex 3-polytopes from two triangulations of a polygon
- An efficient local approach to convexity testing of piecewise-linear hypersurfaces
This page was built for publication: Checking geometric programs or verification of geometric structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1286479)