A new asymmetric inclusion region for minimum weight triangulation
From MaRDI portal
(Redirected from Publication:2655340)
Recommendations
Cites work
- scientific article; zbMATH DE number 1555960 (Why is no real title available?)
- A large subgraph of the minimum weight triangulation
- A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations
- A new subgraph of minimum weight triangulations
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- Applications of a new space-partitioning technique
- Computing a subgraph of the minimum weight triangulation
- Cutting hyperplanes for divide-and-conquer
- DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND
- Minimum-weight triangulation is NP-hard
- New results on MWT subgraphs
- On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
- The greedy triangulation can be computed from the Delaunay triangulation in linear time
- The minimum weight triangulation problem with few inner points
Cited in
(3)
This page was built for publication: A new asymmetric inclusion region for minimum weight triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655340)