Pattern matching for sets of segments

In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and measures that relate to collections of orthogonal line segments in the plane. Such collections arise naturally from problems in mapping buildings and robot exploration. We propose a new measure of segment similarity called a coverage measure, and present efficient algorithms for maximising this measure between sets of axis-parallel segments under translations. Our algorithms run in time O(n polylogn) in the general case, and run in time O(n

• Type: Conference
• Year: 2001
• Where: SODA
• Authors: Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
• Keywords: Algorithm, Algorithms, Fr´echet Distance, Orthogonal Line Segments, SODA 2001