Matching of Line Segments in 2-D Under Similarity Transformations.

Date of Submission

December 2003

Date of Award

Winter 12-12-2004

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Bhattacharya, Bhargab Bikram (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

This report present a simple algorithm for the matching of line segments in2D under similarity transformations. Given a set S of m line segments, called sample set, and a pattern set P of k line segments (k ≤ m), the problem is to find a matching of P with a subsct of S under similarity transformations. The proposed algorithm requires O(n) space and preprocessing time O(n log(n)), and worst case query time complexity is O(kn log(n) + n2). If set S consists of non parallel line segments then time complexity for such a case will reduce to O(kn log(n))


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.