{"paper":{"title":"Windrose Planarity: Embedding Graphs with Direction-Constrained Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Giordano Da Lozzo, Giuseppe Di Battista, G\\\"unter Rote, Ignaz Rutter, Patrizio Angelini, Philipp Kindermann, Valentino Di Donato","submitted_at":"2015-10-09T13:00:42Z","abstract_excerpt":"Given a planar graph $G$ and a partition of the neighbors of each vertex $v$ in four sets $UR(v)$, $UL(v)$, $DL(v)$, and $DR(v)$, the problem Windrose Planarity asks to decide whether $G$ admits a windrose-planar drawing, that is, a planar drawing in which (i) each neighbor $u \\in UR(v)$ is above and to the right of $v$, (ii) each neighbor $u \\in UL(v)$ is above and to the left of $v$, (iii) each neighbor $u \\in DL(v)$ is below and to the left of $v$, (iv) each neighbor $u \\in DR(v)$ is below and to the right of $v$, and (v) edges are represented by curves that are monotone with respect to eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02659","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}