Visibility-driven Mesh Analysis and Visualization through Graph Cuts

Abstract

Abstract-In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications of this core algorithm: normal orientation, inside removal, and layer-based visualization. The distinguishing feature of our algorithm is its robustness even if a difficult input model that includes holes, coplanar triangles, intersecting triangles, and lost connectivity is given. Our algorithm works with the original triangles of the input model and uses sampling to construct a visibility graph that is then segmented using graph cut.

Tracking cortical activity from M/EEG using graph cuts with spatiotemporal constraints

“…However, as stated earlier, in the current application, the domain is not a regular 3D grid of pixels but a mesh. Previous contributions in the domain of computer graphics, such as (Sinha et al, nd;Zhou et al, 2008), demonstrate that graph cut methods are well adapted for discrete optimization problems over meshes, which confirms the relevance of our solution to the problem of tracking brain activations over the triangulated cortical surface.…”

Convex polyhedral meshing for robust solid modeling

“…[Cherchi et al 2020]) but their results may become invalid when coordinates are rounded to floating point values (see Sect 2.7). Local approaches may need to be complemented with hole filling [Zhao et al 2007] or mesh completion [Podolak and Rusinkiewicz 2005] algorithms to turn the valid simplicial complex to a closed polyhedron.…”

LOD Generation for Urban Scenes

“…Five rays have shown sufficient in all experiments: four towards the upper corners of B and one towards the barycenter of these corners. For input meshes highly corrupted with spurious holes, a more global approach [Zhou et al 2008] would be better suited. -An integer that denotes the index of the cell of the planar arrangement containing the anchor.…”