Shortest path geometric rounding

DOI10.1007/S004530010004MaRDI QIDQ1977118zbMATH OpenOpenAlexFDO

Authors Victor J. Milenkovic

Publication date 29 January 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004530010004

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Shortest-path-preserving rounding
• Geometric k Shortest Paths
• Finding Shortest Paths With Computational Geometry
• Approximating geometric bottleneck shortest paths
• scientific article; zbMATH DE number 1962800
• scientific article; zbMATH DE number 1424303
• Approximation algorithms for geometric shortest path problems
• Efficient computation of geodesic shortest paths
• Shortest paths for line segments
• Drawing Shortest Paths in Geodetic Graphs

Cited in

(13)

• Iterated snap rounding
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Inner and outer rounding of Boolean operations on lattice polygonal regions
• Computational issues in solid boundary evaluation
• Planar shape manipulation using approximate geometric primitives
• Two approximate Minkowski sum algorithms
• AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
• VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
• Inner and outer rounding of set operations on lattice polygonal regions
• Iterated snap rounding with bounded drift
• Rounding meshes in 3D
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Rational orthogonal approximations to orthogonal matrices

This page was built for publication: Shortest path geometric rounding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977118)