{"id":"https://openalex.org/W1981988453","doi":"https://doi.org/10.1109/tit.1983.1056648","title":"Some NP-hard polygon decomposition problems","display_name":"Some NP-hard polygon decomposition problems","publication_year":1983,"publication_date":"1983-03-01","ids":{"openalex":"https://openalex.org/W1981988453","doi":"https://doi.org/10.1109/tit.1983.1056648","mag":"1981988453"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056648","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025667097","display_name":"Joseph O\u2019Rourke","orcid":"https://orcid.org/0000-0001-5844-506X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. O'Rourke","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047833204","display_name":"Kenneth J. Supowit","orcid":null},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Supowit","raw_affiliation_strings":["Computer Research Center, Hewlett Packard Laboratories, Palo Alto, CA, USA","[Computer Research Center, Hewlett Packard Laboratories, Palo Alto, CA, USA]"],"affiliations":[{"raw_affiliation_string":"Computer Research Center, Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"[Computer Research Center, Hewlett Packard Laboratories, Palo Alto, CA, USA]","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025667097"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.7452,"has_fulltext":false,"cited_by_count":201,"citation_normalized_percentile":{"value":0.98067463,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"29","issue":"2","first_page":"181","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987000226974487,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9742000102996826,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6028516292572021},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5730459690093994},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5275366306304932},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.515091598033905},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5113591551780701},{"id":"https://openalex.org/keywords/visibility-polygon","display_name":"Visibility polygon","score":0.47423216700553894},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.47000652551651},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.46898016333580017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46841397881507874},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.4553029239177704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.453754186630249},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.44479554891586304},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4424094557762146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.440967857837677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38895341753959656},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36616113781929016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3578881025314331},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10074079036712646}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6028516292572021},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5730459690093994},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5275366306304932},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.515091598033905},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5113591551780701},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.47423216700553894},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.47000652551651},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.46898016333580017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46841397881507874},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.4553029239177704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.453754186630249},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.44479554891586304},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4424094557762146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.440967857837677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38895341753959656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36616113781929016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3578881025314331},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10074079036712646},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1983.1056648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056648","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322651","display_name":"Consiglio Nazionale delle Ricerche","ror":"https://ror.org/04zaypm56"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W59390568","https://openalex.org/W90153133","https://openalex.org/W113434742","https://openalex.org/W563645182","https://openalex.org/W1530383550","https://openalex.org/W1566622904","https://openalex.org/W1586803947","https://openalex.org/W1966955703","https://openalex.org/W1978186063","https://openalex.org/W1982182450","https://openalex.org/W1987179556","https://openalex.org/W1994072439","https://openalex.org/W2004317960","https://openalex.org/W2013451793","https://openalex.org/W2024644834","https://openalex.org/W2035143052","https://openalex.org/W2035539885","https://openalex.org/W2038280788","https://openalex.org/W2042628505","https://openalex.org/W2045783875","https://openalex.org/W2047940848","https://openalex.org/W2058211699","https://openalex.org/W2066577300","https://openalex.org/W2081519360","https://openalex.org/W2087422927","https://openalex.org/W2104846262","https://openalex.org/W2167395108","https://openalex.org/W2401610261","https://openalex.org/W2981843604","https://openalex.org/W3160897418","https://openalex.org/W4244027514","https://openalex.org/W4246663137","https://openalex.org/W4300527817","https://openalex.org/W6684751117","https://openalex.org/W6769464556"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W3016304894","https://openalex.org/W3082218119","https://openalex.org/W3198334079","https://openalex.org/W2086913577","https://openalex.org/W2108250208","https://openalex.org/W3194730801","https://openalex.org/W4323658982","https://openalex.org/W2136318972","https://openalex.org/W1963624385"],"abstract_inverted_index":{"The":[0,47,74],"inherent":[1],"computational":[2,18],"complexity":[3],"of":[4,9,17,21,54],"polygon":[5,32],"decomposition":[6,33],"problems":[7,34,48,88],"is":[8],"theoretical":[10],"interest":[11,23],"to":[12,24,37,43,50,71],"researchers":[13],"in":[14,27],"the":[15,68],"field":[16],"geometry":[19],"and":[20,40],"practical":[22],"those":[25],"working":[26],"syntactic":[28],"pattern":[29],"recognition.":[30],"Three":[31],"are":[35,49,76,89],"shown":[36],"be":[38],"NP-hard":[39],"thus":[41],"unlikely":[42],"admit":[44],"efficient":[45],"algorithms.":[46],"find":[51],"minimum":[52],"decompositions":[53],"a":[55,82],"polygonal":[56,69],"region":[57,70],"into":[58],"(perhaps":[59],"overlapping)":[60],"convex,":[61],"star-shaped,":[62],"or":[63],"spiral":[64],"subsets.":[65],"We":[66],"permit":[67],"contain":[72],"holes.":[73],"proofs":[75],"by":[77],"transformation":[78],"from":[79],"Boolean":[80],"three-satisfiability,":[81],"known":[83],"NP-complete":[84],"problem.":[85],"Several":[86],"open":[87],"discussed.":[90]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":8}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}