{"id":"https://openalex.org/W2141807613","doi":"https://doi.org/10.1145/1824777.1824792","title":"Finding equitable convex partitions of points in a polygon efficiently","display_name":"Finding equitable convex partitions of points in a polygon efficiently","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2141807613","doi":"https://doi.org/10.1145/1824777.1824792","mag":"2141807613"},"language":"en","primary_location":{"id":"doi:10.1145/1824777.1824792","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1824777.1824792","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5037655025","display_name":"John Gunnar Carlsson","orcid":"https://orcid.org/0000-0001-5346-8529"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John Gunnar Carlsson","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081046311","display_name":"Benjamin Armbruster","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Armbruster","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041526408","display_name":"Yinyu Ye","orcid":"https://orcid.org/0009-0001-3239-2622"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinyu Ye","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037655025"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":9.0415,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.97468251,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"6","issue":"4","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9940000176429749,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9940000176429749,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9912999868392944,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9801999926567078,"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/combinatorics","display_name":"Combinatorics","score":0.8031611442565918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6910986304283142},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6730680465698242},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.6370781660079956},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6083106994628906},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.559834361076355},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5570253729820251},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5237105488777161},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.4624827802181244},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4337537884712219},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.412204772233963},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.39961302280426025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38347330689430237},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.31392279267311096},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29963749647140503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1828872561454773},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09292402863502502}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8031611442565918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6910986304283142},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6730680465698242},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.6370781660079956},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6083106994628906},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.559834361076355},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5570253729820251},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5237105488777161},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.4624827802181244},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4337537884712219},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.412204772233963},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.39961302280426025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38347330689430237},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.31392279267311096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29963749647140503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1828872561454773},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09292402863502502},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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":2,"locations":[{"id":"doi:10.1145/1824777.1824792","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1824777.1824792","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.8401","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.8401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~yyye/regionpartitiontalg.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1504772356","https://openalex.org/W1529211414","https://openalex.org/W1604502570","https://openalex.org/W1944868676","https://openalex.org/W1973937174","https://openalex.org/W2011241408","https://openalex.org/W2014068360","https://openalex.org/W2023414931","https://openalex.org/W2029565994","https://openalex.org/W2061274508","https://openalex.org/W2072697104","https://openalex.org/W2092399768","https://openalex.org/W2120260120","https://openalex.org/W2138967774","https://openalex.org/W2140047299","https://openalex.org/W2177771107","https://openalex.org/W2329928852","https://openalex.org/W2914932700"],"related_works":["https://openalex.org/W2386609369","https://openalex.org/W4297909578","https://openalex.org/W66858739","https://openalex.org/W2810915225","https://openalex.org/W2050284373","https://openalex.org/W4285782227","https://openalex.org/W2007295274","https://openalex.org/W2369456590","https://openalex.org/W2462884115","https://openalex.org/W2359739147"],"abstract_inverted_index":{"Previous":[0],"work":[1],"has":[2],"developed":[3],"algorithms":[4,63],"for":[5,64,73],"finding":[6],"an":[7,21,49,88],"equitable":[8,76],"convex":[9,17,57,77],"partition":[10,78],"that":[11,86],"partitions":[12],"the":[13,53,66,108,113,120,128],"plane":[14],"into":[15],"n":[16,98,106,125],"pieces":[18],"each":[19,42],"containing":[20],"equal":[22,50],"number":[23,109,114],"of":[24,52,55,110,115,119],"red":[25],"and":[26,48,122],"blue":[27],"points.":[28],"Motivated":[29],"by":[30],"a":[31,38,83],"vehicle":[32],"routing":[33],"heuristic,":[34],"we":[35,81],"look":[36],"at":[37],"related":[39],"problem":[40,68,93],"where":[41,105],"piece":[43],"must":[44],"contain":[45],"one":[46],"point":[47],"fraction":[51],"area":[54],"some":[56],"polygon.":[58],"We":[59],"first":[60],"show":[61],"how":[62],"solving":[65],"older":[67],"lead":[69],"to":[70,91],"approximate":[71],"solutions":[72],"this":[74],"new":[75,84],"problem.":[79],"Then":[80],"demonstrate":[82],"algorithm":[85],"finds":[87],"exact":[89],"solution":[90],"our":[92],"in":[94],"O":[95],"(":[96],"N":[97,100,123],"log":[99],")":[101],"time":[102],"or":[103,117],"operations,":[104],"is":[107],"points,":[111],"m":[112,127],"vertices":[116],"edges":[118],"polygon,":[121],":=":[124],"+":[126],"sum.":[129]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}