CoboCards App FAQ & Wünsche Feedback
Sprache: Deutsch Sprache
Kostenlos registrieren  Login

Zu dieser Karteikarte gibt es einen kompletten Satz an Karteikarten. Kostenlos!

Alle Oberthemen / Informatik / Computergrafik / Schwerpunktkolloquium: Basic Techniques, Geometry Processing, Global Illumination
36
Explain Volumetric Mesh Repair!
Input: "Triangle Soup" : Collection of surface parts which may contain gaps, intersections or other problems

Output: Watertight two-manifold mesh

Parameters:
: approximation tolerance
: maximum hole / gap size

Requirements:

"every point on the original mesh has a distance of at most to a point on the reconstructed mesh"

also: but only if the closest point on is not a boundary point


"every point on the reconstructed mesh has a distance of at most to a point on the original mesh"

Algorithm
Insert all mesh faces into a voxel grid.
Grow -blobs from all boundary edges.
Flood fill the exterior.
Erode the -blobs from outside.
Reconstruct the mesh using Marching Cubes.
Neuer Kommentar
Karteninfo:
Autor: janisborn
Oberthema: Informatik
Thema: Computergrafik
Schule / Uni: RWTH Aachen
Ort: Aachen
Veröffentlicht: 18.05.2022

Abbrechen
E-Mail

Passwort

Login    

Passwort vergessen?
Deutsch  English