{"id":"https://openalex.org/W2115754974","doi":"https://doi.org/10.1142/s0218195912500045","title":"OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE","display_name":"OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2115754974","doi":"https://doi.org/10.1142/s0218195912500045","mag":"2115754974"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195912500045","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195912500045","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"MARK DE BERG","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, P. O. Box 513, 5600 MB, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, P. O. Box 513, 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031200844","display_name":"Amirali Khosravi","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"AMIRALI KHOSRAVI","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, P. O. Box 513, 5600 MB, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, P. O. Box 513, 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":7.2428,"has_fulltext":false,"cited_by_count":101,"citation_normalized_percentile":{"value":0.96731275,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"22","issue":"03","first_page":"187","last_page":"205"},"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.9983999729156494,"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.9983999729156494,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9918000102043152,"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/mathematics","display_name":"Mathematics","score":0.8194438219070435},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8112269043922424},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.80706787109375},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7877140045166016},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.6030223965644836},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5428197383880615},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5371981263160706},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5119401216506958},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.504949152469635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3736974596977234},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11426028609275818},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11022627353668213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09894317388534546}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8194438219070435},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8112269043922424},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.80706787109375},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7877140045166016},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.6030223965644836},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5428197383880615},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5371981263160706},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5119401216506958},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.504949152469635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3736974596977234},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11426028609275818},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11022627353668213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09894317388534546},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0218195912500045","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195912500045","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/daded458-ce11-4454-a518-388a3723035f","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/daded458-ce11-4454-a518-388a3723035f","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, M D & Khosravi, A 2012, 'Optimal Binary Space Partitions for Segments in the Plane', International Journal of Computational Geometry and Applications, vol. 22, no. 3, pp. 187-206. https://doi.org/10.1142/S0218195912500045","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/0126021f-a048-48a0-a51d-90d395f25946","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/0126021f-a048-48a0-a51d-90d395f25946","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M T & Khosravi, A 2012, 'Optimal binary space partitions in the plane', International Journal of Computational Geometry and Applications, vol. 22, no. 3, pp. 187-205. https://doi.org/10.1142/S0218195912500045","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/0126021f-a048-48a0-a51d-90d395f25946","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/0126021f-a048-48a0-a51d-90d395f25946","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Geometry and Applications, 22(3), 187 - 205. World Scientific","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W284308051","https://openalex.org/W1523915190","https://openalex.org/W1792351262","https://openalex.org/W1983698126","https://openalex.org/W1994432275","https://openalex.org/W2011039300","https://openalex.org/W2055347069","https://openalex.org/W2062612774","https://openalex.org/W2066577300","https://openalex.org/W2081363139","https://openalex.org/W2081850681","https://openalex.org/W2120039945","https://openalex.org/W2121601978","https://openalex.org/W2149906774","https://openalex.org/W2246160851","https://openalex.org/W2899517269","https://openalex.org/W4235438453","https://openalex.org/W4251391716","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2015634066","https://openalex.org/W2048339306","https://openalex.org/W2028295504","https://openalex.org/W3046629113","https://openalex.org/W2019903130","https://openalex.org/W2011903683","https://openalex.org/W1519914687","https://openalex.org/W2182952931","https://openalex.org/W122487145","https://openalex.org/W1557097679"],"abstract_inverted_index":{"An":[0,113],"optimal":[1,28,114,127],"BSP":[2,16,116,129],"for":[3,17,30,130],"a":[4,15,47,83,98],"set":[5,48,100,133],"S":[6,18],"of":[7,24,33,49,72,101,134],"disjoint":[8],"line":[9],"segments":[10,102],"in":[11,37,51],"the":[12,21,38,52,87,131],"plane":[13],"is":[14,93],"that":[19,41,106],"produces":[20],"minimum":[22],"number":[23],"cuts.":[25,111],"We":[26,85],"study":[27],"BSPs":[29,57,64],"three":[31],"classes":[32],"BSPs,":[34],"which":[35],"differ":[36],"splitting":[39,61,68,80],"lines":[40,69,81],"can":[42,58,65,77],"be":[43],"used":[44],"when":[45],"partitioning":[46,54],"fragments":[50],"recursive":[53],"process:":[55],"free":[56,128],"use":[59,67,79],"any":[60,110],"line,":[62],"restricted":[63,115],"only":[66,78],"through":[70],"pairs":[71],"fragment":[73],"endpoints,":[74],"and":[75],"auto-partitions":[76],"containing":[82],"fragment.":[84],"obtain":[86],"following":[88],"two":[89],"results:":[90],"\u2022":[91,112],"It":[92],"NP-hard":[94],"to":[95],"decide":[96],"whether":[97],"given":[99],"admits":[103],"an":[104,126],"auto-partition":[105],"does":[107],"not":[108],"make":[109],"makes":[117],"at":[118],"most":[119],"2":[120],"times":[121],"as":[122,125],"many":[123],"cuts":[124],"same":[132],"segments.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-14T08:43:22.919905","created_date":"2016-06-24T00:00:00"}