SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Fast rendering of subdivision surfaces
Proceedings of the eurographics workshop on Rendering techniques '96
Using generic programming for designing a data structure for polyhedral surfaces
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Directed edges—A scalable representation for triangle meshes
Journal of Graphics Tools
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Subdivision Methods for Geometric Design: A Constructive Approach
Subdivision Methods for Geometric Design: A Constructive Approach
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Mesh mutation in programmable graphics hardware
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
3D Compression Made Simple: Edgebreaker with Zip&Wrap on a Corner-Table
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
A realtime GPU subdivision kernel
ACM SIGGRAPH 2005 Papers
ACM: atlas of connectivity maps for semiregular models
Proceedings of Graphics Interface 2013
Special Section on Graphics Interface: Atlas of connectivity maps
Computers and Graphics
| Hi-index | 0.00 |
Automatically generated or laser-scanned surfaces typically exhibit large clusters with a uniform pattern. To take advantage of the regularity within clusters and still be able to edit without decompression, we developed a two-level data structure that uses an enumeration by orbits and an individually adjustable stencil to flexibly describe connectivity. The structure is concise for storing mesh connectivity; efficient for random access, interactive editing, and recursive refinement; and it is flexible by supporting a large assortment of connectity patterns and subdivision schemes.