Approximating generalized distance functions on weighted triangulated surfaces with applications
From MaRDI portal
Publication:425342
DOI10.1016/j.cam.2012.03.028zbMath1246.65038MaRDI QIDQ425342
Marta Fort, J. Antoni Sellarès
Publication date: 8 June 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2012.03.028
shortest path; distance functions; order-\(k\) Voronoi diagram; facility location problems; weighted triangular surfaces
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic optimization: The Fermat-Weber location problem
- A survey of geodesic paths on 3D surfaces
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- Stable marker-particle method for the Voronoi diagram in a flow field
- GBSSS: The generalized big square small square method for planar single- facility location
- Facility location on a polyhedral surface
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Efficient computation of geodesic shortest paths
- The Discrete Geodesic Problem
- Computing largest empty circles with location constraints
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- The weighted region problem
- On finding approximate optimal paths in weighted regions
- Algorithms - ESA 2003