Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case

DOI10.1016/j.comgeo.2014.04.003zbMath1291.65065OpenAlexW2024041833MaRDI QIDQ2248735

Christian Scheffer, Jan Vahrenhold

Publication date: 27 June 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.04.003

zbMATH Keywords

approximation algorithmmanifold reconstructionweighted geodesic distances

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\)

Uses Software

• Powercrust

Cites Work

• Unnamed Item
• Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\)
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Surface reconstruction by Voronoi filtering
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
• The power crust, unions of balls, and the medial axis transform
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces

This page was built for publication: Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case