{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PUR4KH4OT2LRBXD3QWOVWLBNEB","short_pith_number":"pith:PUR4KH4O","schema_version":"1.0","canonical_sha256":"7d23c51f8e9e9710dc7b859d5b2c2d20547dfb319e5e3203e7b3eb90546e8bca","source":{"kind":"arxiv","id":"1310.7197","version":1},"attestation_state":"computed","paper":{"title":"Weak Visibility Queries of Line Segments in Simple Polygons and Polygonal Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mohammad Ghodsi, Mojtaba Nouri Bygi","submitted_at":"2013-10-27T14:10:05Z","abstract_excerpt":"In this paper we consider the problem of computing the weak visibility polygon of any query line segment $pq$ (or $WVP(pq)$) inside a given polygon $P$. Our first non-trivial algorithm runs in simple polygons and needs $O(n^3 \\log n)$ time and $O(n^3)$ space in the preprocessing phase to report $WVP(pq)$ of any query line segment $pq$ in time $O(\\log n + |WVP(pq)|)$. We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices. Our algorithm needs $O(n^2 \\log n)$ time"},"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":"1310.7197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-27T14:10:05Z","cross_cats_sorted":[],"title_canon_sha256":"02226364c0a0260b2c4feb5b6b49e05f358321c4f4bd8dbaf5d20bfc80cf540f","abstract_canon_sha256":"352053a72b16710ca62235818505dd5b6419224772f42856bdb1d79b0e15c146"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:45.978371Z","signature_b64":"KyodYepsLEPXnbVmDJrixNggTr5VS1jwBVAxfBH5srIYlaozk7G54RntNh08fH8thFYhe/7sB/2Q68SZAZ40Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d23c51f8e9e9710dc7b859d5b2c2d20547dfb319e5e3203e7b3eb90546e8bca","last_reissued_at":"2026-05-18T03:08:45.977523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:45.977523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak Visibility Queries of Line Segments in Simple Polygons and Polygonal Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mohammad Ghodsi, Mojtaba Nouri Bygi","submitted_at":"2013-10-27T14:10:05Z","abstract_excerpt":"In this paper we consider the problem of computing the weak visibility polygon of any query line segment $pq$ (or $WVP(pq)$) inside a given polygon $P$. Our first non-trivial algorithm runs in simple polygons and needs $O(n^3 \\log n)$ time and $O(n^3)$ space in the preprocessing phase to report $WVP(pq)$ of any query line segment $pq$ in time $O(\\log n + |WVP(pq)|)$. We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices. Our algorithm needs $O(n^2 \\log n)$ time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7197","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":"1310.7197","created_at":"2026-05-18T03:08:45.977666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7197v1","created_at":"2026-05-18T03:08:45.977666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7197","created_at":"2026-05-18T03:08:45.977666+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUR4KH4OT2LR","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUR4KH4OT2LRBXD3","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUR4KH4O","created_at":"2026-05-18T12:27:57.521954+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/PUR4KH4OT2LRBXD3QWOVWLBNEB","json":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB.json","graph_json":"https://pith.science/api/pith-number/PUR4KH4OT2LRBXD3QWOVWLBNEB/graph.json","events_json":"https://pith.science/api/pith-number/PUR4KH4OT2LRBXD3QWOVWLBNEB/events.json","paper":"https://pith.science/paper/PUR4KH4O"},"agent_actions":{"view_html":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB","download_json":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB.json","view_paper":"https://pith.science/paper/PUR4KH4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7197&json=true","fetch_graph":"https://pith.science/api/pith-number/PUR4KH4OT2LRBXD3QWOVWLBNEB/graph.json","fetch_events":"https://pith.science/api/pith-number/PUR4KH4OT2LRBXD3QWOVWLBNEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB/action/storage_attestation","attest_author":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB/action/author_attestation","sign_citation":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB/action/citation_signature","submit_replication":"https://pith.science/pith/PUR4KH4OT2LRBXD3QWOVWLBNEB/action/replication_record"}},"created_at":"2026-05-18T03:08:45.977666+00:00","updated_at":"2026-05-18T03:08:45.977666+00:00"}