On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
SIAM Journal on Computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Approximate decision algorithms for point set congruence
Computational Geometry: Theory and Applications
Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Generalized Fre´chet distance between curves
Proceedings of the international conference on Mathematical methods for curves and surfaces II Lillehammer, 1997
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improvements on Geometric Pattern Matching Problems
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Geometric Pattern Matching in d-Dimensional Space
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Pattern Matching for Spatial Point Sets
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Geometric shape matching and drug design
Geometric shape matching and drug design
Matching Polygonal Curves with Respect to the Fréchet Distance
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximately matching polygonal curves with respect to the Fréchet distance
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Efficient algorithms for substring near neighbor problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Journal of Mathematical Imaging and Vision
Approximately matching polygonal curves with respect to the Fréchet distance
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
| Hi-index | 0.00 |
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 plain. 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 &Ogr;(n3polylogn) in the general case, and run in time &Ogr;(n3polylogn) for the case when all segments are horizontal. In addition, we show that when restricted to translations that are only vertical, the Hausdorff distance between two sets of horizontal segments can be computed in time roughly &Ogr;(n3/2polylog n). These algorithms are significant improvements over the general algorithm of Chew et al. that takes time &Ogr;(n4 log2 n).In the second part of this paper we address the problem of matching polygonal chains. We study the well known Fréchet distance, and present the first algorithm for computing the Fréchet distance under general translations. Our methods also yield algorithms for computing a generalization of the Fréchet distance, and we present a simple approximation algorithm for the Fréchet distance and its generalization that runs in time &Ogr;(n2polylogn).