Meshing from Geodesic Distances

Type: 
PR/DA
Persons: 
1-2
Workgroup: 

Delaunay_circumcircles.png by Nü es CC BY-SA 3.0, via Wikimedia Commons

Description

I'm researching surface reconstruction from point clouds using machine learning. The approach using geodesic distances gives interesting results but has some issues. The issues are mostly due to triangulation which need to be either improved or avoided.

Tasks

Improve triangulation of patches or find ways to avoid the triangulation. Evaluate the quality of the resulting triangulations.

  1. Some of these:
    1. Triangulate patches of point clouds so that overlapping patches are consistent. Maybe proof that it always works.
    2. Triangulate in high-dimensional space.
    3. Deterministic mapping of high-dimensional points onto 2D.
    4. Train a neural network that converts geodesic distances and points to triangles.
    5. Improve sparse distance matrices.
  2. Metrics to evaluate the triangulations:
    1. Minimum angle
    2. Delaunay condition
    3. Area variance

Details for these very specific tasks will be given in the kick-off meeting.

Requirements

  • Knowledge of English language (source code comments and final report should be in English)
  • Knowledge of geometry for computer graphics (e.g. surface definition with vertices and faces)
  • Basic knowledge of modeling and geometry processing
  • Bonus:
    • Basic knowledge of Python
    • Experience with C++

Environment

The source code is currently pure Python for both Windows and Linux. C++ might be necessary for performance optimization.

Contact

For more information please contact Philipp Erler (perler@cg.tuwien.ac.at).