Variational normal meshes

doi:10.1145/1027411.1027418

Return

Variational normal meshes

2004-10-01

Peter Schröder

DOI：10.1145/1027411.1027418

Original

Save

View PDF

Abstract

En 中文

Hierarchical representations of surfaces have many advantages for digital geometry processing applications. Normal meshes are particularly attractive since their level-to-level displacements are in the local normal direction only. Consequently, they only require scalar coefficients to specify. In this article, we propose a novel method to approximate a given mesh with a normal mesh. Instead of building an associated parameterization on the fly, we assume a globally smooth parameterization at the beginning and cast the problem as one of perturbing this parameterization. Controlling the magnitude of this perturbation gives us explicit control over the range between fully constrained ( only scalar coefficients) and unconstrained (3-vector coefficients) approximations. With the unconstrained problem giving the lowest approximation error, we can thus characterize the error cost of normal meshes as a function of the number of nonnormal offsets - we find a significant gain for little ( error) cost. Because the normal mesh construction creates a geometry driven approximation, we can replace the difficult geometric distance minimization problem with a much simpler least squares problem. This variational approach reduces magnitude and structure (aliasing) of the error further. Our method separates the parameterization construction into an initial setup followed only by subsequent perturbations, giving us an algorithm which is far simpler to implement, more robust, and significantly faster.

Keywords:

algorithms

hierarchy

normal meshes

resampling

(semi-)regular meshes

subdivision

surface approximation

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.