A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
An algorithm is presented to compute smoothed local symmetries on a MIMD architecture. Based on Brady and Scott's Connection Machine algorithm, it is adapted to reduce the synchronisation and communication overheads involved. Using an evidence accumulation approach similar to the Hough transform for circle detection, this algorithm can compute both local and rotational symmetries simultaneously. Implementation on an array of transputers is described and the results discussed.doi:10.1007/978-1-4471-1921-0_51 fatcat:f5kuotrwafgmda3mhv73bmsezm