Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
Computing
Real-time, continuous level of detail rendering of height fields
SIGGRAPH '96 Proceedings of the 23rd 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
Interpolation of triangle hierarchies
Proceedings of the conference on Visualization '98
Efficient Triangular Surface Approximations Using Wavelets and Quadtree Data Structures
IEEE Transactions on Visualization and Computer Graphics
Tools for Triangulations and Tetrahedrizations
Scientific Visualization, Overviews, Methodologies, and Techniques
SURFACES FOR COMPUTER-AIDED DESIGN OF SPACE FORMS
SURFACES FOR COMPUTER-AIDED DESIGN OF SPACE FORMS
Stereoscopic View-Dependent Visualization of Terrain Height Fields
IEEE Transactions on Visualization and Computer Graphics
VG '03 Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on Volume graphics
Topology Preserving Top-Down Compression of 2D Vector Fields Using Bintree and Triangular Quadtrees
IEEE Transactions on Visualization and Computer Graphics
Tetrahedral adaptive grid for parallel hierarchical tetrahedrization
EGMM'04 Proceedings of the Seventh Eurographics conference on Multimedia
Visualization of labeled segments cross-contour surfaces
VG'01 Proceedings of the 2001 Eurographics conference on Volume Graphics
Polygon mesh repairing: An application perspective
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
We present a new approach to solving the cracking problem. The cracking problem arises in many contexts in scientific visualization and computer graphics modeling where there is need for an approximation based upon domain decomposition that is fine in certain regions and coarse in others. This includes surface rendering, approximation of images and multiresolution terrain visualization. In general, algorithms based upon adaptive refinement strategies must deal with this problem. The new approach presented here is simple and general. It is based upon the use of a triangular Coons patch. Both the basic idea of using a triangular Coons patch in this context and the particular Coons patch that is used constitute the novel contributions of this paper.