Pages that link to "Item:Q1392846"
From MaRDI portal
The following pages link to On triangulating three-dimensional polygons (Q1392846):
Displaying 9 items.
- Constructing convex 3-polytopes from two triangulations of a polygon (Q598553) (← links)
- (Non)Existence of pleated folds: How paper folds between creases (Q659705) (← links)
- Partitioning a planar assembly into two connected parts is NP-complete (Q672026) (← links)
- Nonobtuse triangulation of polygons (Q1096930) (← links)
- On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- (Q3694178) (← links)
- Triangulating a polygon in parallel (Q4732108) (← links)
- GLUING TECHNIQUES IN TRIANGULAR GEOMETRY (Q5437020) (← links)