Abstract
Given a straight-line embedded plane graphh G of n edges and a polygon P of m edges, m≤ n, we describe an algorithm for finding all polygons in G that are congruent to P. Our algorithm requires Θ( n log n) time for a CREW PRAM with m processors. This improves upon the O( n 2) time (with m processors) required by the systolic array algorithmm of [7]. We also show the problem is in NC by showing how to implement our algorithm in Θ(log n) time using mn processors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
