Optimal decomposition of polygonal models into triangle strips

DOI10.1145/513400.513431zbMath1414.68119OpenAlexW2060242115MaRDI QIDQ4557562

Joseph S. B. Mitchell, Xinyu Xiang, Regina Estkowski

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513400.513431

zbMATH Keywords

integer programmingbranch-and-boundNP-completenessrenderingtriangle stripstristrips

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs ⋮ Sequential Triangle Strip Generator Based on Hopfield Networks

This page was built for publication: Optimal decomposition of polygonal models into triangle strips