, and refines progressively when idle to a high final image quality. We have demonstrated the system on scanned models containing hundreds of millions of samples.

In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high

In this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. The process is based on a novel set of strictly local operations which preserve quad structure. We show how good

and base complexes for surface parameterization, spline fitting, or subdivision surfaces and can be used to generate quad meshes with a high-level patch structure that are advantageous in many application scenarios. Our approach is based on the careful construction of the layout graph’s combinatorial dual

of singularities in the quadrangulation. Both steps of the algorithm (cross field and parametrization) can be formulated as a mixed-integer problem which we solve very efficiently by an adaptive greedy solver. We show several complex examples where high quality quad meshes are generated in a fully automatic manner.

rates with high image quality.

I present a methodology to create smooth meshes using spline patches generated automatically from the geometry of the mesh. The intent is to create a smooth surface across the entire mesh, which creates smooth silhouette edges and is very useful for high quality ray tracing. An additional goal

is fully automatic and generates high quality quadrilateral meshes.

, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this State of the Art Report, we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement

Many algorithms exist for producing quality meshes when the input point cloud is known a priori. However, modern finite element simulations and graphics applications need to change the input set dur-ing the simulation dynamically. We show how to dynamically update the mesh under changes