Construction with physical version of quad-edge data structures
- 1 August 2016
- journal article
- Published by Elsevier in Computers & Graphics
- Vol. 58, 172-183
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (NSF-CMMI-1548243, NSF-ECCS-1547075, NSF-EFRI-1240483)
This publication has 27 references indexed in Scilit:
- A new heuristic recursive algorithm for the strip rectangular packing problemComputers & Operations Research, 2006
- Making papercraft toys from meshes using strip-based approximate unfoldingACM Transactions on Graphics, 2004
- Ununfoldable polyhedra with convex facesComputational Geometry, 2003
- Discrete Differential-Geometry Operators for Triangulated 2-Manifolds2003
- Packing rectangles in a stripActa Informatica, 2002
- A NEW CORNER CUTTING SCHEME WITH TENSION AND HANDLE-FACE RECONSTRUCTIONInternational Journal of Shape Modeling, 2001
- GUARANTEEING THE 2-MANIFOLD PROPERTY FOR MESHES WITH DOUBLY LINKED FACE LISTInternational Journal of Shape Modeling, 1999
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Behaviour of recursive division surfaces near extraordinary pointsComputer-Aided Design, 1978
- Ueber das Problem der NachbargebieteMathematische Annalen, 1891