Shortest path geometric rounding

DOI10.1007/S004530010004zbMath0953.68135OpenAlexW1994875224MaRDI QIDQ1977118

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)

Related Items (10)

AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES ⋮ Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments ⋮ PLANAR SHAPE MANIPULATION USING APPROXIMATE GEOMETRIC PRIMITIVES ⋮ Computational issues in solid boundary evaluation ⋮ Iterated snap rounding with bounded drift ⋮ Rational orthogonal approximations to orthogonal matrices ⋮ TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS ⋮ VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments ⋮ Inner and outer rounding of Boolean operations on lattice polygonal regions ⋮ Iterated snap rounding

This page was built for publication: Shortest path geometric rounding