{"id":"https://openalex.org/W1992000713","doi":"https://doi.org/10.1007/bf01758749","title":"Optimal parallel algorithms for point-set and polygon problems","display_name":"Optimal parallel algorithms for point-set and polygon problems","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W1992000713","doi":"https://doi.org/10.1007/bf01758749","mag":"1992000713"},"language":"en","primary_location":{"id":"doi:10.1007/bf01758749","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01758749","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5042866153","display_name":"Richard Cole","orcid":"https://orcid.org/0000-0002-5885-0222"},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard Cole","raw_affiliation_strings":["Courant Institute, New York University, 10012, New York, NY, USA","Courant Institute, New York University, New York,USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Courant Institute, New York University, 10012, New York, NY, USA","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Courant Institute, New York University, New York,USA#TAB#","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["Department of Computer Science, The Johns Hopkins University, 21218, Baltimore, MD, USA","Department of Computer Science, The Johns Hopkins University, Baltimore, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Johns Hopkins University, 21218, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]},{"raw_affiliation_string":"Department of Computer Science, The Johns Hopkins University, Baltimore, USA","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042866153"],"corresponding_institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.7064,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.91768074,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":"1-6","first_page":"3","last_page":"23"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9955999851226807,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.7235210537910461},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6526354551315308},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6114902496337891},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.6101939678192139},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6038994193077087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5822319388389587},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.544448733329773},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5069106221199036},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4972722828388214},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.46847930550575256},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4234268367290497},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36688852310180664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34374886751174927},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.1597203016281128}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.7235210537910461},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6526354551315308},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6114902496337891},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.6101939678192139},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6038994193077087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5822319388389587},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.544448733329773},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5069106221199036},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4972722828388214},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.46847930550575256},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4234268367290497},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36688852310180664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34374886751174927},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.1597203016281128},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01758749","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01758749","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W86882862","https://openalex.org/W200390202","https://openalex.org/W1836810876","https://openalex.org/W1971842242","https://openalex.org/W1975510415","https://openalex.org/W1977176150","https://openalex.org/W1978583881","https://openalex.org/W1981233261","https://openalex.org/W1987647724","https://openalex.org/W2003583528","https://openalex.org/W2003711098","https://openalex.org/W2005314985","https://openalex.org/W2007519459","https://openalex.org/W2007610503","https://openalex.org/W2011573873","https://openalex.org/W2016482138","https://openalex.org/W2022266599","https://openalex.org/W2030999197","https://openalex.org/W2035300538","https://openalex.org/W2042607215","https://openalex.org/W2082419751","https://openalex.org/W2087489294","https://openalex.org/W2092472617","https://openalex.org/W2115636961","https://openalex.org/W2143462372","https://openalex.org/W2150518053","https://openalex.org/W2294603245","https://openalex.org/W2443862921","https://openalex.org/W2911302472","https://openalex.org/W4300640952"],"related_works":["https://openalex.org/W2382946950","https://openalex.org/W2099171404","https://openalex.org/W79613783","https://openalex.org/W748435850","https://openalex.org/W2006079497","https://openalex.org/W2006532247","https://openalex.org/W4299527166","https://openalex.org/W2008336875","https://openalex.org/W1992000713","https://openalex.org/W2509860924"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}