Pages that link to "Item:Q1384196"
From MaRDI portal
The following pages link to Erased arrangements of linear and convex decompositions of polyhedra (Q1384196):
Displaying 7 items.
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension (Q1003705) (← links)
- 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)
- Convex polygons made from few lines and convex decompositions of polyhedra (Q5056156) (← links)
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888) (← links)
- Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time (Q6569247) (← links)