{"id":"https://openalex.org/W2043652181","doi":"https://doi.org/10.1007/bf01293667","title":"A time-optimal parallel algorithm for three-dimensional convex hulls","display_name":"A time-optimal parallel algorithm for three-dimensional convex hulls","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W2043652181","doi":"https://doi.org/10.1007/bf01293667","mag":"2043652181"},"language":"en","primary_location":{"id":"doi:10.1007/bf01293667","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01293667","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/A5050205557","display_name":"Nancy M. Amato","orcid":"https://orcid.org/0000-0001-5817-5290"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"N. M. Amato","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, 77843-3112, College Station, TX, USA","Department of Computer Science, Texas A&M University, College Station, USA","Department of Computer Science, Texas A&M University, College Station, USA 77843-3112#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, 77843-3112, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, USA 77843-3112#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112003802","display_name":"F. P. Preparata","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. P. Preparata","raw_affiliation_strings":["Department of Computer Science, Brown University, Box 1910, 02912, Providence, RI, USA","Department of Computer Science, Brown University, Providence, USA","Dept. of Computer Science, Brown University, Providence, USA 02912#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Box 1910, 02912, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Dept. of Computer Science, Brown University, Providence, USA 02912#TAB#","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050205557","https://openalex.org/A5112003802"],"corresponding_institution_ids":["https://openalex.org/I27804330","https://openalex.org/I91045830"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3747,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.61755486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"14","issue":"2","first_page":"169","last_page":"182"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.8067409992218018},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.7637923955917358},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6598188281059265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5617806911468506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5343308448791504},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5305407643318176},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.530269980430603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5202075839042664},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5155346393585205},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5096335411071777},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4625740349292755},{"id":"https://openalex.org/keywords/orthogonal-convex-hull","display_name":"Orthogonal convex hull","score":0.4512573182582855},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.422096312046051},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.42073044180870056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3792690634727478},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.23339584469795227},{"id":"https://openalex.org/keywords/convex-body","display_name":"Convex body","score":0.13569366931915283}],"concepts":[{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.8067409992218018},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.7637923955917358},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6598188281059265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5617806911468506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5343308448791504},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5305407643318176},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.530269980430603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5202075839042664},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5155346393585205},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5096335411071777},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4625740349292755},{"id":"https://openalex.org/C64051489","wikidata":"https://www.wikidata.org/wiki/Q7104528","display_name":"Orthogonal convex hull","level":5,"score":0.4512573182582855},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.422096312046051},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.42073044180870056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3792690634727478},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.23339584469795227},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.13569366931915283},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01293667","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01293667","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1513982482","https://openalex.org/W1584086289","https://openalex.org/W1608426122","https://openalex.org/W1763430070","https://openalex.org/W1967241124","https://openalex.org/W1975510415","https://openalex.org/W1976915153","https://openalex.org/W1978583881","https://openalex.org/W1987576325","https://openalex.org/W1991429808","https://openalex.org/W2000050422","https://openalex.org/W2003533142","https://openalex.org/W2003583528","https://openalex.org/W2004389974","https://openalex.org/W2005314985","https://openalex.org/W2011573873","https://openalex.org/W2014495691","https://openalex.org/W2016786329","https://openalex.org/W2025299767","https://openalex.org/W2034066268","https://openalex.org/W2041775009","https://openalex.org/W2042607215","https://openalex.org/W2056711744","https://openalex.org/W2057354699","https://openalex.org/W2058432138","https://openalex.org/W2065109708","https://openalex.org/W2065697367","https://openalex.org/W2070570981","https://openalex.org/W2074446160","https://openalex.org/W2105778456","https://openalex.org/W2120490947","https://openalex.org/W2132026455","https://openalex.org/W2132750992","https://openalex.org/W2132954837","https://openalex.org/W2134008688","https://openalex.org/W2911302472","https://openalex.org/W4238964467","https://openalex.org/W4254977685","https://openalex.org/W6630645706","https://openalex.org/W6634962901","https://openalex.org/W6653362784"],"related_works":["https://openalex.org/W2741067195","https://openalex.org/W1507382935","https://openalex.org/W1758159897","https://openalex.org/W2376690466","https://openalex.org/W1786647412","https://openalex.org/W2058179942","https://openalex.org/W2358001426","https://openalex.org/W2439874932","https://openalex.org/W2793611696","https://openalex.org/W2153504150"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}