{"paper":{"title":"Optimal Morphs of Planar Orthogonal Drawings II","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arthur van Goethem, Bettina Speckmann, Kevin Verbeek","submitted_at":"2019-08-22T13:36:09Z","abstract_excerpt":"Van Goethem and Verbeek recently showed how to morph between two planar orthogonal drawings $\\Gamma_I$ and $\\Gamma_O$ of a connected graph $G$ while preserving planarity, orthogonality, and the complexity of the drawing during the morph. Necessarily drawings $\\Gamma_I$ and $\\Gamma_O$ must be equivalent, that is, there exists a homeomorphism of the plane that transforms $\\Gamma_I$ into $\\Gamma_O$. Van Goethem and Verbeek use $O(n)$ linear morphs, where $n$ is the maximum complexity of the input drawings. However, if the graph is disconnected their method requires $O(n^{1.5})$ linear morphs. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08365","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"}