Abstract. This paper describes a general-purpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task to provide 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.

Postscript [132k]

See also: ACM citation page including review

Suggested BIBTeX entry:

@article{LABEL
,author=        "Edelsbrunner, H. and M{\"u}cke, E. P."
,title=         "{Simulation of Simplicity}: A Technique to Cope with
                Degenerate Cases in Geometric Algorithms"
,journal=       "ACM Transactions on Graphics"
,volume=        9
,number=        1
,year=          1990
,pages=         "66--104"
,url=           "http://www.geom.umn.edu/locate/cglist/GeomDir/sos90.html"
}