Pages that link to "Item:Q4216140"
From MaRDI portal
The following pages link to Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation (Q4216140):
Displaying 15 items.
- Minimum weight convex Steiner partitions (Q548652) (← links)
- A linear time algorithm for max-min length triangulation of a convex polygon (Q845931) (← links)
- On minimum weight pseudo-triangulations (Q924080) (← links)
- Decomposing a simple polygon into pseudo-triangles and convex polygons (Q934018) (← links)
- A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- The minimum weight triangulation problem with few inner points (Q2495946) (← links)
- A new asymmetric inclusion region for minimum weight triangulation (Q2655340) (← links)
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM (Q3520429) (← links)
- (Q5743438) (← links)
- On exclusion regions for optimal triangulations (Q5929321) (← links)
- A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations (Q5943321) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)