Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

Details Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

1994-10-12

arxiv.org/abs/math/9410209v1

Mathematics

Combinatorics

38 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534139