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...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Carleton University
2023-04-01
|
| Serier: | Journal of Computational Geometry |
| Online adgang: | https://jocg.org/index.php/jocg/article/view/4151 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|