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

Authors:
H. Edelsbrunner;E. P. Mücke
Affiliations:
Department of Computer Science, University of Illinois, Champaign, 1304 West Springfield Avenue, Urbana, Illinois;Department of Computer Science, University of Illinois, Champaign, 1304 West Springfield Avenue, Urbana, Illinois
Venue:
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Year:
1988

Citing 12
Cited 26

Computational geometry: an introduction

Computational geometry: an introduction
Computing a ham-sandwich cut in two dimensions

Journal of Symbolic Computation
Edge-skeletons in arrangements with applications

Algorithmica
Topologically sweeping an arrangement

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing higher-dimensional convex hulls at logarithmic cost per face

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
A geometric consistency theorem for a symbolic perturbation scheme

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Primitives for the manipulation of general subdivisions and the computation of Voronoi

ACM Transactions on Graphics (TOG)
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions

A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions

Computational geometry column

ACM SIGACT News
The Problems of Accuracy and Robustness in Geometric Computation

Computer
Coordinate representation of order types requires exponential storage

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Applications of random sampling in computational geometry, II

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Epsilon geometry: building robust algorithms from imprecise computations

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Efficient parallel computation of arrangements of hyperplanes in d dimensions

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient Delaunay triangulation using rational arithmetic

ACM Transactions on Graphics (TOG)
Symbolic treatment of geometric degeneracies

Journal of Symbolic Computation
An efficient algorithm for CSG to b-rep conversion

SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Determination of mass properties of polygonal CSG objects in parallel

SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
An optimal algorithm for intersecting line segments in the plane

Journal of the ACM (JACM)
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation

SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Obtaining robust Boolean set operations for manifold solids by avoiding and eliminating redundancy.

SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Boundary representation modelling with local tolerances

SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Controlled simplification of genus for polygonal models

VIS '97 Proceedings of the 8th conference on Visualization '97
Finding the shortest boundary guard of a simple polygon

Theoretical Computer Science
Topology Simplification for Polygonal Virtual Environments

IEEE Transactions on Visualization and Computer Graphics
Robust Geometric Computation Based on Topological Consistency

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Computing with Real Numbers

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Exact Computation of 4-D Convex Hulls with Perturbation and Acceleration

PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
A genus oblivious approach to cross parameterization

Computer Aided Geometric Design
A growing self-organizing network for reconstructing curves and surfaces

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
An explicit solution for computing the Euclidean d-dimensional Voronoi diagram of spheres in a floating-point arithmetic

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Connectivity in the regular polytope representation

Geoinformatica
Visualization of discrete gradient construction

Proceedings of the twenty-seventh annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

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 obtained without using it. We believe that this technique will become a standard tool in writing geometric software.