Pattern matching for sets of segments

DOI10.1007/s00453-004-1089-yzbMath1082.52008arXivcs/0009013MaRDI QIDQ1762985

Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian

Publication date: 11 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0009013

zbMATH Keywords

Computational geometry; Pattern matching; Maximum coverage; Orthogonal segments

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

68T40: Artificial intelligence for robotics

Related Items

Approximately matching polygonal curves with respect to the Fréchet distance