Pages that link to "Item:Q3776650"
From MaRDI portal
The following pages link to A heuristic triangulation algorithm (Q3776650):
Displaying 17 items.
- Minimum weight convex Steiner partitions (Q548652) (← links)
- A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
- Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
- Approximating the minimum weight Steiner triangulation (Q1317876) (← links)
- Computing a subgraph of the minimum weight triangulation (Q1327172) (← links)
- New results for the minimum weight triangulation problem (Q1343467) (← links)
- Improved heuristics for the minimum weight triangulation problem (Q1913901) (← links)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM (Q3520429) (← links)
- Surface Realization with the Intersection Segment Functional (Q3550685) (← links)
- (Q3848266) (← links)
- A fast heuristic for approximating the minimum weight triangulation (Q5054821) (← links)
- (Q5743438) (← links)
- A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations (Q5943321) (← links)
- On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation (Q5958132) (← links)
- Constrained independence system and triangulations of planar point sets (Q6064012) (← links)