Abstract
We show how to construct a O(√n)-separator decomposition of a planar graph in 0(n) time, and how to triangulate a simple polygon deterministi-cally 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.
Cite
CITATION STYLE
APA
Goodrich, M. T. (1992). Planar separators and parallel polygon triangulation. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129722, pp. 507–516). Association for Computing Machinery. https://doi.org/10.1145/129712.129762
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free