Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach

DOI10.1007/s10878-019-00425-xzbMath1430.90544OpenAlexW2946999827MaRDI QIDQ2331593

Gergely Kovács, Béla Vizvári, Benedek Nagy

Publication date: 29 October 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00425-x

zbMATH Keywords

optimizationlinear programmingshortest pathsdigital geometryweighted distanceschamfer distancesnon-traditional grids

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computing methodologies for image processing (68U10) Linear programming (90C05) Discrete geometry (52C99)

Related Items (1)

On disks of the triangular grid: an application of optimization theory in discrete geometry

Cites Work

• A note on two problems in connexion with graphs
• Application of neighborhood sequences in communication of hexagonal networks
• Distance with generalized neighbourhood sequences in \(n D\) and \(\infty D\)
• Weighted distances based on neighborhood sequences for point-lattices
• Distances defined by neighborhood sequences
• On the number of vertices of random convex polyhedra
• Chamfer metrics in mathematical morphology
• Weighted distances and digital disks on the Khalimsky grid. Disks with holes and islands
• Distance on a Hexagonal Grid
• Distance transforms in 3D using four different weights
• Weighted Distances on a Triangular Grid
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach