{"id":"https://openalex.org/W4415945633","doi":"https://doi.org/10.1145/3798129.3800745","title":"NP-Membership for the Boundary-Boundary Art-Gallery Problem","display_name":"NP-Membership for the Boundary-Boundary Art-Gallery Problem","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4415945633","doi":"https://doi.org/10.1145/3798129.3800745"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800745","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800745","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800745","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jack Stade","orcid":"https://orcid.org/0009-0007-9153-6589"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Jack Stade","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0009-0007-9153-6589","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02801627,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"256","last_page":"267"},"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.6363000273704529,"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.6363000273704529,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.18960000574588776,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.02500000037252903,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6668000221252441},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5521000027656555},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5516999959945679},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4884999990463257},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4242999851703644},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.41670000553131104},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.3336000144481659}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6721000075340271},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6668000221252441},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5521000027656555},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5516999959945679},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4884999990463257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4575999975204468},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.41670000553131104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3765000104904175},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3336000144481659},{"id":"https://openalex.org/C94931360","wikidata":"https://www.wikidata.org/wiki/Q607728","display_name":"Irrational number","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.28110000491142273},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.26249998807907104},{"id":"https://openalex.org/C148864181","wikidata":"https://www.wikidata.org/wiki/Q4949969","display_name":"Boundary problem","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800745","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800745","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2511.01562","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.01562","pdf_url":"https://arxiv.org/pdf/2511.01562","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},{"id":"doi:10.48550/arxiv.2511.01562","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.01562","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800745","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800745","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"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":{"The":[0],"boundary-boundary":[1],"art-gallery":[2,71],"problem":[3],"asks,":[4],"given":[5],"a":[6,13,52,90],"polygon":[7,79],"P":[8,25],"representing":[9],"an":[10],"art-gallery,":[11],"for":[12,43,93],"minimal":[14],"set":[15],"of":[16,24,28,59],"guards":[17,34,61],"that":[18,62,69],"can":[19,80],"see":[20],"the":[21,29,33,39,47,60,78],"entire":[22],"boundary":[23],"(the":[26],"wall":[27],"art":[30],"gallery),":[31],"where":[32,98],"must":[35],"be":[36,51],"placed":[37],"on":[38,46],"boundary.":[40],"That":[41],"is,":[42],"each":[44,99],"point":[45],"boundary,":[48],"there":[49],"should":[50],"line":[53],"segment":[54],"connecting":[55],"it":[56],"to":[57,85],"one":[58],"is":[63,73],"contained":[64],"in":[65,74],"P.":[66],"We":[67],"show":[68],"this":[70],"variant":[72],"NP,":[75],"even":[76],"if":[77],"have":[81],"holes.":[82],"In":[83],"order":[84],"prove":[86],"this,":[87],"we":[88],"develop":[89],"constraint-propagation":[91],"procedure":[92],"continuous":[94],"constraint":[95,100],"satisfaction":[96],"problems":[97],"involves":[101],"at":[102],"most":[103],"2":[104],"variables.":[105]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-06T00:00:00"}