Abstract
This note is meant as a sequel to Steven Fortune’s note on ‘Robustness issues in geometric algorithms’ [For96] in these proceedings. We revisit some of the issues raised by him, such as the consistency between the combinatorial and numerical data in geometric algorithms, and then we elaborate on a number of additional topics, including issues in proving correct geometric algorithms meant to be executed with imprecise primitives, and in the rounding of geometric structures so that all their features are exactly representable.
Cite
CITATION STYLE
Guibas, L. J. (1995). Implementing geometric algorithms robustly. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1148, pp. 15–22). Springer Verlag. https://doi.org/10.1007/bfb0014477
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
