chen@shinobu.ics.osaka-u.junet (Chen Wei) (03/19/90)
I am Wei Chen.I am a graduate student in Oosaka University, Japan. I am working at the problems about finding intersections of polygons recently. It was known the problem of testing whether two n-vertex simple polygons intersect can be sloved in time O(nlogn) and the lower bound of time for computing this intersection is c*(nlogn+k) (c is constant,k is the number of vertices of intersection). But it seems there isn't any algorithm for computing inter- section of two n-vertex simply polygons. if who knows it , please tell me. No matter how much time it uses and no matter sequential algorithm or parallel algorithm. Thank you. --- Chen Wei chen@ics.osaka-u.ac.jp