Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1


Robust Geometry Processing
EC | FP7 | SP2 | ERC
Contract (GA) number
Start Date
End Date
Open Access mandate
Special Clause 39
More information
Detailed project information (CORDIS)


  • Planar Shape Detection and Regularization in Tandem

    Oesau , Sven; Lafarge , Florent; Alliez , Pierre (2015)
    Projects: EC | IRON (257474)
    International audience; We present a method for planar shape detection and regularization from raw point sets. The geometric modeling and processing of man-made environments from measurement data often relies upon robust detection of planar primitive shapes. In addition, the detection and reinforcement of regularities between planar parts is a means to increase resilience to missing or defect-laden data as well as to reduce the complexity of models and algorithms down the modeling pipeline. T...

    Noise-Adaptive Shape Reconstruction from Raw Point Sets

    Giraudot, Simon; Cohen-Steiner, David; Alliez, Pierre (2013)
    Projects: EC | IRON (257474)
    International audience; We propose a noise-adaptive shape reconstruction method specialized to smooth, closed shapes. Our algorithm takes as input a defect-laden point set with variable noise and outliers, and comprises three main steps. First, we compute a novel noise-adaptive distance function to the inferred shape, which relies on the assumption that the inferred shape is a smooth submanifold of known dimension. Second, we estimate the sign and confidence of the function at a set of seed p...

    Detecting parametric objects in large scenes by Monte Carlo sampling

    VerdiƩ, Yannick; Lafarge, Florent (2012)
    Projects: EC | IRON (257474)
    International audience; Point processes constitute a natural extension of Markov Random Fields (MRF), designed to handle parametric objects. They have shown efficiency and competitiveness for tackling object extraction problems in vision. Simulating these stochastic models is however a difficult task. The performances of the existing samplers are limited in terms of computation time and convergence stability, especially on large scenes. We propose a new sampling procedure based on a Monte Car...

    BendFields: Regularized Curvature Fields from Rough Concept Sketches

    Iarussi , Emmanuel; Bommes , David; Bousseau , Adrien (2015)
    Projects: EC | IRON (257474)
    International audience; Designers frequently draw curvature lines to convey bending of smooth surfaces in concept sketches. We present a method to extrapolate curvature lines in a rough concept sketch, recovering the intended 3D curvature field and surface normal at each pixel of the sketch. This 3D information allows us to enrich the sketch with 3D-looking shading and texturing. We first introduce the concept of regularized curvature lines that model the lines designers draw over curved surf...

    Robust Shape Reconstruction and Optimal Transportation

    Alliez , Pierre; Giraudot , Simon; Cohen-Steiner , David (2014)
    Projects: EC | IRON (257474)
    International audience; We describe a framework for robust shape reconstruction from raw point sets, based on optimal transportation between measures, where the input point sets are seen as distribution of masses. In addition to robustness to defect-laden point sets, hampered with noise and outliers, our approach can reconstruct smooth closed shapes as well as piecewise smooth shapes with boundaries.

    Robust Quad Mesh Extraction

    Hans-Christian Ebke, David Bommes, Marcel Campen; Leif Kobbelt; Hans-Christian Ebke; David Bommes; Marcel Campen; Leif Kobbelt (2013)
    Projects: EC | IRON (257474)

    Anisotropic Rectangular Metric for Polygonal Surface Remeshing

    Pellenard, Bertrand; Morvan, Jean-Marie; Alliez, Pierre (2012)
    Projects: EC | IRON (257474)
    International audience; We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, de ned at each triangle facet of the input mesh, is derived from both a user-speci ed normal-based tolerance error and the requirement to favor rectangle-shaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioni...

    Integer-Grid Maps for Reliable Quad Meshing

    Bommes , David; Campen , Marcel; Ebke , Hans-Christian; Alliez , Pierre; Kobbelt , Leif (2013)
    Projects: EC | IRON (257474)
    International audience; Quadrilateral remeshing approaches based on global parametrization enable many desirable mesh properties. Two of the most important ones are (1) high regularity due to explicit control over irregular vertices and (2) smooth distribution of distortion achieved by convex variational formulations. Apart from these strengths, state-of-the-art techniques suffer from limited reliability on real-world input data, i.e. the determined map might have degeneracies like (local) no...

    Surface Reconstruction through Point Set Structuring

    Lafarge, Florent; Alliez, Pierre (2013)
    Projects: EC | IRON (257474)
    We present a method for reconstructing surfaces from point sets. The main novelty lies into a structure-preserving approach where the input point set is first consolidated by structuring and resampling the planar components, before reconstructing the surface from both the consolidated components and the unstructured points. The final surface is obtained through solving a graph-cut problem formulated on the 3D Delaunay triangulation of the structured point set where the tetrahedra are labeled ...
  • No project research data found
  • Scientific Results

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.


    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Publications in Repositories

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark

App Box