CoboCards App FAQ & Wishes Feedback
Language: English Language
Sign up for free  Login

This flashcard is just one of a free flashcard set. See all flashcards!

All main topics / 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.
New comment
Flashcard info:
Author: janisborn
Main topic: Informatik
Topic: Computergrafik
School / Univ.: RWTH Aachen
City: Aachen
Published: 18.05.2022

Cancel
Email

Password

Login    

Forgot password?
Deutsch  English