A butterfly subdivision scheme for surface interpolation with tension control
ACM Transactions on Graphics (TOG)
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Interpolating Subdivision for meshes with arbitrary topology
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Interactive multiresolution mesh editing
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
ROAMing terrain: real-time optimally adapting meshes
VIS '97 Proceedings of the 8th conference on Visualization '97
Variable resolution triangulations
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
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
A Sub-Atomic Subdivision Approach
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Selective Refinement Queries for Volume Visualization of Unstructured Tetrahedral Meshes
IEEE Transactions on Visualization and Computer Graphics
Computer Aided Geometric Design
An overview of procedures for refining triangulations
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Hi-index | 0.00 |
We introduce RGB triangulations, an extension of red-green triangulations that can support selective refinement over subdivision meshes generated through quadrisection of triangles. Our purpose is to define a mechanism based on local operators that act on subdivision meshes while supporting operations similar to those available in Continuous Level Of Detail models. Our mechanism permits to take an adaptive mesh at intermediate level of subdivision and process it through both refinement and coarsening operations, by remaining consistent with an underlying Loop subdivision scheme. Our method does not require any hierarchical data structure, being based just on color codes and level numbers assigned to elements of a mesh, which can be encoded in a standard topological data structure with a small overhead.