Robust Geometric Computing in Motion

Transforming a geometric algorithm into an effective computer program is a difficult task. This transformation is particularly made hard by the basic assumptions of most theoretical geometric algorithms concerning complexity measures and (more crucially) the handling of robustness issues, namely issues related to arithmetic precision and degenerate input… CONTINUE READING

8 Figures & Tables

Topics

Statistics

0510'03'05'07'09'11'13'15'17
Citations per Year

64 Citations

Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.