--- res: bibo_abstract: - 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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Herbert foaf_name: Edelsbrunner, Herbert foaf_surname: Edelsbrunner foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9823-6833 - foaf_Person: foaf_givenName: Ernst foaf_name: Mücke, Ernst foaf_surname: Mücke bibo_doi: 10.1145/77635.77639 bibo_issue: '1' bibo_volume: 9 dct_date: 1990^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/0730-0301 - http://id.crossref.org/issn/1557-7368 dct_language: eng dct_publisher: ACM@ dct_title: 'Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms@' ...