Normal meshes

Guskov, Igor; Vidimče, Kiril; Sweldens, Wim; Schröder, Peter

doi:10.1145/344779.344831

Cited by 308 publications

(218 citation statements)

References 25 publications

Supporting

Mentioning

217

Contrasting

Order By: Relevance

“…This coder includes the normal remesher [4], and an original model-based bit allocation that optimizes the quantization of the wavelet coefficients. By assuming that the quantization of the coarser levels does not modify significantly the computation of the local coordinate systems, we argue that the weighted sum of the MSE of quantization of each wavelet component set is a suitable distortion criterion to evaluate the reconstruction error between the irregular input mesh and the reconstructed normal one during the bit allocation.…”

Section: Discussionmentioning

confidence: 99%

“…These multiresolution meshes have the property that the details almost always lie in a known normal direction (see Fig. 2) [4]. This involves that the tangential components tends to be equal to zero.…”

Section: Background and Notationsmentioning

confidence: 99%

“…The geometry compression considers the geometry to be the most important component to represent a mesh. Therefore geometry coders generally tend to reduce the topology information to the minimum, and one relevant solution is to remesh the irregular input mesh with a semi-regular remesher [3,4].…”

Section: Introductionmentioning

confidence: 99%

“…Among the existing schemes of semi-regular remeshing [3][4][5][6], normal meshes [4] are very attractive because most of vertices lie in a known normal direction, and can be represented by a single scalar (instead of a three-dimensional vector like in [3] for instance). This is currently the most compact multiscale representation of semi-regular meshes.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An efficient bit allocation for compressing normal meshes with an error-driven quantization

Payan

Antonini

2005

Computer Aided Geometric Design

View full text Add to dashboard Cite

We propose a new wavelet compression algorithm based on the rate-distortion optimization for densely sampled triangular meshes. This algorithm includes the normal remesher, a wavelet transform, and an original bit allocation optimizing the quantization of the wavelet coefficients. The allocation process minimizes the reconstruction error for a given bit budget. As distortion measure, we use the mean square error of the normal mesh quantization, expressed according to the quantization error of each subband. We show that this metric is a suitable criterion to evaluate the reconstruction error, i.e. the geometric distance between the input mesh and the quantized normal one. Moreover, to design a useful bit allocation, we propose a model-based approach, depending on the wavelet coefficient distributions. The proposed algorithm achieves results better than state-of-the-art methods, up to +2.5 dB compared to the original zerotree coder for normal meshes.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Background and Notationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An efficient bit allocation for compressing normal meshes with an error-driven quantization

Payan

Antonini

2005

Computer Aided Geometric Design

View full text Add to dashboard Cite

show abstract

“…Unfortunately, no single mathematical representation is known that will provide exact analytic results to all surface operations of interest. Rather than introduce more and more specialized mathematics, a recent trend has been to support many operations in a single, unified representation using approximation theory and hierarchical algorithms [6,20,14,5,24].…”

Section: Introductionmentioning

confidence: 99%

Progressive Precision Surface Design

Duchaineau

Joy

2004

Geometric Modeling for Scientific Visualization

View full text Add to dashboard Cite

Summary. We introduce a novel wavelet decomposition algorithm that makes a number of powerful new surface design operations practical. Wavelets, and hierarchical representations generally, have held promise to facilitate a variety of design tasks in a unified way by approximating results very precisely, thus avoiding a proliferation of undergirding mathematical representations. However, traditional wavelet decomposition is defined from fine to coarse resolution, thus limiting its efficiency for highly precise surface manipulation when attempting to create new non-local editing methods.Our key contribution is the progressive wavelet decomposition algorithm, a generalpurpose coarse-to-fine method for hierarchical fitting, based in this paper on an underlying multiresolution representation called dyadic splines. The algorithm requests input via a generic interval query mechanism, allowing a wide variety of non-local operations to be quickly implemented. The algorithm performs work proportionate to the tiny compressed output size, rather than to some arbitrarily high resolution that would otherwise be required, thus increasing performance by several orders of magnitude.We describe several design operations that are made tractable because of the progressive decomposition. Free-form pasting is a generalization of the traditional control-mesh edit, but for which the shape of the change is completely general and where the shape can be placed using a free-form deformation within the surface domain. Smoothing and roughening operations are enhanced so that an arbitrary loop in the domain specifies the area of effect. Finally, the sculpting effect of moving a tool shape along a path is simulated.

show abstract

Mesh Deformation

Liu¹,

Bao²

2009

Wiley Encyclopedia of Computer Science and Engineering

View full text Add to dashboard Cite

Generating and manipulating surfaces is one of the central issues in various applications of computer graphics and digital entertainment. As one of these operations for surface generating, deformations allow the user to treat an object as if it were constructed from a special type of topological putty or clay, which may be bent, twisted, tapered, compressed, expanded, and otherwise transformed repeatedly into a final shape. They are highly intuitive and easily visualized operations that simulate some important manufacturing processes for fabricating objects, such as the bending of bar stock and sheet metal. Recent progress of deformation techniques focus on mesh deformation. Although for different computing tasks, different surface representations are employed to reveal different geometric, physical, plausible, or perceptual properties of the shape to be handled. The polygonal meshes become fundamental digital media through the whole geometric processing pipeline because of its convenience of acquisition and rendering. However, a pure mesh representation with its vertex positions defined in global coordinate system is challenging for deforming shapes while caring details. Hence researchers have developed several efficient ways to deform mesh surfaces.

show abstract

Normal meshes

Cited by 308 publications

References 25 publications

An efficient bit allocation for compressing normal meshes with an error-driven quantization

An efficient bit allocation for compressing normal meshes with an error-driven quantization

Progressive Precision Surface Design

Mesh Deformation

Contact Info

Product

Resources

About