{"day":"01","article_type":"original","year":"1991","publisher":"SIAM","date_published":"1991-04-01T00:00:00Z","publist_id":"2072","language":[{"iso":"eng"}],"intvolume":"        20","quality_controlled":"1","title":"An O(n log^2 h) time algorithm for the three-dimensional convex hull problem","main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0220016"}],"oa_version":"None","issue":"2","article_processing_charge":"No","month":"04","date_created":"2018-12-11T12:06:39Z","citation":{"ista":"Edelsbrunner H, Shi W. 1991. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 20(2), 259–269.","chicago":"Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” <i>SIAM Journal on Computing</i>. SIAM, 1991. <a href=\"https://doi.org/10.1137/0220016 \">https://doi.org/10.1137/0220016 </a>.","apa":"Edelsbrunner, H., &#38; Shi, W. (1991). An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0220016 \">https://doi.org/10.1137/0220016 </a>","mla":"Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” <i>SIAM Journal on Computing</i>, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:<a href=\"https://doi.org/10.1137/0220016 \">10.1137/0220016 </a>.","ama":"Edelsbrunner H, Shi W. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. <i>SIAM Journal on Computing</i>. 1991;20(2):259-269. doi:<a href=\"https://doi.org/10.1137/0220016 \">10.1137/0220016 </a>","short":"H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.","ieee":"H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional convex hull problem,” <i>SIAM Journal on Computing</i>, vol. 20, no. 2. SIAM, pp. 259–269, 1991."},"status":"public","page":"259 - 269","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","type":"journal_article","date_updated":"2022-03-02T10:18:31Z","volume":20,"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"_id":"4051","doi":"10.1137/0220016 ","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"last_name":"Shi","full_name":"Shi, Weiping","first_name":"Weiping"}],"abstract":[{"lang":"eng","text":"An algorithm is presented that constructs the convex hull of a set of n points in three dimensions in worst-case time O(n log2h) and storage O(n), where h is the number of extreme points. This is an improvement of the O(nh) time gift-wrapping algorithm and, for certain values of h, of the O(n log n) time divide-and-conquer algorithm."}],"publication_status":"published","publication":"SIAM Journal on Computing"}