Liens d'informations

Géométrie Algorithmique exemples et applications

Exemple de mise en oeuvre de géométrie Algoritmique

Clics : 1021
Reconstruction de surface, méthode de poisson CGAL

This CGAL component implements a surface reconstruction method which takes as input point sets with oriented normals and computes an implicit function. We assume that the input points contain no outliers and little noise. The output surface mesh is generated by extracting an isosurface of this function with the CGAL Surface Mesh Generator [4] or potentially with any other surface contouring algorithm.
Clics : 1136
Reconstruction de surface, méthode de poisson CGAL - Référence

Pierre Alliez, Laurent Saboret, Gaël Guennebaud

This package implements a surface reconstruction method: Poisson Surface Reconstruction. It takes as input a set of points with oriented normals and computes an implicit function. The CGAL surface mesh generator can then be used to extract an iso-surface from this function.
Clics : 1386
Reconstruction de surface, changement local d'échelle - Manuel

Thijs van Lankveld

This method allows to reconstruct a surface that interpolates a set of 3D points using either and alpha shape or the advancing front surface reconstruction method. The output interpolates the point set (as opposed to approximating the point set). How the surface connects the points depends on a scale variable, which can be estimated semi-automatically.
Clics : 887
Reconstruction de surface, changement local d'échelle - Référence

Thijs van Lankveld

This method allows to reconstruct a surface that interpolates a set of 3D points using either and alpha shape or the advancing front surface reconstruction method. The output interpolates the point set (as opposed to approximating the point set). How the surface connects the points depends on a scale variable, which can be estimated semi-automatically.
Clics : 2057
Reconstruction de surface, ajout de Maille - Manuel

Tran Kai Frank Da, David Cohen-Steiner

This package provides a greedy algorithm for surface reconstruction from an unorganized point set. Starting from a seed facet, a piecewise linear surface is grown by adding Delaunay triangles one by one. The most plausible triangles are added first, in a way that avoids the appearance of topological singularities.
Clics : 901
Reconstruction de surface, ajout de maille - référence

Tran Kai Frank Da, David Cohen-Steiner

This package provides a greedy algorithm for surface reconstruction from an unorganized point set. Starting from a seed facet, a piecewise linear surface is grown by adding Delaunay triangles one by one. The most plausible triangles are added first, in a way that avoids the appearance of topological singularities.
Clics : 896
Reconstruction de surface, ajout de points -Référence

Authors

Pierre Alliez, David Cohen-Steiner, Fernando de Goes, Clément Jamin and Ivo Vigan

This package implements a method to reconstruct and simplify 2D point sets [1]. The input is a set of 2D points with mass attributes, possibly hampered by noise and outliers. The output is a set of line segments and isolated points which approximate the input points, as illustrated in Figure 58.1. The mass attribute relates to the importance given to each point for approximation.
Clics : 1319
Reconstruction de surface, ajout de points - Manuel

Authors

Pierre Alliez, David Cohen-Steiner, Fernando de Goes, Clément Jamin and Ivo Vigan

This package implements a method to reconstruct and simplify 2D point sets [1]. The input is a set of 2D points with mass attributes, possibly hampered by noise and outliers. The output is a set of line segments and isolated points which approximate the input points, as illustrated in Figure 58.1. The mass attribute relates to the importance given to each point for approximation.

Nous utilisons des cookies. Ils sont activés sur ce sites/, êtes vous d'accord ? Des infos sur les Cookies => ICI informations privées.
J'accepte les cookies de ce site. J'accepte