The following pages link to Computational geometry column 40 (Q2708044):
Displaying 9 items.
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- Finding small triangulations of polytope boundaries is hard (Q1580774) (← links)
- Computational Geometry Column 34 (Q4513228) (← links)
- On the complexity of approximating and illuminating three-dimensional convex polyhedra (Q5057423) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 48 (Q5386748) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 47 (Q5485791) (← links)