2,039 research outputs found
Discrete curvature approximations and segmentation of polyhedral surfaces
The segmentation of digitized data to divide a free form surface into patches is one of the key steps required to perform a reverse engineering process of an object. To this end, discrete curvature approximations are introduced as the basis of a segmentation process that lead to a decomposition of digitized data into areas that will help the construction of parametric surface patches. The approach proposed relies on the use of a polyhedral representation of the object built from the digitized data input. Then, it is shown how noise reduction, edge swapping techniques and adapted remeshing schemes can participate to different preparation phases to provide a geometry that highlights useful characteristics for the segmentation process. The segmentation process is performed with various approximations of discrete curvatures evaluated on the polyhedron produced during the preparation phases. The segmentation process proposed involves two phases: the identification of characteristic polygonal lines and the identification of polyhedral areas useful for a patch construction process. Discrete curvature criteria are adapted to each phase and the concept of invariant evaluation of curvatures is introduced to generate criteria that are constant over equivalent meshes. A description of the segmentation procedure is provided together with examples of results for free form object surfaces
Curvature estimation for meshes via algebraic quadric fitting
We introduce the novel method for estimation of mean and Gaussian curvature
and several related quantities for polygonal meshes. The algebraic quadric
fitting curvature (AQFC) is based on local approximation of the mesh vertices
and associated normals by a quadratic surface. The quadric is computed as an
implicit surface, so it minimizes algebraic distances and normal deviations
from the approximated point-normal neighbourhood of the processed vertex. Its
mean and Gaussian curvature estimate is then obtained as the respective
curvature of its orthogonal projection onto the fitted quadratic surface.
Experimental results for both sampled parametric surfaces and arbitrary meshes
are provided. The proposed method AQFC approaches the true curvatures of the
reference smooth surfaces with increasing density of sampling, regardless of
its regularity. It is resilient to irregular sampling of the mesh, compared to
the contemporary curvature estimators. In the case of arbitrary meshes,
obtained from scanning, AQFC provides robust curvature estimation.Comment: 14 page
Flexible G1 Interpolation of Quad Meshes
International audienceTransforming an arbitrary mesh into a smooth G1 surface has been the subject of intensive research works. To get a visual pleasing shape without any imperfection even in the presence of extraordinary mesh vertices is still a challenging problem in particular when interpolation of the mesh vertices is required. We present a new local method, which produces visually smooth shapes while solving the interpolation problem. It consists of combining low degree biquartic Bézier patches with minimum number of pieces per mesh face, assembled together with G1-continuity. All surface control points are given explicitly. The construction is local and free of zero-twists. We further show that within this economical class of surfaces it is however possible to derive a sufficient number of meaningful degrees of freedom so that standard optimization techniques result in high quality surfaces
Point-Normal Subdivision Curves and Surfaces
This paper proposes to generalize linear subdivision schemes to nonlinear
subdivision schemes for curve and surface modeling by refining vertex positions
together with refinement of unit control normals at the vertices. For each
round of subdivision, new control normals are obtained by projections of
linearly subdivided normals onto unit circle or sphere while new vertex
positions are obtained by updating linearly subdivided vertices along the
directions of the newly subdivided normals. Particularly, the new position of
each linearly subdivided vertex is computed by weighted averages of end points
of circular or helical arcs that interpolate the positions and normals at the
old vertices at one ends and the newly subdivided normal at the other ends.
The main features of the proposed subdivision schemes are three folds:
(1) The point-normal (PN) subdivision schemes can reproduce circles, circular
cylinders and spheres using control points and control normals;
(2) PN subdivision schemes generalized from convergent linear subdivision
schemes converge and can have the same smoothness orders as the linear schemes;
(3) PN subdivision schemes generalizing linear subdivision schemes that
generate subdivision surfaces with flat extraordinary points can generate
visually subdivision surfaces with non-flat extraordinary points.
Experimental examples have been given to show the effectiveness of the
proposed techniques for curve and surface modeling.Comment: 30 pages, 17 figures, 22.5M
- …