Pages that link to "Item:Q1201743"
From MaRDI portal
The following pages link to Constructing strongly convex hulls using exact or rounded arithmetic (Q1201743):
Displayed 10 items.
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- Approximating largest convex hulls for imprecise points (Q1002103) (← links)
- Three-dimensional unstructured mesh generation. III: Volume meshes (Q1371881) (← links)
- Structural tolerance and Delaunay triangulation (Q1606996) (← links)
- Robust algorithms for constructing strongly convex hulls in parallel. (Q1853528) (← links)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
- Constructing strongly convex approximate hulls with inaccurate primitives (Q2366235) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS (Q4682156) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)