论文信息 - Parallel triangulation of a polygon in two calls to the trapezoidal map

Parallel triangulation of a polygon in two calls to the trapezoidal map

We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in timeO(logn) usingO(n) CREW PRAM processors.

Chee-Keng Yap

[1] Robert E. Tarjan,et al. Correction to "A Linear-Time Algorithm for Triangulating Simple Polygons" , 1987, FOCS.

[2] Mikhail J. Atallah,et al. Efficient parallel techniques for computational geometry , 1987 .

[3] Robert E. Tarjan,et al. A linear-time algorithm for triangulating simple polygons , 1986, STOC '86.

[4] Richard Cole,et al. Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms , 1987, FOCS.

[5] Alain Fournier,et al. Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[6] Mikhail J. Atallah,et al. Efficient plane sweeping in parallel , 1986, SCG '86.

[7] Bernard Chazelle,et al. Triangulation and shape-complexity , 1984, TOGS.

[8] Leonidas J. Guibas,et al. Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).