{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NUJNKZVTFAUPCOQUTNRISXVEQJ","short_pith_number":"pith:NUJNKZVT","schema_version":"1.0","canonical_sha256":"6d12d566b32828f13a149b62895ea48246091d29f7527fdb5143e209270df54b","source":{"kind":"arxiv","id":"1801.02292","version":1},"attestation_state":"computed","paper":{"title":"Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn","submitted_at":"2018-01-08T02:47:09Z","abstract_excerpt":"Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones for m <= n/ polylog n. Moreover, the algorithms for the geodesic nearest-point and farthest-point Voronoi diagrams are optimal for m <= n/ polylog n. This partially answers a question posed by Mitchell in the Handbook of Computational Geometry."},"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":"1801.02292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-01-08T02:47:09Z","cross_cats_sorted":[],"title_canon_sha256":"3e7eae419635556e8bcca3ce3682e218b65b5d55587aabeed3f58e2f7ff3a4ee","abstract_canon_sha256":"9b9ac5f317c833681063d56ded691579c4de5ae688e5d9d2ffc3858314d58ceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:32.146139Z","signature_b64":"TiNNdX9G26M/8y2SgZZzjoTa5CMtB83tOT/wz/R7w1rJVVc3PAiYWXVwxBVj4J9mYh6wFPa1Mjtxp0SkPzjjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d12d566b32828f13a149b62895ea48246091d29f7527fdb5143e209270df54b","last_reissued_at":"2026-05-18T00:26:32.145505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:32.145505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn","submitted_at":"2018-01-08T02:47:09Z","abstract_excerpt":"Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones for m <= n/ polylog n. Moreover, the algorithms for the geodesic nearest-point and farthest-point Voronoi diagrams are optimal for m <= n/ polylog n. This partially answers a question posed by Mitchell in the Handbook of Computational Geometry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02292","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":"1801.02292","created_at":"2026-05-18T00:26:32.145611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02292v1","created_at":"2026-05-18T00:26:32.145611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02292","created_at":"2026-05-18T00:26:32.145611+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUJNKZVTFAUP","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUJNKZVTFAUPCOQU","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUJNKZVT","created_at":"2026-05-18T12:32:40.477152+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/NUJNKZVTFAUPCOQUTNRISXVEQJ","json":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ.json","graph_json":"https://pith.science/api/pith-number/NUJNKZVTFAUPCOQUTNRISXVEQJ/graph.json","events_json":"https://pith.science/api/pith-number/NUJNKZVTFAUPCOQUTNRISXVEQJ/events.json","paper":"https://pith.science/paper/NUJNKZVT"},"agent_actions":{"view_html":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ","download_json":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ.json","view_paper":"https://pith.science/paper/NUJNKZVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02292&json=true","fetch_graph":"https://pith.science/api/pith-number/NUJNKZVTFAUPCOQUTNRISXVEQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NUJNKZVTFAUPCOQUTNRISXVEQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/action/storage_attestation","attest_author":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/action/author_attestation","sign_citation":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/action/citation_signature","submit_replication":"https://pith.science/pith/NUJNKZVTFAUPCOQUTNRISXVEQJ/action/replication_record"}},"created_at":"2026-05-18T00:26:32.145611+00:00","updated_at":"2026-05-18T00:26:32.145611+00:00"}