Dynamic Programming ProblemSurface Reconstruction
P= {p0, p1,…, pm}; Q={q0, q1,…, qn}
planar, parallel polygons in 3D
A tiling of P and Q is a set of triangles (tiles) of the form {pi, pi+1 , qj } or {qj , qj+1 ,pi }.
Cross edge: tile edge with vertex from each polygon
Tiling must satisfy 2 properties:
- every edge of each polygon is side of exactly one tile
- every cross edge is a side of 2 tiles