Answers are grounded in this paper and cite their sources.
In diagrammatic representations of hierarchies the minimization of the number of crossings between edges is a well-known criterion for improving readability. An efficient algorithm for testing if a hierarchy is planar (i.e. if it can be drawn without edge crossings) is proposed. A complete combinatorial characterization of the class of planar hierarchies is also given.>
No takes yet. Share an insight, caveat, or question.
Battista et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: