O( n log log n )-work parallel algorithms for straight-line grid embeddings of planar graphs
Martin Fürer, Xin He, Ming‐Yang Kao, Balaji Raghavachari · 1992
A straight-line grid embedding of a planar graph is a drawing of the graph on a plane where the vertices are located at grid points and the edges are represented by nonintersecting segments of straight lines joining their incident vertices.Given an n-vertex planar graph with n ~3, a straight-line embedding on a grid of size (n-2)X(n-2) can be computed deterministically in O(log n log log n) time with O(n log log n) work on a parallel random access machine.If randomization is used, the complexity is improved to O(log n) expected time with the same work bound.The parallel random access machine used by these algorithms allows concurrent reads and concurrent writes of the shared memory; in case of a write conflict, an arbitrary processor succeeds.sonably small grids are very useful in visualizing planar graphs on graphic screens and have wide applications in CAD/CAM and Computer Graphics [8], [27].Wagner [28], Fziry [9], and Stein [24] showed that every planar graph has a straight-line embedding.Since