{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NWN7JCRRBVBK6D4QOB7HVHHCOE","short_pith_number":"pith:NWN7JCRR","schema_version":"1.0","canonical_sha256":"6d9bf48a310d42af0f90707e7a9ce27129fdde82b228ad239fbbbd6dab06c4c7","source":{"kind":"arxiv","id":"1405.4691","version":2},"attestation_state":"computed","paper":{"title":"A Faster Algorithm for Computing Straight Skeletons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Liam Mencel, Siu-Wing Cheng","submitted_at":"2014-05-19T12:14:43Z","abstract_excerpt":"We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with $n$ vertices, among which $r$ are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in $O(n (\\log n)\\log r)$ time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected $O(n \\sqrt{h+1}\\log^2 n)$ time for a polygon with $h$ holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1405.4691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-19T12:14:43Z","cross_cats_sorted":[],"title_canon_sha256":"6b85103d63f88d44f2cf781ce54391692ec452154df2e4b22628e71f48dddbbb","abstract_canon_sha256":"9dee57ae19a3898c599e3f37e32b6c40a544aefeb33a06ca3f3ba2d84bdbd746"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.798152Z","signature_b64":"POMArZoO0Zo3ekZqT11XOqdLT3LcuQF7+CV6a5qnRFUA17mY2Nvs+aCaz8LOs2lHFkQrryHDQ6KEZG29CqG0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d9bf48a310d42af0f90707e7a9ce27129fdde82b228ad239fbbbd6dab06c4c7","last_reissued_at":"2026-05-18T02:47:43.797344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.797344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Computing Straight Skeletons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Liam Mencel, Siu-Wing Cheng","submitted_at":"2014-05-19T12:14:43Z","abstract_excerpt":"We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with $n$ vertices, among which $r$ are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in $O(n (\\log n)\\log r)$ time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected $O(n \\sqrt{h+1}\\log^2 n)$ time for a polygon with $h$ holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4691","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.4691","created_at":"2026-05-18T02:47:43.797474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4691v2","created_at":"2026-05-18T02:47:43.797474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4691","created_at":"2026-05-18T02:47:43.797474+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWN7JCRRBVBK","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWN7JCRRBVBK6D4Q","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWN7JCRR","created_at":"2026-05-18T12:28:41.024544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE","json":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE.json","graph_json":"https://pith.science/api/pith-number/NWN7JCRRBVBK6D4QOB7HVHHCOE/graph.json","events_json":"https://pith.science/api/pith-number/NWN7JCRRBVBK6D4QOB7HVHHCOE/events.json","paper":"https://pith.science/paper/NWN7JCRR"},"agent_actions":{"view_html":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE","download_json":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE.json","view_paper":"https://pith.science/paper/NWN7JCRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4691&json=true","fetch_graph":"https://pith.science/api/pith-number/NWN7JCRRBVBK6D4QOB7HVHHCOE/graph.json","fetch_events":"https://pith.science/api/pith-number/NWN7JCRRBVBK6D4QOB7HVHHCOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/action/storage_attestation","attest_author":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/action/author_attestation","sign_citation":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/action/citation_signature","submit_replication":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/action/replication_record"}},"created_at":"2026-05-18T02:47:43.797474+00:00","updated_at":"2026-05-18T02:47:43.797474+00:00"}