Approximating minimum-weight triangulations in three dimensions
From MaRDI portal
Publication:1293672
DOI10.1007/PL00009436zbMATH Open0933.68138OpenAlexW2083494307MaRDI QIDQ1293672FDOQ1293672
Publication date: 29 June 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009436
Recommendations
Cited In (21)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation
- Minimum Average Distance Triangulations
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
- LMT-skeleton heuristics for several new classes of optimal triangulations
- Cost prediction for ray shooting in octrees
- Title not available (Why is that?)
- Cost-driven octree construction schemes: An experimental study
- Polygon decomposition for efficient construction of Minkowski sums
- Minimizing the stabbing number of matchings, trees, and triangulations
- Octrees with near optimal cost for ray-shooting
- Convex subdivisions with low stabbing numbers
- Algorithms and Computation
- Title not available (Why is that?)
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- Minimum weight disk triangulations and fillings
- The drawability problem for minimum weight triangulations
- Finding a maximum weight triangle in n 3-Δ time, with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation for minimum triangulation of convex polyhedra
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)
