A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
From MaRDI portal
Publication:6499550
Cites work
- scientific article; zbMATH DE number 1424295 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- A note on the unsolvability of the weighted region shortest path problem
- A weak Galerkin finite element method for a coupled Stokes-Darcy problem on general meshes
- An iterative method for the creation of structured hexahedral meshes over complex orography
- An operator-splitting scheme for the stream function-vorticity formulation of the unsteady Navier-Stokes equations
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- Approximation algorithms for geometric shortest path problems
- Coordinated motion planning for two independent robots
- Dense Projection Tomography on the Triangular Tiling
- Determining approximate shortest paths on weighted polyhedral surfaces
- Direct simulation of the influence of the pore structure on the diffusion process in porous media
- Hybrid Trefftz polygonal elements for heat conduction problems with inclusions/voids
- On finding approximate optimal paths in weighted regions
- Properties of n-dimensional triangulations
- The weighted region problem
- Topology preservation on the triangular grid
- Towards surrogate modeling of material microstructures through the processing variables
This page was built for publication: A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499550)
