An SPQR-tree-like embedding representation for level planarity
An SPQR-tree is a data structure that efficiently represents all planar embeddings of a connected planar graph. It is a key tool in a number of constrained planarity testing algorithms, which seek a planar embedding of a graph subject to some given set of constraints. We develop an SPQR-tree-li...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Carleton University
2023-04-01
|
| Ráidu: | Journal of Computational Geometry |
| Liŋkkat: | https://jocg.org/index.php/jocg/article/view/4151 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|