Pages that link to "Item:Q1286479"
From MaRDI portal
The following pages link to Checking geometric programs or verification of geometric structures (Q1286479):
Displaying 11 items.
- Certifying algorithms (Q465678) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Constructing convex 3-polytopes from two triangulations of a polygon (Q598553) (← links)
- An efficient local approach to convexity testing of piecewise-linear hypersurfaces (Q955229) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- On the design of CGAL a computational geometry algorithms library (Q4789074) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
- Triangulations of Line Segment Sets in the Plane (Q5458851) (← links)
- Short Tops and Semistable Degenerations (Q5498921) (← links)
