×

Reliable and efficient geometric computing. (English) Zbl 1131.68565

Azar, Yossi (ed.) et al., Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 2 (2006).
Summary: Computing with geometric objects (points, curves, and surfaces) is central for many engineering disciplines and lies at the heart of computer aided design systems. Implementing geometric algorithms is notoriously difficult and most actual implementations are incomplete: they are known to crash or deliver the wrong result on some instances.
In the introductory part of the talk, we illustrate the pitfalls of geometric computing and explain for one algorithm in detail where the problem lies and what goes wrong.
For the entire collection see [Zbl 1130.68002].

MSC:

68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
68U07 Computer science aspects of computer-aided design
68W05 Nonnumerical algorithms
PDFBibTeX XMLCite
Full Text: DOI