b'@inproceedings{mehlhorn06x,'b'\nTITLE = {Reliable and Efficient Geometric Computing},\nAUTHOR = {Mehlhorn, Kurt},\nEDITOR = {Calamoneri, Tiziana and Finocchi, Irene and Italiano, Giuseppe F.},\nLANGUAGE = {eng},\nISBN = {3-540-34375-X},\nLOCALID = {Local-ID: C1256428004B93B8-EC5B8ABF87E0F995C12571F1002BEFEC-mehlhorn06x},\nPUBLISHER = {Springer},\nYEAR = {2006},\nDATE = {2006},\nABSTRACT = {Reliable implementation of geometric algorithms is a notoriously difficult task. Algorithms are usually designed for the Real-RAM, capable of computing with real numbers in the sense of mathematics, and for non-degenerate inputs. But, real computers are not Real-RAMs and inputs are frequently degenerate. In the first part of the talk we illustrate the pitfalls of geometric computing by way of examples [KMP+04]. The examples demonstrate in a lucid way that standard and frequently taught algorithms can go completely astray when naively implemented with floating point arithmetic. Partially supported by the IST Programme of the EU under Contract No IST-2005-TODO, Algorithms for Complex Shapes (ACS).},\nBOOKTITLE = {Algorithms and Complexity : 6th Italian Conference, CIAC 2006},\nPAGES = {1--2},\nSERIES = {Lecture Notes in Computer Science},\nVOLUME = {3998},\n}\n'