Adaptive geometry compression based on 4-point interpolatory subdivision schemes

Authors:
Hui Zhang;Jun-Hai Yong;Jean-Claude Paul
Affiliations:
School of Software, Tsinghua University, Beijing, P.R. China;School of Software, Tsinghua University, Beijing, P.R. China;School of Software, Tsinghua University, Beijing, P.R. China
Venue:
IWICPAS'06 Proceedings of the 2006 Advances in Machine Vision, Image Processing, and Pattern Analysis international conference on Intelligent Computing in Pattern Analysis/Synthesis
Year:
2006

Citing 8
Cited 1

Interactive multiresolution mesh editing

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Progressive geometry compression

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Degree reduction of B-spline curves

Computer Aided Geometric Design
Approximate Boolean operations on free-form solids

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
An interpolating 4-point C 2 ternary stationary subdivision scheme

Computer Aided Geometric Design
CIM algorithm for approximating three-dimensional polygonal curves

Journal of Computer Science and Technology
Octree-based Animated Geometry Compression

DCC '04 Proceedings of the Conference on Data Compression

Adaptive geometry compression based on four-point interpolatory subdivision schemes with labels

International Journal of Computer Mathematics - Computer Vision and Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an adaptive geometry compression method based on 4-point interpolatory subdivision schemes. It can work on digital curves of arbitrary dimensions. With the geometry compression method, a digital curve is adaptively compressed into several segments with different compression levels. Each segment is a 4-point subdivision curve with a subdivision step. In the meantime, we provide high-speed 4-point interpolatory subdivision curve generation methods for efficiently decompressing the compressed data. In the decompression methods, we consider both the open curve case and the closed curve case. For an arbitrary positive integer k, formulae of the number of the resultant control points of an open or closed 4-point subdivision curve after k subdivision steps are provided. The time complexity of the new approaches are O(n), where n is the number of the points in the given digital curve. Examples are provided as well to illustrate the efficiency of the proposed approaches.