Pages that link to "Item:Q1969592"
From MaRDI portal
The following pages link to The greedy triangulation can be computed from the Delaunay triangulation in linear time (Q1969592):
Displaying 8 items.
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- A new asymmetric inclusion region for minimum weight triangulation (Q2655340) (← links)
- A fast heuristic for approximating the minimum weight triangulation (Q5054821) (← links)
- Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)
- (Q6124757) (← links)
