Planar separators and parallel polygon triangulation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 507-516

  Goodrich, Michael T ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEPARATORS; TREES (MATHEMATICS); COMPUTATIONAL METHODS; DATA STRUCTURES; GEOMETRY; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; TRIANGULATION;

PLANAR GRAPH; PLANAR SEPARATORS; SIMPLE POLYGON; TREE STRUCTURES;

COMPUTATION THEORY; ALGORITHMS;

DETERMINISTIC ALGORITHMS; GRAPH DECOMPOSITION; PARALLEL ALGORITHMS; PARALLEL RANDOM ACCESS MACHINES; PLANAR GRAPHS; PLANAR SEPARATORS; POLYGON TRIANGULATION;

EID: 0026965757     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129762     Document Type: Conference Paper

References (25)

1. R.J. Anderson and G.L. Miller, "Deterministic Parallel List Ranking," AWOC '88, 81-90.
2. J.L. Bentley and D. Wood, "An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles," IEEE Trans, on Computers, C-29(7), 1980, 571-576.
3. S.N. Bhatt and F.T. Leighton, "A Framework for Solving VLSI Graph Layout Problems," /. Comp, and Sys. Sci., 28(2), 1984, 300-343.
4. R.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," J. ACM, 21(2), 1974, 201-206.
5. B. Chazelle, "A Theorem on Polygon Cutting with Applications," 23rd FOCS, 1982, 339-349.
6. B. Chazelle, "Triangulating a Simple Polygon in Linear Time," Disc, and Comp. Geom., 6, 1991, 485-524.
7. K.L. Clarkson, R. Cole, and R.E. Tarjan, "Randomized Parallel Algorithms for Trapezoidal Diagrams," Proc. 7th ACM Symp. on Computational Geometry, 1991, 152-161.
8. R. Cole, "Parallel Merge Sort," SIAM J. Comput., 17(4), 1988, 770-785.
9. R. Cole and U. Vishkin, "Approximate Parallel Scheduling, Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time," SIAM J. Comput., 17(1), 1988, 128-142.
10. R. Cole and U. Vishkin, "The Accelerated Cen-troid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time," Al-gorithmica, 3, 1988, 329-346.
11. R. Cole and O. Zajicek, "An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location," J. Par. and Dist. Comput., 8, 1990, 280-285.
12. G.N. Frederickson, "Fast Algorithms for Shortest Paths in Planar Graphs, with Applications," SIAM J. Comput., 6, 1987, 1004-1022.
13. M.R. Garey, D.S. Johnson, F.P. Preparata, and R.E. Tarjan, "Triangulating a Simple Polygon," IPL, 7(4), 1978, 175-179.
14. H. Gazit and G.L. Miller, "A Parallel Algorithm for Finding a Separator in Planar Graphs," 28th FOCS, 1987, 238-248.
15. M.T. Goodrich, "Triangulating a Polygon in Parallel," J. of Algorithms, 10, 1989, 327-351.
16. M.T. Goodrich, S. Shauck, and S. Guha, "Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons," Proc. 6th ACM Symp. on Computational Geometry, 1990, 73-82.
17. M.T. Goodrich and R. Tamassia, "Dynamic Trees and Dynamic Point Location," 23rd STOC, 1991, 523-533.
18. L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, "Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons," Proceedings of the Second Symposium on Computational Geometry, 1986, 1-13.
19. C. Kruskal, L. Rudolph, and M. Snir, "The Power of Parallel Prefix," Proc. 1985 IEEE Int. Conf. on Parallel Proc., 180-185.
20. R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation," J. ACM, 1980, 831-838.
21. R.J. Lipton and R.E. Tarjan, "A Separator Theorem for Planar Graphs," SIAM J. Appi. Math., 36(2), 1979, 177-189.
22. R.J. Lipton and R.E. Tarjan, "Applications of a Planar Separator Theorem," SIAM J. Comput, 0(3), 1980, 615-627.
23. G.L. Miller, "Finding Small Simple Cycle Separators for 2-Connected Planar Graphs," J. Comp, and Sys. Sci., 32, 1986, 265-279.
24. D.D. Sleator and R.E. Tarjan, "A Data Structure for Dynamic Trees," J.C.S.S., 26, 362-391,1983.
25. C.K. Yap, "Parallel Triangulation of a Polygon in Two Calls to the Trapezoidal Map," Algorithmic, 3, 1988, 279-288.