{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AOUTFQNDOQZSFVNNI75SMUDVL3","short_pith_number":"pith:AOUTFQND","schema_version":"1.0","canonical_sha256":"03a932c1a3743322d5ad47fb2650755efecc4e677faccad0e5a127a30af451e6","source":{"kind":"arxiv","id":"1603.08485","version":1},"attestation_state":"computed","paper":{"title":"Incremental Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"John Iacono, Luis Barba, Sarah R. Allen, Stefan Langerman","submitted_at":"2016-03-28T18:59:36Z","abstract_excerpt":"We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram $\\mathcal{V}(S)$ (and several variants thereof) of a set $S$ of $n$ sites in the plane as sites are added.\n  We define a general update operation for planar graphs modeling the incremental construction of several variants of Voronoi diagrams as well as the incremental construction of an intersection of halfspaces in $\\mathbb{R}^3$. We show that the amortized number of edge insertions and removals needed to add a new site is $O(\\sqrt{n})$. A matching "},"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":"1603.08485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-28T18:59:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d7a6580b794c5a9ad719a3d6c3613773270ac2f199e3804d583f22084b8c8dc9","abstract_canon_sha256":"e6681de7e8241c3a8b8894dad836b4afd74ed2d059796753a4bf1dd5a2858d10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:10.661589Z","signature_b64":"KZtgGQb5Y52pYT+FbyC5ikchutBM5+mvnHo2pHfacSRPu3udbJ9tO8Hsl4mrM9T3f+Zau5YYo3Zgy6i+9hVzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03a932c1a3743322d5ad47fb2650755efecc4e677faccad0e5a127a30af451e6","last_reissued_at":"2026-05-18T01:18:10.661178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:10.661178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"John Iacono, Luis Barba, Sarah R. Allen, Stefan Langerman","submitted_at":"2016-03-28T18:59:36Z","abstract_excerpt":"We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram $\\mathcal{V}(S)$ (and several variants thereof) of a set $S$ of $n$ sites in the plane as sites are added.\n  We define a general update operation for planar graphs modeling the incremental construction of several variants of Voronoi diagrams as well as the incremental construction of an intersection of halfspaces in $\\mathbb{R}^3$. We show that the amortized number of edge insertions and removals needed to add a new site is $O(\\sqrt{n})$. A matching "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08485","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":"1603.08485","created_at":"2026-05-18T01:18:10.661235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08485v1","created_at":"2026-05-18T01:18:10.661235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08485","created_at":"2026-05-18T01:18:10.661235+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOUTFQNDOQZS","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOUTFQNDOQZSFVNN","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOUTFQND","created_at":"2026-05-18T12:30:07.202191+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/AOUTFQNDOQZSFVNNI75SMUDVL3","json":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3.json","graph_json":"https://pith.science/api/pith-number/AOUTFQNDOQZSFVNNI75SMUDVL3/graph.json","events_json":"https://pith.science/api/pith-number/AOUTFQNDOQZSFVNNI75SMUDVL3/events.json","paper":"https://pith.science/paper/AOUTFQND"},"agent_actions":{"view_html":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3","download_json":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3.json","view_paper":"https://pith.science/paper/AOUTFQND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08485&json=true","fetch_graph":"https://pith.science/api/pith-number/AOUTFQNDOQZSFVNNI75SMUDVL3/graph.json","fetch_events":"https://pith.science/api/pith-number/AOUTFQNDOQZSFVNNI75SMUDVL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3/action/storage_attestation","attest_author":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3/action/author_attestation","sign_citation":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3/action/citation_signature","submit_replication":"https://pith.science/pith/AOUTFQNDOQZSFVNNI75SMUDVL3/action/replication_record"}},"created_at":"2026-05-18T01:18:10.661235+00:00","updated_at":"2026-05-18T01:18:10.661235+00:00"}