Planar embedding: linear-time algorithms for vertex placement and edge orderings

DOI10.1109/31.1746zbMath0654.68089OpenAlexW2154845271MaRDI QIDQ3801097

Krishnaiyan Thulasiraman, M. N. S. Swamy, R. Jayakumar

Publication date: 1988

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.1746

zbMATH Keywords

planar embeddingPQ-treesplanarity testinghorvert representationintersection-free drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms in computer science (68W99)

Related Items (6)

Drawing planar graphs using the canonical ordering ⋮ O(n2) algorithms for graph planarization ⋮ Dynamic maintenance of planar digraphs, with applications ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Constructing compact rectilinear planar layouts using canonical representation of planar graphs ⋮ Topological recognition of polyhedral objects from multiple views

This page was built for publication: Planar embedding: linear-time algorithms for vertex placement and edge orderings