Approximating generalized distance functions on weighted triangulated surfaces with applications
From MaRDI portal
Publication:425342
DOI10.1016/J.CAM.2012.03.028zbMATH Open1246.65038OpenAlexW2004030533MaRDI QIDQ425342FDOQ425342
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 pathdistance functionsorder-\(k\) Voronoi diagramfacility location problemsweighted triangular surfaces
Cites Work
- Title not available (Why is that?)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Algebraic optimization: The Fermat-Weber location problem
- Title not available (Why is that?)
- GBSSS: The generalized big square small square method for planar single- facility location
- Computing largest empty circles with location constraints
- The Discrete Geodesic Problem
- The weighted region problem
- On finding approximate optimal paths in weighted regions
- A survey of geodesic paths on 3D surfaces
- Facility location on a polyhedral surface
- Efficient computation of geodesic shortest paths
- Title not available (Why is that?)
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- Title not available (Why is that?)
- Algorithms - ESA 2003
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- Stable marker-particle method for the Voronoi diagram in a flow field
Cited In (4)
- Pasting gauges. I: Shortest paths across a hyperplane
- Weighted distance transforms generalized to modules and their computation on point lattices
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
- Computation of the signed distance function to a discrete contour on adapted triangulation
Recommendations
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces 👍 👎
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces 👍 👎
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces 👍 👎
- Approximating shortest paths on weighted polyhedral surfaces 👍 👎
- Computational Science and Its Applications – ICCSA 2004 👍 👎
This page was built for publication: Approximating generalized distance functions on weighted triangulated surfaces with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425342)