English

Reconstructing a Polyhedron between Polygons in Parallel Slices

Computational Geometry 2020-04-14 v1

Abstract

Given two nn-vertex polygons, P=(p1,,pn)P=(p_1, \ldots, p_n) lying in the xyxy-plane at z=0z=0, and P=(p1,,pn)P'=(p'_1, \ldots, p'_n) lying in the xyxy-plane at z=1z=1, a banded surface is a triangulated surface homeomorphic to an annulus connecting PP and PP' such that the triangulation's edge set contains vertex disjoint paths πi\pi_i connecting pip_i to pip'_i for all i=1,,ni =1, \ldots, n. The surface then consists of bands, where the iith band goes between πi\pi_i and πi+1\pi_{i+1}. We give a polynomial-time algorithm to find a banded surface without Steiner points if one exists. We explore connections between banded surfaces and linear morphs, where time in the morph corresponds to the zz direction. In particular, we show that if PP and PP' are convex and the linear morph from PP to PP' (which moves the iith vertex on a straight line from pip_i to pip'_i) remains planar at all times, then there is a banded surface without Steiner points.

Keywords

Cite

@article{arxiv.2004.05946,
  title  = {Reconstructing a Polyhedron between Polygons in Parallel Slices},
  author = {Therese Biedl and Pavle Bulatovic and Veronika Irvine and Anna Lubiw and Owen Merkel and Anurag Murty Naredla},
  journal= {arXiv preprint arXiv:2004.05946},
  year   = {2020}
}

Comments

preliminary version appeared in the Canadian Conference on Computational Geometry (CCCG) 2019

R2 v1 2026-06-23T14:49:22.277Z