An Algorithm Recreating 3D Triangle Mesh Faces from Its Edges

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

An Algorithm Recreating 3D Triangle Mesh Faces from Its Edges

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

An Algorithm Recreating 3D Triangle Mesh Faces from Its Edges

Popis výsledku anglicky

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.

Druh

O - Ostatní výsledky

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

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