{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KO7PEVCN4MZO6KP5OETLDXFRKE","short_pith_number":"pith:KO7PEVCN","schema_version":"1.0","canonical_sha256":"53bef2544de332ef29fd7126b1dcb1512f8a504b27a8179af07c3455000d7780","source":{"kind":"arxiv","id":"1001.3593","version":2},"attestation_state":"computed","paper":{"title":"Farthest-Polygon Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hazel Everett (INRIA Lorraine - LORIA), Hyeon-Suk Na, Joachim Gudmundsson (NICTA), Marc Glisse (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Mira Lee (KAIST CS), Otfried Cheong (KAIST CS), Samuel Hornus (INRIA Lorraine - LORIA), Sylvain Lazard (INRIA Lorraine - LORIA)","submitted_at":"2010-01-20T14:09:41Z","abstract_excerpt":"Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log^3 n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k-1 connected components, but if one component is bounded, then it is equal to the entire region."},"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":"1001.3593","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-01-20T14:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"400189ab3e6c518c320758d22b557a8fcf4defa0b5c19e9c87f9ce10b3800fe7","abstract_canon_sha256":"20c1d8e617aafd01bb8d470304292efca7c012d391064094bccf168853179205"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:19.586064Z","signature_b64":"NyzvGGXSKJSVd71Y/nYXtX/bLdK+TMZwxPVUx1ETUwGboa81DzTS9/IFlH8ucmGBgfn2MJOhHDk9jHXHsJMcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53bef2544de332ef29fd7126b1dcb1512f8a504b27a8179af07c3455000d7780","last_reissued_at":"2026-05-18T04:34:19.585616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:19.585616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Farthest-Polygon Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hazel Everett (INRIA Lorraine - LORIA), Hyeon-Suk Na, Joachim Gudmundsson (NICTA), Marc Glisse (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Mira Lee (KAIST CS), Otfried Cheong (KAIST CS), Samuel Hornus (INRIA Lorraine - LORIA), Sylvain Lazard (INRIA Lorraine - LORIA)","submitted_at":"2010-01-20T14:09:41Z","abstract_excerpt":"Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log^3 n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k-1 connected components, but if one component is bounded, then it is equal to the entire region."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3593","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":"1001.3593","created_at":"2026-05-18T04:34:19.585679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.3593v2","created_at":"2026-05-18T04:34:19.585679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3593","created_at":"2026-05-18T04:34:19.585679+00:00"},{"alias_kind":"pith_short_12","alias_value":"KO7PEVCN4MZO","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KO7PEVCN4MZO6KP5","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KO7PEVCN","created_at":"2026-05-18T12:26:09.077623+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/KO7PEVCN4MZO6KP5OETLDXFRKE","json":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE.json","graph_json":"https://pith.science/api/pith-number/KO7PEVCN4MZO6KP5OETLDXFRKE/graph.json","events_json":"https://pith.science/api/pith-number/KO7PEVCN4MZO6KP5OETLDXFRKE/events.json","paper":"https://pith.science/paper/KO7PEVCN"},"agent_actions":{"view_html":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE","download_json":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE.json","view_paper":"https://pith.science/paper/KO7PEVCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.3593&json=true","fetch_graph":"https://pith.science/api/pith-number/KO7PEVCN4MZO6KP5OETLDXFRKE/graph.json","fetch_events":"https://pith.science/api/pith-number/KO7PEVCN4MZO6KP5OETLDXFRKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/action/storage_attestation","attest_author":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/action/author_attestation","sign_citation":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/action/citation_signature","submit_replication":"https://pith.science/pith/KO7PEVCN4MZO6KP5OETLDXFRKE/action/replication_record"}},"created_at":"2026-05-18T04:34:19.585679+00:00","updated_at":"2026-05-18T04:34:19.585679+00:00"}