{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZKS34EV5IPAHZEFDVYY5QCCAAS","short_pith_number":"pith:ZKS34EV5","schema_version":"1.0","canonical_sha256":"caa5be12bd43c07c90a3ae31d808400481aea6f6818d99fc0a793a9fd42732c2","source":{"kind":"arxiv","id":"2010.08744","version":2},"attestation_state":"computed","paper":{"title":"Generating Large Convex Polytopes Directly on Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chao Xu, Dong Wang, Fei Gao, Qianhao Wang, Xingguang Zhong, Yuwei Wu","submitted_at":"2020-10-17T08:36:12Z","abstract_excerpt":"In this paper, we present a method to efficiently generate large, free, and guaranteed convex space among arbitrarily cluttered obstacles. Our method operates directly on point clouds, avoids expensive calculations, and processes thousands of points within a few milliseconds, which extremely suits embedded platforms. The base stone of our method is sphere flipping, a one-one invertible nonlinear transformation, which maps a set of unordered points to a nonlinear space. With these wrapped points, we obtain a collision-free star convex polytope. Then, utilizing the star convexity, we efficiently"},"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":"2010.08744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-10-17T08:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"50e7d6a6ab4ab97b3ab0f835fde5510ef4bfa59d6cce3bf97eb79fcfc13aeb53","abstract_canon_sha256":"cd499ebafa899c20a04b45f1d34b7ba4c1b69e31cc45cce5ecd86c91f4582320"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:45.545744Z","signature_b64":"4VtFT6i+YYeHqkuPXaCJrO54MAZdvB5eozlnXoPIpHZZx9lPVvzSTdo709x5qB1dZBaPrZAYu1Gl20jJmbmwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caa5be12bd43c07c90a3ae31d808400481aea6f6818d99fc0a793a9fd42732c2","last_reissued_at":"2026-07-05T01:51:45.545252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:45.545252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Large Convex Polytopes Directly on Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chao Xu, Dong Wang, Fei Gao, Qianhao Wang, Xingguang Zhong, Yuwei Wu","submitted_at":"2020-10-17T08:36:12Z","abstract_excerpt":"In this paper, we present a method to efficiently generate large, free, and guaranteed convex space among arbitrarily cluttered obstacles. Our method operates directly on point clouds, avoids expensive calculations, and processes thousands of points within a few milliseconds, which extremely suits embedded platforms. The base stone of our method is sphere flipping, a one-one invertible nonlinear transformation, which maps a set of unordered points to a nonlinear space. With these wrapped points, we obtain a collision-free star convex polytope. Then, utilizing the star convexity, we efficiently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08744","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.08744/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2010.08744","created_at":"2026-07-05T01:51:45.545309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.08744v2","created_at":"2026-07-05T01:51:45.545309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08744","created_at":"2026-07-05T01:51:45.545309+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKS34EV5IPAH","created_at":"2026-07-05T01:51:45.545309+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKS34EV5IPAHZEFD","created_at":"2026-07-05T01:51:45.545309+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKS34EV5","created_at":"2026-07-05T01:51:45.545309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11708","citing_title":"Explore From Sketch: Accelerating UAV Exploration in Large-scale Environments with Prior Maps","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2307.08336","citing_title":"RAYEN: Imposition of Hard Convex Constraints on Neural Networks","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26626","citing_title":"STAR-Filter: Efficient Convex Free-Space Approximation via Starshaped Set Filtering in Noisy Environments","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS","json":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS.json","graph_json":"https://pith.science/api/pith-number/ZKS34EV5IPAHZEFDVYY5QCCAAS/graph.json","events_json":"https://pith.science/api/pith-number/ZKS34EV5IPAHZEFDVYY5QCCAAS/events.json","paper":"https://pith.science/paper/ZKS34EV5"},"agent_actions":{"view_html":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS","download_json":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS.json","view_paper":"https://pith.science/paper/ZKS34EV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.08744&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKS34EV5IPAHZEFDVYY5QCCAAS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKS34EV5IPAHZEFDVYY5QCCAAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS/action/storage_attestation","attest_author":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS/action/author_attestation","sign_citation":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS/action/citation_signature","submit_replication":"https://pith.science/pith/ZKS34EV5IPAHZEFDVYY5QCCAAS/action/replication_record"}},"created_at":"2026-07-05T01:51:45.545309+00:00","updated_at":"2026-07-05T01:51:45.545309+00:00"}