Simeon Furrer, Dirk Dahlhaus
ISIT 2005
We present efficient parallel algorithms for several basic problems in computational geometry: convex hulls, Voronoi diagrams, detecting line segment intersections, triangulating simple polygons, minimizing a circumscribing triangle, and recursive data-structures for three-dimensional queries. © 1988 Springer-Verlag New York Inc.
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Heng Cao, Haifeng Xi, et al.
WSC 2003