{"publication_status":"published","publication":"ACM Transactions on Graphics","month":"01","citation":{"ieee":"H. Edelsbrunner and E. Mücke, “Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms,” <i>ACM Transactions on Graphics</i>, vol. 9, no. 1. ACM, pp. 66–104, 1990.","short":"H. Edelsbrunner, E. Mücke, ACM Transactions on Graphics 9 (1990) 66–104.","apa":"Edelsbrunner, H., &#38; Mücke, E. (1990). Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/77635.77639\">https://doi.org/10.1145/77635.77639</a>","chicago":"Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” <i>ACM Transactions on Graphics</i>. ACM, 1990. <a href=\"https://doi.org/10.1145/77635.77639\">https://doi.org/10.1145/77635.77639</a>.","ama":"Edelsbrunner H, Mücke E. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. <i>ACM Transactions on Graphics</i>. 1990;9(1):66-104. doi:<a href=\"https://doi.org/10.1145/77635.77639\">10.1145/77635.77639</a>","mla":"Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” <i>ACM Transactions on Graphics</i>, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi:<a href=\"https://doi.org/10.1145/77635.77639\">10.1145/77635.77639</a>.","ista":"Edelsbrunner H, Mücke E. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 9(1), 66–104."},"extern":"1","volume":9,"scopus_import":"1","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/77635.77639"}],"acknowledgement":"Research of both authors was supported by Amoco Foundation Faculty Development grant CS 1-6-44862. It was partially carried out while both authors were with the Institutes for Information Processing at the Technical University of Graz, Austria. The first author also acknowledges support by the National Science Foundation under grant CCR-8714565. ","status":"public","date_updated":"2022-02-22T14:58:39Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Mücke","first_name":"Ernst","full_name":"Mücke, Ernst"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","year":"1990","_id":"4063","quality_controlled":"1","doi":"10.1145/77635.77639","type":"journal_article","publist_id":"2058","article_type":"original","publisher":"ACM","oa_version":"None","date_published":"1990-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"This paper describes a general-purpose programming technique, called Simulation of Simplicity, that can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task of providing a consistent treatment for every single special case that can occur. The programs that use the technique tend to be considerably smaller and more robust than those that do not use it. We believe that this technique will become a standard tool in writing geometric software."}],"date_created":"2018-12-11T12:06:43Z","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"article_processing_charge":"No","title":"Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms","day":"01","page":"66 - 104","issue":"1","intvolume":"         9"}