{"has_accepted_license":"1","page":"243 - 247","type":"journal_article","doi":"10.1016/j.ipl.2014.09.021","ddc":["000"],"issue":"2","author":[{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"first_name":"Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dominik","last_name":"Kaaser","full_name":"Kaaser, Dominik"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"}],"license":"https://creativecommons.org/licenses/by/4.0/","status":"public","publist_id":"5588","date_updated":"2021-01-12T06:51:45Z","oa_version":"Published Version","year":"2015","pubrep_id":"473","month":"02","title":"A simple algorithm for computing positively weighted straight skeletons of monotone polygons","quality_controlled":"1","date_published":"2015-02-01T00:00:00Z","citation":{"ista":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Information Processing Letters. 115(2), 243–247.","apa":"Biedl, T., Held, M., Huber, S., Kaaser, D., &#38; Palfrader, P. (2015). A simple algorithm for computing positively weighted straight skeletons of monotone polygons. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">https://doi.org/10.1016/j.ipl.2014.09.021</a>","chicago":"Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader. “A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons.” <i>Information Processing Letters</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">https://doi.org/10.1016/j.ipl.2014.09.021</a>.","ama":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. <i>Information Processing Letters</i>. 2015;115(2):243-247. doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">10.1016/j.ipl.2014.09.021</a>","ieee":"T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “A simple algorithm for computing positively weighted straight skeletons of monotone polygons,” <i>Information Processing Letters</i>, vol. 115, no. 2. Elsevier, pp. 243–247, 2015.","mla":"Biedl, Therese, et al. “A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons.” <i>Information Processing Letters</i>, vol. 115, no. 2, Elsevier, 2015, pp. 243–47, doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">10.1016/j.ipl.2014.09.021</a>.","short":"T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Information Processing Letters 115 (2015) 243–247."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"       115","oa":1,"_id":"1583","scopus_import":1,"language":[{"iso":"eng"}],"publication":"Information Processing Letters","publication_status":"published","date_created":"2018-12-11T11:52:51Z","abstract":[{"lang":"eng","text":"We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in O(nlogn) time and O(n) space, where n denotes the number of vertices of the polygon."}],"volume":115,"file_date_updated":"2020-07-14T12:45:03Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"publisher":"Elsevier","day":"01","file":[{"date_created":"2018-12-12T10:18:45Z","access_level":"open_access","checksum":"2779a648610c9b5c86d0b51a62816d23","file_id":"5367","file_name":"IST-2016-473-v1+1_1-s2.0-S0020019014001987-main.pdf","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:03Z","relation":"main_file","file_size":270137}]}