Approximating generalized distance functions on weighted triangulated surfaces with applications
From MaRDI portal
Publication:425342
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
Cites work
- scientific article; zbMATH DE number 2086226 (Why is no real title available?)
- scientific article; zbMATH DE number 5506188 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 1424293 (Why is no real title available?)
- A survey of geodesic paths on 3D surfaces
- Algebraic optimization: The Fermat-Weber location problem
- Approximation algorithms for geometric shortest path problems
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- Computing largest empty circles with location constraints
- Determining approximate shortest paths on weighted polyhedral surfaces
- Efficient computation of geodesic shortest paths
- Facility location on a polyhedral surface
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- GBSSS: The generalized big square small square method for planar single- facility location
- On finding approximate optimal paths in weighted regions
- Stable marker-particle method for the Voronoi diagram in a flow field
- Streaming geometric optimization using graphics hardware
- The Discrete Geodesic Problem
- The weighted region problem
Cited in
(6)- Pasting gauges. I: Shortest paths across a hyperplane
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- Approximate distance queries for weighted polyhedral surfaces
- Weighted distance transforms generalized to modules and their computation on point lattices
- Computation of the signed distance function to a discrete contour on adapted triangulation
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
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)