Pages that link to "Item:Q2368129"
From MaRDI portal
The following pages link to Edge insertion for optimal triangulations (Q2368129):
Displaying 18 items.
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- A linear time algorithm for max-min length triangulation of a convex polygon (Q845931) (← links)
- Generating realistic terrains with higher-order Delaunay triangulations (Q870427) (← links)
- Flips in planar graphs (Q950400) (← links)
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Tiling space and slabs with acute tetrahedra. (Q1428462) (← links)
- Constrained higher order Delaunay triangulations (Q1776901) (← links)
- LMT-skeleton heuristics for several new classes of optimal triangulations (Q1841243) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- Algorithms for optimal area triangulations of a convex polygon (Q2432732) (← links)
- Edge Proximity Conditions for Extendability in Planar Triangulations (Q2947852) (← links)
- (Q4395207) (← links)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
- Dilation-Optimal Edge Deletion in Polygonal Cycles (Q5387748) (← links)
- Optimal Triangulation with Steiner Points (Q5387801) (← links)
- Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)
- On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation (Q5958132) (← links)