The following pages link to Triangulating point sets in space (Q1820437):
Displayed 10 items.
- Connecting colored point sets (Q868381) (← links)
- An optimal speed-up parallel algorithm for triangulating simplicial point sets in space (Q1100900) (← links)
- On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990) (← links)
- Illumination by floodlights (Q1388133) (← links)
- Hamiltonian tetrahedralizations with Steiner points (Q1694976) (← links)
- Splitting a configuration in a simplex (Q2366245) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
- The number of Reidemeister moves needed for unknotting (Q2701705) (← links)
- Geometric algorithms for the minimum cost assignment problem (Q4845077) (← links)
- (Q5009355) (← links)