We consider the problem of computing geometric transformations (rotation, translation, reflexion) that map a point set A exactly or approximately into a point set B. We derive efficient algorithms for various cases (Euclidean or maximum metric, translation or rotation, or general congruence).
We present a parallel algorithm for computing the visible portion of a simple polygonal chain with 7i vertices from a point in the plane. The algorithm runs in O(logn) time using 0{nf log n) processors in the CREW-PRAM computational model, and hence is asymptotically optimal.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.