{"id":"https://openalex.org/W2045155153","doi":"https://doi.org/10.1137/0213031","title":"Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm","display_name":"Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm","publication_year":1984,"publication_date":"1984-08-01","ids":{"openalex":"https://openalex.org/W2045155153","doi":"https://doi.org/10.1137/0213031","mag":"2045155153"},"language":"en","primary_location":{"id":"doi:10.1137/0213031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213031","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5044565966","display_name":"Bernard Chazelle","orcid":"https://orcid.org/0000-0001-8542-0247"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bernard Chazelle","raw_affiliation_strings":["Brown University, Providence, RI,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044565966"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":2.4971,"has_fulltext":false,"cited_by_count":241,"citation_normalized_percentile":{"value":0.87820513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"13","issue":"3","first_page":"488","last_page":"507"},"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.9998000264167786,"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.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.9199213981628418},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6499779224395752},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6152747869491577},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6117965579032898},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.5506071448326111},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5304524302482605},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5004708766937256},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4835681617259979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.447539746761322},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4362577795982361},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4267498850822449},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.30248749256134033},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.30019575357437134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21640068292617798},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08578330278396606}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.9199213981628418},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6499779224395752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6152747869491577},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6117965579032898},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.5506071448326111},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5304524302482605},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5004708766937256},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4835681617259979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.447539746761322},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4362577795982361},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4267498850822449},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.30248749256134033},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.30019575357437134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21640068292617798},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08578330278396606},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0213031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213031","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.5307","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.5307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~chazelle/pubs/ConvexPartitionPolyhedra.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308380","display_name":"Yale University","ror":"https://ror.org/03v76x132"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1566622904","https://openalex.org/W1570973162","https://openalex.org/W1586803947","https://openalex.org/W1972926733","https://openalex.org/W1981988453","https://openalex.org/W1983487792","https://openalex.org/W2032895458","https://openalex.org/W2041603746","https://openalex.org/W2068376033"],"related_works":["https://openalex.org/W4248823117","https://openalex.org/W2334849780","https://openalex.org/W2004058166","https://openalex.org/W2030718493","https://openalex.org/W2018708907","https://openalex.org/W2103429114","https://openalex.org/W2005538657","https://openalex.org/W2088151573","https://openalex.org/W2004897847","https://openalex.org/W2469464399"],"abstract_inverted_index":{"The":[0,53],"problem":[1],"of":[2,10,28,40,47,60,68],"partitioning":[3],"a":[4,7,21,38,44],"polyhedron":[5,62],"into":[6],"minimum":[8],"number":[9,39,67],"convex":[11,41],"pieces":[12],"is":[13,55,85],"known":[14],"to":[15],"be":[16],"NP-hard.":[17],"We":[18],"establish":[19],"here":[20],"quadratic":[22],"lower":[23],"bound":[24],"on":[25],"the":[26,50,58,61,66,76,81,83],"complexity":[27],"this":[29],"problem,":[30],"and":[31,63],"we":[32],"describe":[33],"an":[34],"algorithm":[35,54,84],"that":[36],"produces":[37],"parts":[42],"within":[43],"constant":[45],"factor":[46],"optimal":[48],"in":[49,57,65,72,87],"worst":[51],"case.":[52],"linear":[56],"size":[59],"cubic":[64],"reflex":[69],"angles.":[70],"Since":[71],"most":[73],"applications":[74],"areas,":[75],"former":[77],"quantity":[78],"greatly":[79],"exceeds":[80],"latter,":[82],"viable":[86],"practice.":[88]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":9}],"updated_date":"2026-05-09T13:55:54.758798","created_date":"2025-10-10T00:00:00"}