{"id":"https://openalex.org/W2007986693","doi":"https://doi.org/10.1137/0215022","title":"Computing the Largest Empty Rectangle","display_name":"Computing the Largest Empty Rectangle","publication_year":1986,"publication_date":"1986-02-01","ids":{"openalex":"https://openalex.org/W2007986693","doi":"https://doi.org/10.1137/0215022","mag":"2007986693"},"language":"en","primary_location":{"id":"doi:10.1137/0215022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215022","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/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Chazelle","raw_affiliation_strings":["Brown University"],"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103488244","display_name":"Robert L. Scot Drysdale","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. L. Drysdale","raw_affiliation_strings":["Brown University"],"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062453674","display_name":"D. T. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. T. Lee","raw_affiliation_strings":["Brown University"],"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044565966"],"corresponding_institution_ids":["https://openalex.org/I175594653"],"apc_list":null,"apc_paid":null,"fwci":3.1779,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.90353261,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"1","first_page":"300","last_page":"315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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/rectangle","display_name":"Rectangle","score":0.9343664646148682},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.8270353078842163},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6797641515731812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5716061592102051},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5418558716773987},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5280067920684814},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5179352164268494},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48394066095352173},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.48368459939956665},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44314077496528625},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.43748223781585693},{"id":"https://openalex.org/keywords/diagram","display_name":"Diagram","score":0.42066699266433716},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3966541290283203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36855173110961914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30718326568603516},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15601608157157898}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.9343664646148682},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8270353078842163},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6797641515731812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5716061592102051},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5418558716773987},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5280067920684814},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5179352164268494},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48394066095352173},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.48368459939956665},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44314077496528625},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43748223781585693},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.42066699266433716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3966541290283203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36855173110961914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30718326568603516},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15601608157157898},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215022","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6292257493","display_name":"Studies in Locations, Allocations, and Placements","funder_award_id":"8121741","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7714949260","display_name":"Concrete Computational Complexity (Computer Research)","funder_award_id":"8202359","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1822595813","https://openalex.org/W1992268357","https://openalex.org/W2007610503","https://openalex.org/W2015751084","https://openalex.org/W2035622528","https://openalex.org/W2048422125","https://openalex.org/W2091757707","https://openalex.org/W2126876121","https://openalex.org/W2142337286","https://openalex.org/W2989713547"],"related_works":["https://openalex.org/W1772844689","https://openalex.org/W1532020578","https://openalex.org/W2908074373","https://openalex.org/W1510008813","https://openalex.org/W2962789953","https://openalex.org/W4250008887","https://openalex.org/W2189603398","https://openalex.org/W1492333335","https://openalex.org/W2042426695","https://openalex.org/W1588722399"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,12,22,29,33,44,52,98],"following":[3],"problem:":[4],"Given":[5],"a":[6,36,93,106,114,125],"rectangle":[7,24,34],"containing":[8],"N":[9],"points,":[10],"find":[11],"largest":[13],"area":[14],"subrectangle":[15],"with":[16,113],"sides":[17],"parallel":[18],"to":[19,87,97],"those":[20],"of":[21,28,38,109,119,124],"original":[23],"which":[25,56],"contains":[26],"none":[27],"given":[30],"points.":[31],"If":[32],"is":[35,50],"piece":[37,55],"fabric":[39],"or":[40],"sheet":[41],"metal":[42],"and":[43,69,104],"points":[45],"are":[46],"flaws,":[47],"this":[48,89],"problem":[49],"finding":[51],"largest-area":[53],"rectangular":[54],"can":[57],"be":[58],"salvaged.":[59],"A":[60],"previously":[61],"known":[62],"result":[63],"[13]":[64],"takes":[65],"$O(N^2":[66],")$":[67],"worst-case":[68],"$O(N\\log":[70,79,83],"^2":[71],"N)$":[72,81,84],"expected":[73],"time.":[74],"This":[75],"paper":[76],"presents":[77],"an":[78],"^3":[80],"time,":[82],"space":[85],"algorithm":[86],"solve":[88],"problem.":[90],"It":[91],"uses":[92],"divide-and-conquer":[94],"approach":[95],"similar":[96],"ones":[99],"used":[100],"by":[101],"Bentley":[102],"[1]":[103],"introduces":[105],"new":[107],"notion":[108],"Voronoi":[110],"diagram":[111],"along":[112],"method":[115],"for":[116],"efficient":[117],"computation":[118],"certain":[120],"functions":[121],"over":[122],"paths":[123],"tree.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}