, Volume 40, Issue 3, pp 147–160 | Cite as

Pattern Matching for Sets of Segments

  • Alon Efrat
  • Piotr Indyk
  • Suresh Venkatasubramanian


In this paper we present algorithms for a number of problems in geometric pattern matching where the input consists of a collection of orthogonal segments in the plane. Such collections arise naturally from problems in mapping buildings and robot exploration. We propose a new criterion for segment similarity called the coverage measure, and present efficient algorithms for maximizing it between sets of axis-parallel segments under translations. In the general case, we present a procedure running in time O(n3 log2 n), and for the case when all segments are horizontal, we give a procedure that runs in time O(n2 log2 n). Here n is the number of segments. In addition, we show that an ε-approximation to the Hausdorff distance between two sets of horizontal segments under vertical translations can be computed in time O(n3/2 max(poly(log M, log n, 1/ε))). Here, M denotes the ratio of the diameter to the closest pair of points in the sets of segments (where pairs of points lie on different segments). These algorithms are significant improvements over the general algorithm of Agarwal et al. that required time O(n4 log2

Pattern matching Orthogonal segments Maximum coverage Computational geometry 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  1. 1.Computer Science Department, University of Arizona, Tucson, AZ 85721-0077USA
  2. 2.Computer Science Department, Stanford University, Stanford, CA 94306-9010USA
  3. 3.AT&T Labs – Research, 180 Park Avenue, Florham Park, NJ 07932USA

Personalised recommendations