Computing generalized higher-order Voronoi diagrams on triangulated surfaces

DOI10.1016/j.amc.2009.04.075zbMath1175.65031OpenAlexW1972751277MaRDI QIDQ732480

J. Antoni Sellarès, Marta Fort

Publication date: 9 October 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.075

zbMATH Keywords

algorithmshortest pathVoronoi diagramcomputational geometrydistance functiongraphical examplestriangulated surfacehardware graphics

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Approximating generalized distance functions on weighted triangulated surfaces with applications

Uses Software

• DiFi

Cites Work

• Algebraic optimization: The Fermat-Weber location problem
• Higher-order Voronoi diagrams on triangulated surfaces
• 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
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Algorithms - ESA 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing generalized higher-order Voronoi diagrams on triangulated surfaces