Shapes package

Package managers:

Jacques-Olivier Lachaud, David Coeurjolly

Since

0.6

LICENSE: LGPL

Package Overview

This package contains shape related concepts, models and algorithms. It provides a generic framework and tools to construct multigrid shapes in DGtal. More precisely, this package contains analytical objects (parametric, implicit, from point sets,...) with digitization schemes to make concrete such objects in a given grid step grid.

Since 0.9.4, there is a module that provides classes and services to represent combinatorial surfaces, based on an half-edge data structure. Since 1.1, there is a module that provides classes and services to represent generic embedded polygonal surfaces, either manifold or non-manifold.

Modules for digital shapes generation

• Shapes, Shapers and Digitizers (Jacques-Olivier Lachaud, David Coeurjolly, Adrien Krähenbühl)
• Mesh Voxelization (David Coeurjolly, Monir Hadji)

Modules for mesh representation

There are several ways to represent surface meshes, depending on their genericity or property:

• Manipulating Simple Mesh (Bertrand Kerautret)
  • represents soaps of triangles with traversal operations but without any link between vertices (class Mesh).
• Half-edge data structure, triangulated surfaces and polygonal surfaces (Jacques-Olivier Lachaud)
  • represents 2-manifold triangulated or polygonal meshes, possibly with boundaries, and provides traversal and neighborhood operations, with an underlying fast index representation (classes TriangulatedSurface, PolygonalSurface, HalfEdgeDataStructure).
• Surface mesh data structure for representing manifold or non-manifold polygonal surfaces in R3 (Jacques-Olivier Lachaud)
  • represents arbitrary sets of faces with possible connexions between faces, edges and vertices, provides traversal and neighborhood operations, with an underlying fast index representation, and may represent non manifold meshes (class SurfaceMesh).
• Digital surfaces (Jacques-Olivier Lachaud)
  • represents digital surfaces, i.e. boundaries of sets of voxels or interfaces between such sets, in arbitrary dimension, with a common framework (classes DigitalSurface and IndexedDigitalSurface).
• Voxelization from an oriented point cloud (David Coeurjolly)
  • uses winding number from libIGL to construct a voxelized binary image from an set of oriented points (points with normal vectors).

Package Concepts Overview

• Shapes Concepts

Related documentation pages