An Algorithm Recreating 3D Triangle Mesh Faces from Its Edges

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F18%3A43952023" target="_blank" >RIV/49777513:23520/18:43952023 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

An Algorithm Recreating 3D Triangle Mesh Faces from Its Edges

Original language description

3D triangle meshes are usually represented by a set of points with geometrical coordinates and a set of faces represented by triplets of these points. Multiple algorithms reconstructing a set of faces from a set of points and a set of edges were proposed in the literature, however, none of these can effectively reconstruct the set of faces using only the set of edges. In this paper, such an algorithm is presented, which recreates a set of non-oriented triangle faces from only the set of its edges. The input is expected to be a closed 3D edge-manifold triangle mesh of any genus. The algorithm is simple, purely topological and runs in O(n). We present several practical examples demonstrating that it is capable of reconstructing faces even from fairly large input data, as well as input data that is prone to errors in reconstruction due to a high occurrence of possible inner faces.

Czech name

—

Czech description

—

Type

O - Miscellaneous

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů