Pages that link to "Item:Q2768283"
From MaRDI portal
The following pages link to Approximation for minimum triangulation of convex polyhedra (Q2768283):
Displaying 17 items.
- Approximating polyhedra with sparse inequalities (Q896289) (← links)
- Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
- Minimum degree triangulation for rectangular domains (Q1044720) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Minimal roughness property of the Delaunay triangulation: A shorter approach (Q1195758) (← links)
- One approach to constructing a minimal convex hull (Q1759118) (← links)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees (Q2387200) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Computational geometry column 40 (Q2708044) (← links)
- (Q3140405) (← links)
- Polygonal approximation by the minimax method (Q3318070) (← links)
- (Q4474087) (← links)
- (Q4530817) (← links)
- Solutions to the Minimum Variance Problem Using Delaunay Triangulation (Q5139666) (← links)
- (Q5471567) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901270) (← links)
- Approximation for minimum triangulations of simplicial convex 3-polytopes (Q5955142) (← links)