Computational geometry and discrete computations

Olivier Devillers 1
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00338179
Contributor : Olivier Devillers <>
Submitted on : Tuesday, November 11, 2008 - 7:56:04 PM
Last modification on : Saturday, January 27, 2018 - 1:30:48 AM
Long-term archiving on : Monday, June 7, 2010 - 10:53:09 PM

File

d-cgdc-96.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00338179, version 1

Collections

Citation

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

Share

Metrics

Record views

193

Files downloads

154