{"paper":{"title":"Computing the flip distance between triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Sedgwick, Ge Xia, Iyad Kanj","submitted_at":"2014-07-06T18:46:17Z","abstract_excerpt":"Let ${\\cal T}$ be a triangulation of a set ${\\cal P}$ of $n$ points in the plane, and let $e$ be an edge shared by two triangles in ${\\cal T}$ such that the quadrilateral $Q$ formed by these two triangles is convex. A {\\em flip} of $e$ is the operation of replacing $e$ by the other diagonal of $Q$ to obtain a new triangulation of ${\\cal P}$ from ${\\cal T}$. The {\\em flip distance} between two triangulations of ${\\cal P}$ is the minimum number of flips needed to transform one triangulation into the other. The Flip Distance problem asks if the flip distance between two given triangulations of ${"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1525","kind":"arxiv","version":2},"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"}