{"id":"https://openalex.org/W2104304525","doi":"https://doi.org/10.1142/s0218195996000162","title":"A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET","display_name":"A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET","publication_year":1996,"publication_date":"1996-06-01","ids":{"openalex":"https://openalex.org/W2104304525","doi":"https://doi.org/10.1142/s0218195996000162","mag":"2104304525"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195996000162","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000162","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/A5103285481","display_name":"Omer Berkman","orcid":"https://orcid.org/0000-0003-0503-7366"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"OMER BERKMAN","raw_affiliation_strings":["Dept. of Computing, King\u2019s College London, The Strand, London WC2R 2LS, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computing, King\u2019s College London, The Strand, London WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"BARUCH SCHIEBER","raw_affiliation_strings":["IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598, USA","IBM Research Division, T. J. Watson Research Center, P.O. Box 218, Yorktown heights, New York 10598, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM Research Division, T. J. Watson Research Center, P.O. Box 218, Yorktown heights, New York 10598, USA","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"UZI VISHKIN","raw_affiliation_strings":["Dept. of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","Institute for Advanced Computer Studies (UMIACS), and Dept. of Electrical Engineering, University of Maryland, College Park, Maryland 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Institute for Advanced Computer Studies (UMIACS), and Dept. of Electrical Engineering, University of Maryland, College Park, Maryland 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103285481"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":1.0435,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.80153574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"06","issue":"02","first_page":"231","last_page":"241"},"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.9998000264167786,"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.9998000264167786,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.8299729824066162},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.8292433023452759},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.822536051273346},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7516695261001587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6695549488067627},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6190323233604431},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6133905649185181},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6045370697975159},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5542558431625366},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.524830162525177},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49889469146728516},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4483088254928589},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4444882273674011},{"id":"https://openalex.org/keywords/orthogonal-convex-hull","display_name":"Orthogonal convex hull","score":0.4440491199493408},{"id":"https://openalex.org/keywords/hull","display_name":"Hull","score":0.43921053409576416},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.43252071738243103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2441072165966034},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1428205668926239},{"id":"https://openalex.org/keywords/convex-body","display_name":"Convex body","score":0.13905179500579834}],"concepts":[{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.8299729824066162},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.8292433023452759},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.822536051273346},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7516695261001587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6695549488067627},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6190323233604431},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6133905649185181},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6045370697975159},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5542558431625366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.524830162525177},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49889469146728516},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4483088254928589},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4444882273674011},{"id":"https://openalex.org/C64051489","wikidata":"https://www.wikidata.org/wiki/Q7104528","display_name":"Orthogonal convex hull","level":5,"score":0.4440491199493408},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.43921053409576416},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.43252071738243103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2441072165966034},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1428205668926239},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.13905179500579834},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199104240","wikidata":"https://www.wikidata.org/wiki/Q118291","display_name":"Marine engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218195996000162","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000162","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:CiteSeerX.psu:10.1.1.53.8151","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.umiacs.umd.edu/users/vishkin/PUBLICATIONS/ijcga.ps","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":0,"referenced_works":[],"related_works":["https://openalex.org/W981962503","https://openalex.org/W2058179942","https://openalex.org/W2363904277","https://openalex.org/W1758159897","https://openalex.org/W2375652826","https://openalex.org/W1786647412","https://openalex.org/W2048874717","https://openalex.org/W2358001426","https://openalex.org/W2132847202","https://openalex.org/W2300145982"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,11,33,55,60,104,123],"parallel":[3],"algorithm":[4,16,70,110],"for":[5,64],"finding":[6],"the":[7,39,51,66,77,81,91,112,115],"convex":[8,52,67],"hull":[9,53],"of":[10,80,107,114],"sorted":[12],"point":[13],"set.":[14],"The":[15,69,109],"runs":[17],"in":[18,54,73],"O(":[19],"log":[20,21,28,29,41,43,44],"n)":[22,45],"(doubly":[23],"logarithmic)":[24],"time":[25,46],"using":[26,103],"n/":[27,42],"n":[30],"processors":[31],"on":[32],"Common":[34],"CRCW":[35],"PRAM.":[36],"To":[37],"break":[38],"\u03a9(":[40],"barrier":[47],"required":[48],"to":[49,126,132],"output":[50],"contiguous":[56],"array,":[57],"we":[58],"introduce":[59],"novel":[61],"data":[62],"structure":[63],"representing":[65],"hull.":[68],"is":[71,84,95],"optimal":[72],"two":[74],"respects:":[75],"(1)":[76],"time-processor":[78],"product":[79],"algorithm,":[82],"which":[83,94],"linear,":[85],"cannot":[86,98],"be":[87,99],"improved,":[88],"and":[89],"(2)":[90],"running":[92],"time,":[93],"doubly":[96,118],"logarithmic,":[97],"improved":[100],"even":[101],"by":[102,121],"linear":[105],"number":[106],"processors.":[108],"demonstrates":[111],"power":[113],"\u201cthe":[116],"divide-and-conquer":[117],"logarithmic":[119],"paradigm\u201d":[120],"presenting":[122],"non-trivial":[124],"extension":[125],"situations":[127],"that":[128],"previously":[129],"were":[130],"known":[131],"have":[133],"only":[134],"slower":[135],"algorithms.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}