Approximating minimum-weight triangulations in three dimensions
From MaRDI portal
Recommendations
Cited in
(23)- Minimizing the stabbing number of matchings, trees, and triangulations
- Convex subdivisions with low stabbing numbers
- Cost-driven octree construction schemes: An experimental study
- LMT-skeleton heuristics for several new classes of optimal triangulations
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
- Cost prediction for ray shooting in octrees
- Octrees with near optimal cost for ray-shooting
- Approximation for minimum triangulation of convex polyhedra
- Minimum Average Distance Triangulations
- Finding a maximum weight triangle in n 3-Δ time, with applications
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
- scientific article; zbMATH DE number 1305409 (Why is no real title available?)
- scientific article; zbMATH DE number 1305489 (Why is no real title available?)
- scientific article; zbMATH DE number 2080989 (Why is no real title available?)
- scientific article; zbMATH DE number 1496856 (Why is no real title available?)
- scientific article; zbMATH DE number 871937 (Why is no real title available?)
- Minimum weight disk triangulations and fillings
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- Algorithms and Computation
- The drawability problem for minimum weight triangulations
- Polygon decomposition for efficient construction of Minkowski sums
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
This page was built for publication: Approximating minimum-weight triangulations in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293672)
