A Quadratic Time Algorithm for the Minmax Length Triangulation
From MaRDI portal
Recommendations
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
- scientific article; zbMATH DE number 4064506
- A linear time algorithm for max-min length triangulation of a convex polygon
- Quadratic time computable instances of MaxMin and MinMax area triangulations of convex polygons
- New results for the minimum weight triangulation problem
Cited in
(20)- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Computing MaxMin edge length triangulations
- LMT-skeleton heuristics for several new classes of optimal triangulations
- An algorithm for constructing locally optimal min-max triangulation
- Quadratic time computable instances of MaxMin and MinMax area triangulations of convex polygons
- 3D boundary recovery by constrained Delaunay tetrahedralization
- Extending the quadrangle inequality to speed-up dynamic programming
- Computing diverse and nice triangulations
- Optimization for first order Delaunay triangulations
- A linear time algorithm for max-min length triangulation of a convex polygon
- An exact algorithm for the minimum dilation triangulation problem
- A cubic-time algorithm for computing the trinet distance between level-1 networks
- Approximating uniform triangular meshes in polygons.
- Locating a Point of Minimum Variance on Triangular Graphs
- Optimal Higher Order Delaunay Triangulations of Polygons
- One-parameter family of Neville-Aitken algorithm on q-triangle
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
- Optimal higher order Delaunay triangulations of polygons
- Computing MaxMin edge length triangulations
This page was built for publication: A Quadratic Time Algorithm for the Minmax Length Triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202210)
