We present an all-quad meshing algorithm for general domains. We start with a strongly balanced quadtree. In contrast to snapping the quadtree corners onto the geometric domain boundaries, we move them away from the geometry. Then we intersect the moved grid with the geometry. The resulting polygons are converted into quads with midpoint subdivision. Moving away avoids creating any flat angles,...

This paper presents the requirements for a surface mesh to be valid. Aside from validity, it also discusses conditions for geometric similarity, which quantitatively describes how the surface mesh “matches” the model geometry. The surface mesh generation method presented here uses the parameter space of a model face to generate a coarse triangulation. In order to avoid the mapping problem, the ...

We consider applications of clustering techniques, Mean Shift and Self-Organizing Maps, to surface reconstruction (meshing) from scattered point data and review a novel kernel-based clustering method.

In this paper we present an optimized view-dependent meshing framework for adaptive and continuous level-of-detail (LOD) rendering in real-time. Multiresolution triangle mesh representations are an important tool for adapting triangle mesh complexity in real-time rendering environments. Ideally for interactive visualization, a triangle mesh is simplified to the maximal tolerated perceptual erro...

We introduce a new technique to create mesh of convex polyhedra representing the interior volume triangulated input surface. Our approach is particularly tolerant defects in input, which allowed self-intersect, be non-manifold, disconnected, and contain surface holes gaps. guarantee that exactly represented as union polygonal facets output mesh. Thanks our algorithm, traditionally difficult sol...