Crack Modeling via Minimum-Weight Surfaces in 3d Voronoi Diagrams

10/11/2022
by   Christian Jung, et al.
0

Shortest paths play an important role in mathematical modeling and image processing. Usually, shortest path problems are formulated on planar graphs that consist of vertices and weighted arcs. In this context, one is interested in finding a path of minimum weight from a start vertex to an end vertex. The concept of minimum-weight surfaces extends shortest paths to 3d. The minimum-weight surface problem is formulated on a cellular complex with weighted facets. A cycle on the arcs of the complex serves as input and one is interested in finding a surface of minimum weight bounded by that cycle. In practice, minimum-weight surfaces can be used to segment 3d images. Vice versa, it is possible to use them as a modeling tool for geometric structures such as cracks. In this work, we present an approach for using minimum-weight surfaces in bounded Voronoi diagrams to generate synthetic 3d images of cracks.

READ FULL TEXT

page 5

page 7

page 8

page 9

page 10

page 11

research
11/27/2021

On approximating shortest paths in weighted triangular tessellations

We study the quality of weighted shortest paths when a continuous 2-dime...
research
04/03/2018

Holiest Minimum-Cost Paths and Flows in Surface Graphs

Let G be an edge-weighted directed graph with n vertices embedded on an ...
research
08/24/2023

Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions

We consider the Shortest Odd Path problem, where given an undirected gra...
research
11/23/2022

Shortest Odd Paths in Conservative Graphs: Connections and Complexity

We present some reductions between optimization problems for undirected ...
research
10/09/2019

Minimum Cuts in Surface Graphs

We describe algorithms to efficiently compute minimum (s,t)-cuts and glo...
research
02/15/2011

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains

We present the first polynomial time approximation algorithm for computi...
research
12/24/2020

A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs

Both geometric and semantic information of the search space is imperativ...

Please sign up or login with your details

Forgot password? Click here to reset