Published in

Springer, Lecture Notes in Computer Science, p. 315-324, 1996

DOI: 10.1007/3-540-62005-2_27

Links

Tools

Export citation

Search in Google Scholar

Computational Geometry and Discrete Computations

Proceedings article published in 1996 by Olivier Devillers ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

In this talk we describe some problems arising in practicalimplementation of algorithms from computational geometry. Goingto robust algorithms needs to solve issues such as rounding errors anddegeneracies. Most of the problems are closely related to the incompatibilitybetween on one side algorithms designed for continuous data andon the other side the discrete nature of the data and the computationsin an actual computer.