{"id":"https://openalex.org/W7160405493","doi":"https://doi.org/10.48550/arxiv.2605.03334","title":"Visibility Queries in Simple Polygons","display_name":"Visibility Queries in Simple Polygons","publication_year":2026,"publication_date":"2026-05-05","ids":{"openalex":"https://openalex.org/W7160405493","doi":"https://doi.org/10.48550/arxiv.2605.03334"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.33","is_oa":true,"landing_page_url":"https://www.researchgate.net/publication/282763094_Point_visibility_computing_in_polygons_with_holes","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.researchgate.net/publication/282763094_Point_visibility_computing_in_polygons_with_holes","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135479633","display_name":"Sujoy Bhore","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bhore, Sujoy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008771140","display_name":"Chih-Hung Liu","orcid":"https://orcid.org/0000-0001-9683-5982"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Chih-Hung","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055963596","display_name":"Anurag Murty Naredla","orcid":"https://orcid.org/0000-0002-3577-903X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Naredla, Anurag Murty","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050513868","display_name":"Yakov Nekrich","orcid":"https://orcid.org/0000-0003-3771-5088"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nekrich, Yakov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135462953","display_name":"Eunjin Oh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oh, Eunjin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042432858","display_name":"Andr\u00e9 van Renssen","orcid":"https://orcid.org/0000-0002-9294-9947"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van Renssen, Andr\u00e9","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135496854","display_name":"Frank Staals","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Staals, Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135425994","display_name":"Haitao Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Haitao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135534563","display_name":"Jie Xue","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xue, Jie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9514999985694885,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9514999985694885,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.017000000923871994,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.00570000009611249,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/visibility-polygon","display_name":"Visibility polygon","score":0.8335000276565552},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.7771999835968018},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6557000279426575},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.578499972820282},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5407999753952026},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.49300000071525574},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4661000072956085},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.38429999351501465}],"concepts":[{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.8335000276565552},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.7771999835968018},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6557000279426575},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.578499972820282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5745999813079834},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5407999753952026},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.49300000071525574},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4661000072956085},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.38429999351501465},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36959999799728394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3695000112056732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3684999942779541},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.36010000109672546},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.32269999384880066},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.29750001430511475},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2775000035762787}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.icalp.2026.33","is_oa":true,"landing_page_url":"https://www.researchgate.net/publication/282763094_Point_visibility_computing_in_polygons_with_holes","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2605.03334","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03334","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.33","is_oa":true,"landing_page_url":"https://www.researchgate.net/publication/282763094_Point_visibility_computing_in_polygons_with_holes","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,14,66,148,182,215],"simple":[2,220],"polygon":[3,30,51,132],"$P$":[4],"with":[5],"$n$":[6],"vertices,":[7],"we":[8,64,180,198,213],"consider":[9],"the":[10,28,46,49,54,80,90,118,125,130,168,176],"problem":[11],"of":[12,31,48,52,178,185,225],"constructing":[13],"data":[15,68,138,149,183],"structure":[16,69,139,150,184],"for":[17,20,74,167,218],"visibility":[18,29,50,131,158],"queries:":[19],"any":[21,75],"query":[22,41,82,99,195,204],"point":[23],"$q":[24],"\\in":[25],"P$,":[26],"compute":[27],"$q$":[32,173],"in":[33,160,171],"$P$.":[34],"To":[35,209],"obtain":[36],"$O(\\log":[37,105,200],"n":[38,96,106,109,192,201],"+":[39,97,110,162,193,202],"k)$":[40,98,111,163,194,203],"time,":[42],"where":[43],"$k$":[44],"is":[45,88,135],"size":[47],"$q$,":[53],"previous":[55],"best":[56,91],"result":[57,93],"requires":[58],"$O(n^3)$":[59],"space.":[60,208],"In":[61,165],"this":[62,103],"paper,":[63],"propose":[65,214],"new":[67,216],"that":[70,128,140,156],"uses":[71],"$O(n^{2+\u03b5})$":[72],"space,":[73,117],"$\u03b5>":[76],"0$,":[77],"while":[78],"achieving":[79],"same":[81],"time.":[83,100,112,164],"If":[84],"only":[85,119],"$O(n^2)$":[86],"space":[87,155,189],"available,":[89],"known":[92,121],"provides":[94],"$O(\\log^2":[95,191],"We":[101,146],"improve":[102],"to":[104,115],"\\log":[107,108,143,153,187],"When":[113],"restricted":[114],"$o(n^2)$":[116],"previously":[120],"approach,":[122],"aside":[123],"from":[124],"$O(n)$-time":[126],"algorithm":[127],"computes":[129],"without":[133],"preprocessing,":[134],"an":[136],"$O(n)$-space":[137],"supports":[141],"$O(k":[142],"n)$-time":[144],"queries.":[145],"construct":[147],"using":[151,206],"$O(n":[152,186],"n)$":[154,188],"answers":[157],"queries":[159],"$O(n^{1/2+\u03b5}":[161],"addition,":[166],"special":[169],"case":[170],"which":[172,222],"lies":[174],"on":[175],"boundary":[177],"$P$,":[179],"build":[181],"supporting":[190],"time;":[196],"alternatively,":[197],"achieve":[199,210],"time":[205],"$O(n^{1+\u03b5})$":[207],"our":[211],"results,":[212],"method":[217],"decomposing":[219],"polygons,":[221],"may":[223],"be":[224],"independent":[226],"interest.":[227]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-07T00:00:00"}