Computational Geometry On The OTIS-Mesh Optoelectronic Computer

We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF respectively. We show that all these problems can be solved in ¡£¢¥¤ ¦¨§ time even with ¦¨© inputs. Keywords and phrases: optoelectronic computer, OTISMesh, convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, closestpair, prefix sum with condition.

• Type: Conference
• Year: 2002
• Where: ICPP
• Authors: Chih-Fang Wang, Sartaj Sahni
• Keywords: Convex Hull, ICPP 2002, Optoelectronic Computer, Smallest Enclosing Box