{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XPZACJCCTOIUY2HESHN4HPWW2X","short_pith_number":"pith:XPZACJCC","schema_version":"1.0","canonical_sha256":"bbf20124429b914c68e491dbc3bed6d5d40d3dfdeb29376ae4a481a83e77f4fb","source":{"kind":"arxiv","id":"1606.02055","version":1},"attestation_state":"computed","paper":{"title":"From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Bernard Boigelot, St\\'ephane Lens","submitted_at":"2016-06-07T08:04:43Z","abstract_excerpt":"This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be followed around a given set of obstacles. Our solution consists in an original refinement algorithm for constrained Delaunay triangulations, aimed at generating a roadmap graph suited for planning paths with arbitrary clearance. In other words, a minimum distance to the obstacles can be specified, and the graph does not have to be recomputed if this distance"},"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":"1606.02055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T08:04:43Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"ab7e76c710b9fbc24665a38efdc01b63ff6f76d8227e8307f8ee5e1241612e5e","abstract_canon_sha256":"670ad36650cf5cc0e8a927904896dfb8186d125c56f75140ea93747b355e261c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.709199Z","signature_b64":"yxhgL7U+t3Scaoqe+QL5j4U/3JNoU6SaCPhaMdI7FR8q01Iy4bjWpQITdrz09iGSuxvKl+up+rNSZUWJZH/NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbf20124429b914c68e491dbc3bed6d5d40d3dfdeb29376ae4a481a83e77f4fb","last_reissued_at":"2026-05-18T01:12:44.708827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.708827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Bernard Boigelot, St\\'ephane Lens","submitted_at":"2016-06-07T08:04:43Z","abstract_excerpt":"This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be followed around a given set of obstacles. Our solution consists in an original refinement algorithm for constrained Delaunay triangulations, aimed at generating a roadmap graph suited for planning paths with arbitrary clearance. In other words, a minimum distance to the obstacles can be specified, and the graph does not have to be recomputed if this distance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02055","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":"1606.02055","created_at":"2026-05-18T01:12:44.708886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02055v1","created_at":"2026-05-18T01:12:44.708886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02055","created_at":"2026-05-18T01:12:44.708886+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPZACJCCTOIU","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPZACJCCTOIUY2HE","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPZACJCC","created_at":"2026-05-18T12:30:51.357362+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/XPZACJCCTOIUY2HESHN4HPWW2X","json":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X.json","graph_json":"https://pith.science/api/pith-number/XPZACJCCTOIUY2HESHN4HPWW2X/graph.json","events_json":"https://pith.science/api/pith-number/XPZACJCCTOIUY2HESHN4HPWW2X/events.json","paper":"https://pith.science/paper/XPZACJCC"},"agent_actions":{"view_html":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X","download_json":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X.json","view_paper":"https://pith.science/paper/XPZACJCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02055&json=true","fetch_graph":"https://pith.science/api/pith-number/XPZACJCCTOIUY2HESHN4HPWW2X/graph.json","fetch_events":"https://pith.science/api/pith-number/XPZACJCCTOIUY2HESHN4HPWW2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/action/storage_attestation","attest_author":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/action/author_attestation","sign_citation":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/action/citation_signature","submit_replication":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/action/replication_record"}},"created_at":"2026-05-18T01:12:44.708886+00:00","updated_at":"2026-05-18T01:12:44.708886+00:00"}