{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DSFJJTZNSFCOI7UNONLIVJLZNT","short_pith_number":"pith:DSFJJTZN","schema_version":"1.0","canonical_sha256":"1c8a94cf2d9144e47e8d73568aa5796cd044289b8765c6f1ee760749ac86c947","source":{"kind":"arxiv","id":"1803.10184","version":3},"attestation_state":"computed","paper":{"title":"A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Hamid Hoorfar","submitted_at":"2018-03-27T17:07:26Z","abstract_excerpt":"Given a simple polygon $ \\mathcal {P} $ of $ n $ vertices in the Plane. We study the problem of computing the visibility area from a given viewpoint $ q $ inside $ \\mathcal {P} $ where only sub-linear variables are allowed for working space. Without any memory-constrained, this problem was previously solved in $ O(n) $-time and $ O(n) $-variables space. In a newer research, the visibility area of a point be computed in $ O(n) $-time, using $ O(\\sqrt{n}) $ variables for working space. In this paper, we present an optimal-time algorithm, using $ O(c/\\log n) $ variables space for computing visibi"},"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":"1803.10184","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-27T17:07:26Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"e1c18e0ccdaf4c8d8915631aff124c4cdbfb4b80e2397691c61531651e22d005","abstract_canon_sha256":"a6d8a41287d99c9cf3c4e8f96fe4207c6169d52e1a40aec6c09bb99e2c0e1fd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:10.973646Z","signature_b64":"P6anwfBSqIG1AxOthiEvAxI3ewHJnKh2ORj28jQXLeWSVUCVe74t8A2pn2CGPSJLzzDjPp6QMsLDm/1epnMYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8a94cf2d9144e47e8d73568aa5796cd044289b8765c6f1ee760749ac86c947","last_reissued_at":"2026-05-18T00:19:10.973119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:10.973119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Hamid Hoorfar","submitted_at":"2018-03-27T17:07:26Z","abstract_excerpt":"Given a simple polygon $ \\mathcal {P} $ of $ n $ vertices in the Plane. We study the problem of computing the visibility area from a given viewpoint $ q $ inside $ \\mathcal {P} $ where only sub-linear variables are allowed for working space. Without any memory-constrained, this problem was previously solved in $ O(n) $-time and $ O(n) $-variables space. In a newer research, the visibility area of a point be computed in $ O(n) $-time, using $ O(\\sqrt{n}) $ variables for working space. In this paper, we present an optimal-time algorithm, using $ O(c/\\log n) $ variables space for computing visibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10184","kind":"arxiv","version":3},"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":"1803.10184","created_at":"2026-05-18T00:19:10.973212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10184v3","created_at":"2026-05-18T00:19:10.973212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10184","created_at":"2026-05-18T00:19:10.973212+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSFJJTZNSFCO","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSFJJTZNSFCOI7UN","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSFJJTZN","created_at":"2026-05-18T12:32:19.392346+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/DSFJJTZNSFCOI7UNONLIVJLZNT","json":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT.json","graph_json":"https://pith.science/api/pith-number/DSFJJTZNSFCOI7UNONLIVJLZNT/graph.json","events_json":"https://pith.science/api/pith-number/DSFJJTZNSFCOI7UNONLIVJLZNT/events.json","paper":"https://pith.science/paper/DSFJJTZN"},"agent_actions":{"view_html":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT","download_json":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT.json","view_paper":"https://pith.science/paper/DSFJJTZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10184&json=true","fetch_graph":"https://pith.science/api/pith-number/DSFJJTZNSFCOI7UNONLIVJLZNT/graph.json","fetch_events":"https://pith.science/api/pith-number/DSFJJTZNSFCOI7UNONLIVJLZNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/action/storage_attestation","attest_author":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/action/author_attestation","sign_citation":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/action/citation_signature","submit_replication":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/action/replication_record"}},"created_at":"2026-05-18T00:19:10.973212+00:00","updated_at":"2026-05-18T00:19:10.973212+00:00"}