[PDF][PDF] Planar separators and parallel polygon triangulation (preliminary version)
MT Goodrich - Proceedings of the twenty-fourth annual ACM …, 1992 - dl.acm.org
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, 1992•dl.acm.org
We show how to construct a O (fi)-separator decomposition of a planar graph in O (n) time,
and how to triangulate a simple polygon deterministically in parallel in O (log n) time using O
(n/log n) processors on a CRCW PRAM. Both of these results are based on exploiting more
of the“tree structure” of these problems.
and how to triangulate a simple polygon deterministically in parallel in O (log n) time using O
(n/log n) processors on a CRCW PRAM. Both of these results are based on exploiting more
of the“tree structure” of these problems.
Abstract
We show how to construct a O (fi)-separator decomposition of a planar graph in O (n) time, and how to triangulate a simple polygon deterministically in parallel in O (log n) time using O (n/log n) processors on a CRCW PRAM. Both of these results are based on exploiting more of the“tree structure” of these problems.