Computational geometry and discrete computations - Archive ouverte HAL Access content directly
Conference Papers Year : 1996

Computational geometry and discrete computations

(1)
1
Olivier Devillers

Abstract

In this talk we describe some problems arising in practical implementation of algorithms from computational geometry. Going to robust algorithms needs to solve issues such as rounding errors and degeneracies. Most of the problems are closely related to the incompatibility between on one side algorithms designed for continuous data and on the other side the discrete nature of the data and the computations in an actual computer.
Fichier principal
Vignette du fichier
d-cgdc-96.pdf (153.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00338179 , version 1 (11-11-2008)

Identifiers

  • HAL Id : inria-00338179 , version 1

Cite

Olivier Devillers. Computational geometry and discrete computations. Discrete Geometry for Computer Imagery, 1996, Lyon, France. ⟨inria-00338179⟩

Collections

INRIA INRIA2
66 View
70 Download

Share

Gmail Facebook Twitter LinkedIn More