Mesh Processing

Project Name Overview Contact
MssEnv MSSEnv project aims to create a complete mesh sequence segmentation environment: a framework to create, test and compare mesh sequence segmentation algorithms. It will also provide building blocks to create these algorithms and a graphical environment. Romain Arcila
MEPP MEsh Processing Platform. Based on CGAL, MEPP aims at building a framework around novel mesh processing techniques. Oriented   towards modularity, it targets developers as well as GUI users. It federates the developments on mesh processing of the LIRIS research team M2DISCO. Florent Dupont
MSDM A perceptual distance measure between 3D meshes. This measure is asymetric and provides a score which reflects the perceptual distance between two 3D objects; Its value tends toward 1 (theoretical limit) when the measured objects are visually very different and is equal to 0 for identical ones. Guillaume Lavoué
3D mesh roughness calculation This measure provides the roughness value for each vertex of a given 3D mesh, as a local measure of geometric noise. This estimator depends on a scale parameter epsilon which determines the size (i.e. the frequency) of the details that have to be considered as noise and that can lead to a masking effect. Guillaume Lavoué
Mesh clustering based on Markov Random Field This algorithm provides a clustering / labeling of a 3D mesh given any field of scalar values associated with its vertices. It is based on Markov Random Fields and allows to integrate both the attributes and the geometry in the clustering, while providing an optimal global solution. Guillaume Lavoué

Digital Geometry

Project Name Overview Contact
DGtal (Digital Tools and Algorithms Library) The collaborative project DGtal aims at developing generic, efficient and reliable digital geometry data structures, algorithms and tools. It takes the form of an open-source C++ library DGtal and a set of tools and binaries DGtalTools. David Coeurjolly & Tristan Roussillon
Representation of digital contours We provide some tools based on the dynamic recognition of digital straight segments (DSS): cover of maximal DSS, convex or concave
parts decomposition, faithful polygon (FP, i.e. reversible polygon that respects the convex or concave parts of the digital contour) and minimum length  polygon (MLP) inscribed in the dilatation of the digital contour by a unit square. An implicit contour tracking is included in order to generate and process digital contours coming from the  digitization of ellipses, regular polygons, rose curves, parabolas and waves.
Tristan Roussillon
Digital Surface Decomposition We provide a tool to compute a decomposition of the surface of a digital object into naive digital plane segments (DPS for short). This software also provides a simple   graphical interface for 3D digital objects visualization, based on the QGLViewer Library. Isabelle Sivignon
3-SAT to Digital Surface Decomposition We provide a polynomial reduction of any instance of the well-known 3-SAT problem to an instance of the digital surface decomposition problem. Isabelle Sivignon
MAEVA Toolkit: Medial Axis Extraction and Volumetric Analysis C/C++ implementations of various volumetric analysis tools such that the Distance Transformation, the Reverse Euclidean Distance Transformation and the Discrete
Medial Axis Extraction. License: CeCILL-C
David Coeurjolly
Reconstruction 2D Converts a simply connected discrete irregular curves into a polygon such that its digitization is exactly the input discrete curve. David Coeurjolly
SimpleVol A set of libraries and utilities to construct and manipulate 3D discrete volumes (formerly libvol+liblongvol+volgen+voltools). David Coeurjolly

Useful External Softwares

Project Name Overview
binvox Convert meshes to discrete binary 3D objects
qvox Volumetric data visualizer and editor
cgal Computational Geometry Algorithms Library