{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VX5WULMNFEFOVICWZMSPYW3NPI","short_pith_number":"pith:VX5WULMN","schema_version":"1.0","canonical_sha256":"adfb6a2d8d290aeaa056cb24fc5b6d7a2b50cfd35b72336a3b791899755e1774","source":{"kind":"arxiv","id":"1109.2158","version":1},"attestation_state":"computed","paper":{"title":"Deconstructing Approximate Offsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Eric Berberich, Michael Kerber, Roza Pogalnikova","submitted_at":"2011-09-09T20:53:39Z","abstract_excerpt":"We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \\eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(n log n)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using CGAL, is based o"},"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":"1109.2158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-09-09T20:53:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"10b56478465b633767b43dc9b182faca2a533b095b6685b7586e4016ab8f747e","abstract_canon_sha256":"697390524e6a41e4367d942e2b969f0bdf0be66996a8988bedbb42ab743645a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:38.395752Z","signature_b64":"MSaNHv2puMg6chFgIlMSHXOMYglUlOuTnea+2BScQbv2ihmg0I8lwWwUQZR87gzPgJ1cgQhFw4TbBK3wRkYGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adfb6a2d8d290aeaa056cb24fc5b6d7a2b50cfd35b72336a3b791899755e1774","last_reissued_at":"2026-05-18T04:13:38.395065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:38.395065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deconstructing Approximate Offsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Eric Berberich, Michael Kerber, Roza Pogalnikova","submitted_at":"2011-09-09T20:53:39Z","abstract_excerpt":"We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \\eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(n log n)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using CGAL, is based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2158","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.2158","created_at":"2026-05-18T04:13:38.395174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2158v1","created_at":"2026-05-18T04:13:38.395174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2158","created_at":"2026-05-18T04:13:38.395174+00:00"},{"alias_kind":"pith_short_12","alias_value":"VX5WULMNFEFO","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VX5WULMNFEFOVICW","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VX5WULMN","created_at":"2026-05-18T12:26:44.992195+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/VX5WULMNFEFOVICWZMSPYW3NPI","json":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI.json","graph_json":"https://pith.science/api/pith-number/VX5WULMNFEFOVICWZMSPYW3NPI/graph.json","events_json":"https://pith.science/api/pith-number/VX5WULMNFEFOVICWZMSPYW3NPI/events.json","paper":"https://pith.science/paper/VX5WULMN"},"agent_actions":{"view_html":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI","download_json":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI.json","view_paper":"https://pith.science/paper/VX5WULMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2158&json=true","fetch_graph":"https://pith.science/api/pith-number/VX5WULMNFEFOVICWZMSPYW3NPI/graph.json","fetch_events":"https://pith.science/api/pith-number/VX5WULMNFEFOVICWZMSPYW3NPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI/action/storage_attestation","attest_author":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI/action/author_attestation","sign_citation":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI/action/citation_signature","submit_replication":"https://pith.science/pith/VX5WULMNFEFOVICWZMSPYW3NPI/action/replication_record"}},"created_at":"2026-05-18T04:13:38.395174+00:00","updated_at":"2026-05-18T04:13:38.395174+00:00"}