Pages that link to "Item:Q1293672"
From MaRDI portal
The following pages link to Approximating minimum-weight triangulations in three dimensions (Q1293672):
Displaying 21 items.
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- Convex subdivisions with low stabbing numbers (Q1046805) (← links)
- Cost-driven octree construction schemes: An experimental study (Q1775782) (← links)
- LMT-skeleton heuristics for several new classes of optimal triangulations (Q1841243) (← links)
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation (Q1862115) (← links)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees (Q2387200) (← links)
- Cost prediction for ray shooting in octrees (Q2495947) (← links)
- Octrees with near optimal cost for ray-shooting (Q2495948) (← links)
- Approximation for minimum triangulation of convex polyhedra (Q2768283) (← links)
- Minimum Average Distance Triangulations (Q2912886) (← links)
- Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387) (← links)
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound (Q2958326) (← links)
- (Q4252378) (← links)
- (Q4474087) (← links)
- (Q4500844) (← links)
- (Q4875212) (← links)
- Minimum weight disk triangulations and fillings (Q5857742) (← links)
- A quasi-polynomial time approximation scheme for minimum weight triangulation (Q5891924) (← links)
- Algorithms and Computation (Q5897930) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)
- Polygon decomposition for efficient construction of Minkowski sums (Q5959553) (← links)