{"paper":{"title":"Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Matthew J. Katz, Rom Aschner","submitted_at":"2014-02-25T09:00:19Z","abstract_excerpt":"We introduce a new structure for a set of points in the plane and an angle $\\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \\alpha \\le 2\\pi$ be an angle. An $\\alpha$-ST of $P$ is a spanning tree of the complete Euclidean graph induced by $P$, with the additional property that for each point $p \\in P$, the smallest angle around $p$ containing all the edges adjacent to $p$ is at most $\\alpha$. An $\\alpha$-MST of $P$ is then an $\\alpha$-ST of $P$ of minimum weight. For $\\alpha < \\pi/3$, an $\\alp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6096","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":""},"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"}