Pages that link to "Item:Q1276945"
From MaRDI portal
The following pages link to Checking the convexity of polytopes and the planarity of subdivisions (Q1276945):
Displayed 7 items.
- 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)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- Triangulations in CGAL (Q1602941) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- Triangulations of Line Segment Sets in the Plane (Q5458851) (← links)