A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
From MaRDI portal
Publication:6499550
DOI10.1016/J.TCS.2024.114583MaRDI QIDQ6499550
Guillermo Esteban, Anil Maheshwari, Prosenjit Bose
Publication date: 8 May 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Direct simulation of the influence of the pore structure on the diffusion process in porous media
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- An iterative method for the creation of structured hexahedral meshes over complex orography
- Topology preservation on the triangular grid
- Properties of \(n\)-dimensional triangulations
- An operator-splitting scheme for the stream function-vorticity formulation of the unsteady Navier-Stokes equations
- Coordinated motion planning for two independent robots
- A weak Galerkin finite element method for a coupled Stokes-Darcy problem on general meshes
- Towards surrogate modeling of material microstructures through the processing variables
- Hybrid Trefftz polygonal elements for heat conduction problems with inclusions/voids
- A note on the unsolvability of the weighted region shortest path problem
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- The weighted region problem
- Dense Projection Tomography on the Triangular Tiling
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- On finding approximate optimal paths in weighted regions
This page was built for publication: A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
