{"id":"https://openalex.org/W2067187253","doi":"https://doi.org/10.1016/s0304-3975(96)00024-2","title":"A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon","display_name":"A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2067187253","doi":"https://doi.org/10.1016/s0304-3975(96)00024-2","mag":"2067187253"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(96)00024-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00024-2","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397596000242/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0304397596000242/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023910624","display_name":"Piotr Berman","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Piotr Berman","raw_affiliation_strings":["Department of Computer Science, Pennsylvania State University, University Park, PA 16802, USA","[Penn State University, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Pennsylvania State University, University Park, PA 16802, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"[Penn State University, USA]","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden","Lund Univ., Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ., Sweden#TAB#","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023910624"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.17929117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"174","issue":"1-2","first_page":"193","last_page":"202"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9973999857902527,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.7452908158302307},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.709938108921051},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.6414297819137573},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.6269723176956177},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5838640928268433},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5557641983032227},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5393630266189575},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5363767147064209},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5263988971710205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4928129017353058},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.49034571647644043},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4858686327934265},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4662875831127167},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4463273882865906},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.4393176734447479},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41682541370391846},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.4106740951538086},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.36799484491348267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.334530234336853},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1214492917060852},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06822246313095093}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.7452908158302307},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.709938108921051},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6414297819137573},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.6269723176956177},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5838640928268433},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5557641983032227},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5393630266189575},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5363767147064209},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5263988971710205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4928129017353058},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.49034571647644043},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4858686327934265},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4662875831127167},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4463273882865906},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.4393176734447479},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41682541370391846},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.4106740951538086},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.36799484491348267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.334530234336853},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1214492917060852},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06822246313095093},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(96)00024-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00024-2","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397596000242/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s0304-3975(96)00024-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00024-2","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397596000242/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2067187253.pdf","grobid_xml":"https://content.openalex.org/works/W2067187253.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W16335429","https://openalex.org/W1584086289","https://openalex.org/W1596296817","https://openalex.org/W1843774033","https://openalex.org/W1885878332","https://openalex.org/W1965333879","https://openalex.org/W1970758273","https://openalex.org/W2008336875","https://openalex.org/W2022266599","https://openalex.org/W2023518480","https://openalex.org/W2052165970","https://openalex.org/W2052393177","https://openalex.org/W2058432138","https://openalex.org/W2067631433","https://openalex.org/W2074863496","https://openalex.org/W2081385108","https://openalex.org/W2102902634","https://openalex.org/W2104717694","https://openalex.org/W2116179136","https://openalex.org/W2132750992","https://openalex.org/W2142278387","https://openalex.org/W2156742832","https://openalex.org/W2162050448","https://openalex.org/W3041834803","https://openalex.org/W4300640952","https://openalex.org/W6634962901","https://openalex.org/W6639402417","https://openalex.org/W6642948470","https://openalex.org/W6652367822","https://openalex.org/W6663901979","https://openalex.org/W6665020187","https://openalex.org/W6675632545","https://openalex.org/W6675751366","https://openalex.org/W6677467682","https://openalex.org/W6780475912","https://openalex.org/W6845151110"],"related_works":["https://openalex.org/W2104304525","https://openalex.org/W2981019968","https://openalex.org/W255996094","https://openalex.org/W1991526295","https://openalex.org/W2359739147","https://openalex.org/W2074863496","https://openalex.org/W2155697686","https://openalex.org/W2138200290","https://openalex.org/W1559411751","https://openalex.org/W2067187253"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-02T14:50:37.381335","created_date":"2025-10-10T00:00:00"}