{"id":"https://openalex.org/W2065697367","doi":"https://doi.org/10.1137/0220016","title":"An $O(n\\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem","display_name":"An $O(n\\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W2065697367","doi":"https://doi.org/10.1137/0220016","mag":"2065697367"},"language":"en","primary_location":{"id":"doi:10.1137/0220016","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220016","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/A5069999967","display_name":"Herbert Edelsbrunner","orcid":"https://orcid.org/0000-0002-9823-6833"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Herbert Edelsbrunner","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078773079","display_name":"Weiping Shi","orcid":"https://orcid.org/0000-0001-9773-9255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weiping Shi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069999967"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9954,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.74086957,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"2","first_page":"259","last_page":"269"},"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.9986000061035156,"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.9983000159263611,"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/convex-hull","display_name":"Convex hull","score":0.7956280708312988},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7686463594436646},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7082663774490356},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.650140643119812},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5844722390174866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5331028699874878},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.5218845009803772},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4672762155532837},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.45619872212409973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44479793310165405},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44070619344711304},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4381016790866852},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3295063376426697},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.32415974140167236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22569483518600464},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.16274693608283997},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05871725082397461}],"concepts":[{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.7956280708312988},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7686463594436646},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7082663774490356},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.650140643119812},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5844722390174866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5331028699874878},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.5218845009803772},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4672762155532837},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.45619872212409973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44479793310165405},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44070619344711304},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4381016790866852},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3295063376426697},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.32415974140167236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22569483518600464},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.16274693608283997},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05871725082397461},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220016","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220016","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1971550377","https://openalex.org/W1973033359","https://openalex.org/W1976915153","https://openalex.org/W1987374783","https://openalex.org/W1993058867","https://openalex.org/W2008581147","https://openalex.org/W2011297770","https://openalex.org/W2025299767","https://openalex.org/W2041775009","https://openalex.org/W2061705188","https://openalex.org/W2078908612","https://openalex.org/W2094855951","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2139594840","https://openalex.org/W2911302472","https://openalex.org/W4254977685","https://openalex.org/W4300640952"],"related_works":["https://openalex.org/W142701514","https://openalex.org/W2223571892","https://openalex.org/W1913561908","https://openalex.org/W1992352038","https://openalex.org/W2056328486","https://openalex.org/W1786647412","https://openalex.org/W2358001426","https://openalex.org/W2050001863","https://openalex.org/W2991703316","https://openalex.org/W2121443275"],"abstract_inverted_index":{"An":[0],"algorithm":[1,43],"is":[2,28,35],"presented":[3],"that":[4],"constructs":[5],"the":[6,29,39,55],"convex":[7],"hull":[8],"of":[9,12,31,38,54],"a":[10],"set":[11],"n":[13],"points":[14],"in":[15,18],"three":[16],"dimensions":[17],"worst-case":[19],"time":[20,41,58],"$O(n\\log":[21,56],"^2":[22],"h)$and":[23],"storage":[24],"$O(n)$,":[25],"where":[26],"h":[27],"number":[30],"extreme":[32],"points.":[33],"This":[34],"an":[36],"improvement":[37],"$O(nh)$":[40],"gift-wrapping":[42],"and,":[44],"if":[45],"$h":[46],"=":[47],"o(2^{\\sqrt":[48],"{\\log":[49],"_2":[50],"n}":[51],"}":[52],")$,":[53],"n)$":[57],"divide-and-conquer":[59],"algorithm.":[60]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}