The following pages link to (Q4474087):
Displaying 13 items.
- Minimum degree triangulation for rectangular domains (Q1044720) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← 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)
- Approximation for minimum triangulation of convex polyhedra (Q2768283) (← links)
- An improved lower bound on the minimum number of triangulations (Q3132839) (← links)
- (Q3140405) (← links)
- Polygonal approximation by the minimax method (Q3318070) (← 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)