A butterfly subdivision scheme for surface interpolation with tension control
ACM Transactions on Graphics (TOG)
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A data reduction scheme for triangulated surfaces
Computer Aided Geometric Design
Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Displaced subdivision surfaces
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Curves and surfaces for CAGD: a practical guide
Curves and surfaces for CAGD: a practical guide
Subdivision Surface Fitting to a Range of Points
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Finite Elements in Analysis and Design
Progressive meshes transmission over a wired-to-wireless network
Wireless Networks
Hi-index | 0.00 |
In Virtual Reality, 3D graphics is generally illustrated by meshes of 3D geometric model. This paper provides a novel algorithm to construct progressive meshes based on the reverse subdivision. The dense mesh is simplified into coarse one by decimating the redundant information level by level. Loop subdivision scheme, which is an approximating scheme, is adopted as interpolatory one in the simplification process. The implementation of our algorithm consists of three key steps, splitting, predicting and updating. The progressive mesh can be reconstructed lossless. The experiments have shown that the new algorithm is efficient and more faster than previous related techniques.