Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem

DOI10.1016/S0020-0190(97)00168-3zbMath1337.68267OpenAlexW1990048695MaRDI QIDQ287251

Frank Dehne, Katia S. Guimarães

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00168-3

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Detection of binocular disparities
• The translation square map and approximate congruence
• Approximate decision algorithms for approximate congruence
• Congruence, similarity, and symmetries of geometric objects
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item

This page was built for publication: Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem