{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UNHL5AMXPH7JYL6RH7PI6XGII5","short_pith_number":"pith:UNHL5AMX","schema_version":"1.0","canonical_sha256":"a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0","source":{"kind":"arxiv","id":"1304.0524","version":1},"attestation_state":"computed","paper":{"title":"A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ameya Velingker, Donald R. Sheehy, Gary L. Miller","submitted_at":"2013-04-02T03:53:46Z","abstract_excerpt":"We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time $O(2^{O(d)}(n\\log n + m))$, where $n$ is the input size, $m$ is the output point set size, and $d$ is the ambient dimension. The constants only depend on the desired element quality bounds.\n  To gain this new efficiency, the algorithm approximately maintains the Voronoi diagram of the current set of points by storing a superset of the"},"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":"1304.0524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-02T03:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"b79e1dcc0ef296691780b975b7e6145c462168b821abb18115cce99d36982c85","abstract_canon_sha256":"e7c53cbbf4ed15d17576d9676070f22d6f9f95febe2967f9b392cd6391189a4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.170158Z","signature_b64":"3Zv/IVfSecjK+IIwcdfxBhkdEVaNKeK1CvhyHoPytJWKlOBkB3aNOPf0KI6MQXyINZ+A/3t5WGmTpSUcCMjjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0","last_reissued_at":"2026-05-18T03:29:15.169483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.169483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ameya Velingker, Donald R. Sheehy, Gary L. Miller","submitted_at":"2013-04-02T03:53:46Z","abstract_excerpt":"We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time $O(2^{O(d)}(n\\log n + m))$, where $n$ is the input size, $m$ is the output point set size, and $d$ is the ambient dimension. The constants only depend on the desired element quality bounds.\n  To gain this new efficiency, the algorithm approximately maintains the Voronoi diagram of the current set of points by storing a superset of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0524","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":"1304.0524","created_at":"2026-05-18T03:29:15.169573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0524v1","created_at":"2026-05-18T03:29:15.169573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0524","created_at":"2026-05-18T03:29:15.169573+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNHL5AMXPH7J","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNHL5AMXPH7JYL6R","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNHL5AMX","created_at":"2026-05-18T12:28:02.375192+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/UNHL5AMXPH7JYL6RH7PI6XGII5","json":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5.json","graph_json":"https://pith.science/api/pith-number/UNHL5AMXPH7JYL6RH7PI6XGII5/graph.json","events_json":"https://pith.science/api/pith-number/UNHL5AMXPH7JYL6RH7PI6XGII5/events.json","paper":"https://pith.science/paper/UNHL5AMX"},"agent_actions":{"view_html":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5","download_json":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5.json","view_paper":"https://pith.science/paper/UNHL5AMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0524&json=true","fetch_graph":"https://pith.science/api/pith-number/UNHL5AMXPH7JYL6RH7PI6XGII5/graph.json","fetch_events":"https://pith.science/api/pith-number/UNHL5AMXPH7JYL6RH7PI6XGII5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/action/storage_attestation","attest_author":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/action/author_attestation","sign_citation":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/action/citation_signature","submit_replication":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/action/replication_record"}},"created_at":"2026-05-18T03:29:15.169573+00:00","updated_at":"2026-05-18T03:29:15.169573+00:00"}