Optimal decomposition of polygonal models into triangle strips

DOI10.1145/513400.513431MaRDI QIDQ4557562zbMATH OpenOpenAlexWikidataFDO

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

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 programmingNP-completenessbranch-and-boundrenderingtriangle stripstristrips

Mathematics Subject Classification ID

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

Recommendations

• Triangle strip compression
• Sequential Triangle Strip Generator Based on Hopfield Networks
• Computational Science and Its Applications – ICCSA 2004
• Strategies for polyhedral surface decomposition: an experimental study.
• Quadrilateral meshes stripification

Cited in

(6)

• Sequential Triangle Strip Generator Based on Hopfield Networks
• Triangle strip compression
• On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs
• Quadrilateral meshes stripification
• Computational Science and Its Applications – ICCSA 2004
• Optimizing a Strip Separating Two Polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557562)