Sciweavers

Share
1370 search results - page 1 / 274
» Matching planar maps
Sort
View
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
10 years 26 days ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...
COMPGEOM
2006
ACM
10 years 5 months ago
Optimal succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
TCS
2008
9 years 11 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
BMVC
2010
9 years 9 months ago
Unifying Planar and Point Mapping in Monocular SLAM
Mapping planar structure in vision-based SLAM can increase robustness and significantly improve efficiency of map representation. However, previous systems have implemented planar...
José Martínez-Carranza, Andrew Calwa...
ICAPR
2001
Springer
10 years 4 months ago
Grouping via the Matching of Repeated Patterns
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...
Andreas Turina, Tinne Tuytelaars, Theo Moons, Luc ...
books