{"title":"Edge-skeletons in arrangements with applications","_id":"3580","date_created":"2018-12-11T12:04:04Z","volume":1,"page":"93 - 109","date_updated":"2022-02-02T09:36:32Z","month":"11","type":"journal_article","year":"1986","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"article_type":"original","oa_version":"None","publication_status":"published","extern":"1","intvolume":"         1","quality_controlled":"1","publication":"Algorithmica","status":"public","day":"01","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"date_published":"1986-11-01T00:00:00Z","scopus_import":"1","doi":"10.1007/BF01840438","citation":{"mla":"Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” <i>Algorithmica</i>, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:<a href=\"https://doi.org/10.1007/BF01840438\">10.1007/BF01840438</a>.","ista":"Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.","short":"H. Edelsbrunner, Algorithmica 1 (1986) 93–109.","apa":"Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01840438\">https://doi.org/10.1007/BF01840438</a>","ieee":"H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” <i>Algorithmica</i>, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.","ama":"Edelsbrunner H. Edge-skeletons in arrangements with applications. <i>Algorithmica</i>. 1986;1(1-4):93-109. doi:<a href=\"https://doi.org/10.1007/BF01840438\">10.1007/BF01840438</a>","chicago":"Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” <i>Algorithmica</i>. Springer, 1986. <a href=\"https://doi.org/10.1007/BF01840438\">https://doi.org/10.1007/BF01840438</a>."},"publisher":"Springer","publist_id":"2805","abstract":[{"lang":"eng","text":"An edge-skeleton in an arrangementA(H) of a finite set of planes inE 3 is a connected collection of edges inA(H). We give a method that constructs a skeleton inO(√n logn) time per edge. This method implies new and more efficient algorithms for a number of structures in computational geometry including order-k power diagrams inE 2 and space cutting trees inE 3.\r\nWe also give a novel method for handling special cases which has the potential to substantially decrease the amount of effort needed to implement geometric algorithms."}],"issue":"1-4","language":[{"iso":"eng"}],"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"}