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.
Cite
CITATION STYLE
Devillers, O. (1996). Computational geometry and discrete computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1176, pp. 317–324). Springer Verlag. https://doi.org/10.1007/3-540-62005-2_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
