Bounded Degree Polyhedronization of Point Sets in R3
The problem of finding a polyhedron in R3 with no four points coplanar, having the set of points as vertices, being simple in structure, with each vertex connected to O(1) edges, and featuring both a tetrahedralization and chain dual. This task has historical importance with Euler's formula setting
0 views • 24 slides