{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OLOY6HLI3AGWQGCDZSRI6MDSUF","short_pith_number":"pith:OLOY6HLI","schema_version":"1.0","canonical_sha256":"72dd8f1d68d80d681843cca28f3072a17e572217c9dafa4f88f68f50a1070bc2","source":{"kind":"arxiv","id":"1204.2634","version":1},"attestation_state":"computed","paper":{"title":"Space-efficient Algorithms for Visibility Problems in Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Minati De, Subhas C. Nandy","submitted_at":"2012-04-12T07:07:33Z","abstract_excerpt":"Given a simple polygon $P$ consisting of $n$ vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside $P$, (ii) the weak visibility polygon of a line segment inside $P$ and (iii) the minimum link path between a pair of points inside $P$. For problem (i) two algorithms are proposed. The first one is an in-place algorithm where the input array may be lost. It uses only O(1) extra space apart from the input array. The second one assumes that the input is given in a read-only array, and it needs $O(\\sqrt{n})$ extra space. 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":"1204.2634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-12T07:07:33Z","cross_cats_sorted":[],"title_canon_sha256":"564fe725d42d1d5f2a986ada154116a8ecbbdff51b4286e45f882e0ccfc66dda","abstract_canon_sha256":"9e8cd5964029e0c95998e51a90abcf95a4a4578d007059a85987d1b75918f135"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:03.862303Z","signature_b64":"wQo5Ls62gevvTzfeYI6FS0eqUEGvNa9okTdGhaekZu20tiYcdVjhLp3ZqSEMuZ+/scYv8XpkG01i8c8L15V5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72dd8f1d68d80d681843cca28f3072a17e572217c9dafa4f88f68f50a1070bc2","last_reissued_at":"2026-05-18T03:58:03.861698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:03.861698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-efficient Algorithms for Visibility Problems in Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Minati De, Subhas C. Nandy","submitted_at":"2012-04-12T07:07:33Z","abstract_excerpt":"Given a simple polygon $P$ consisting of $n$ vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside $P$, (ii) the weak visibility polygon of a line segment inside $P$ and (iii) the minimum link path between a pair of points inside $P$. For problem (i) two algorithms are proposed. The first one is an in-place algorithm where the input array may be lost. It uses only O(1) extra space apart from the input array. The second one assumes that the input is given in a read-only array, and it needs $O(\\sqrt{n})$ extra space. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2634","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":"1204.2634","created_at":"2026-05-18T03:58:03.861799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2634v1","created_at":"2026-05-18T03:58:03.861799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2634","created_at":"2026-05-18T03:58:03.861799+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLOY6HLI3AGW","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLOY6HLI3AGWQGCD","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLOY6HLI","created_at":"2026-05-18T12:27:16.716162+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/OLOY6HLI3AGWQGCDZSRI6MDSUF","json":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF.json","graph_json":"https://pith.science/api/pith-number/OLOY6HLI3AGWQGCDZSRI6MDSUF/graph.json","events_json":"https://pith.science/api/pith-number/OLOY6HLI3AGWQGCDZSRI6MDSUF/events.json","paper":"https://pith.science/paper/OLOY6HLI"},"agent_actions":{"view_html":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF","download_json":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF.json","view_paper":"https://pith.science/paper/OLOY6HLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2634&json=true","fetch_graph":"https://pith.science/api/pith-number/OLOY6HLI3AGWQGCDZSRI6MDSUF/graph.json","fetch_events":"https://pith.science/api/pith-number/OLOY6HLI3AGWQGCDZSRI6MDSUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/action/storage_attestation","attest_author":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/action/author_attestation","sign_citation":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/action/citation_signature","submit_replication":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/action/replication_record"}},"created_at":"2026-05-18T03:58:03.861799+00:00","updated_at":"2026-05-18T03:58:03.861799+00:00"}