{"id":"https://openalex.org/W1976915153","doi":"https://doi.org/10.1137/0215021","title":"The Ultimate Planar Convex Hull Algorithm?","display_name":"The Ultimate Planar Convex Hull Algorithm?","publication_year":1986,"publication_date":"1986-02-01","ids":{"openalex":"https://openalex.org/W1976915153","doi":"https://doi.org/10.1137/0215021","mag":"1976915153"},"language":"en","primary_location":{"id":"doi:10.1137/0215021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215021","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5069172477","display_name":"David Kirkpatrick","orcid":"https://orcid.org/0000-0002-3276-2734"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David G. Kirkpatrick","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083878690","display_name":"Raimund Seidel","orcid":"https://orcid.org/0000-0003-2349-785X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raimund Seidel","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069172477"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.4397,"has_fulltext":false,"cited_by_count":383,"citation_normalized_percentile":{"value":0.99122679,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"15","issue":"1","first_page":"287","last_page":"299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991000294685364,"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.9990000128746033,"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/convex-hull","display_name":"Convex hull","score":0.8525590896606445},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.7428717613220215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6597245931625366},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.616826057434082},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6092901229858398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5848209857940674},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5404689311981201},{"id":"https://openalex.org/keywords/hull","display_name":"Hull","score":0.5307464599609375},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5172389149665833},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5156658887863159},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.502356767654419},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4982268810272217},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4496231973171234},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4358759820461273},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4226563572883606},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42027193307876587},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3395523428916931},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23640227317810059},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.13758042454719543},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09718328714370728}],"concepts":[{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.8525590896606445},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.7428717613220215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6597245931625366},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.616826057434082},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6092901229858398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5848209857940674},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5404689311981201},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.5307464599609375},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5172389149665833},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5156658887863159},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.502356767654419},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4982268810272217},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4496231973171234},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4358759820461273},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4226563572883606},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42027193307876587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3395523428916931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23640227317810059},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.13758042454719543},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09718328714370728},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C199104240","wikidata":"https://www.wikidata.org/wiki/Q118291","display_name":"Marine engineering","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0215021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215021","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:ecommons.cornell.edu:1813/6417","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/6417","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/5","score":0.6000000238418579,"display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1998115980","https://openalex.org/W2000358470","https://openalex.org/W2020085260","https://openalex.org/W2025299767","https://openalex.org/W2041775009","https://openalex.org/W2044850435","https://openalex.org/W2049864887","https://openalex.org/W2079059509","https://openalex.org/W2094855951","https://openalex.org/W3149705110"],"related_works":["https://openalex.org/W2358001426","https://openalex.org/W1786647412","https://openalex.org/W2104304525","https://openalex.org/W981962503","https://openalex.org/W2363904277","https://openalex.org/W1758159897","https://openalex.org/W2439874932","https://openalex.org/W2153504150","https://openalex.org/W2383394746","https://openalex.org/W2128601753"],"abstract_inverted_index":{"We":[0,45],"present":[1],"a":[2,57,85],"new":[3],"planar":[4],"convex":[5],"hull":[6],"algorithm":[7,50,82],"with":[8],"worst":[9,53],"case":[10,54],"time":[11],"complexity":[12,66],"$O(n":[13],"\\log":[14],"H)$":[15],"where":[16],"$n$":[17],"is":[18,27,51,70],"the":[19,22,28,31,35,43,65,68,88,94],"size":[20,29],"of":[21,30,37,61,67,74,87],"input":[23,75],"set":[24],"and":[25,97],"$H$":[26],"output":[32,79],"set,":[33],"i.e.":[34],"number":[36],"vertices":[38],"found":[39],"to":[40,100],"be":[41,101],"on":[42,56,84],"hull.":[44],"also":[46],"show":[47],"that":[48],"this":[49],"asymptotically":[52],"optimal":[55],"rather":[58],"realistic":[59],"model":[60],"computation":[62],"even":[63],"if":[64],"problem":[69],"measured":[71],"in":[72,103],"terms":[73],"as":[76,78],"well":[77],"size.":[80],"The":[81],"relies":[83],"variation":[86],"divide-and-conquer":[89],"paradigm":[90],"which":[91,98],"we":[92],"call":[93],"\"marriage-before-conquest\"":[95],"principle":[96],"appears":[99],"interesting":[102],"its":[104],"own":[105],"right.":[106]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":13}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}