Lecture Notes on Geometric Robustness Jonathan Richard Shewchuk

First Page		Document Content
Date: 2013-04-15 20:12:06 Applied mathematics Floating point Time complexity Algorithm Point in polygon Machine epsilon Computational geometry Arbitrary-precision arithmetic Delaunay triangulation Computer arithmetic Theoretical computer science Mathematics		Lecture Notes on Geometric Robustness Jonathan Richard Shewchuk Add to Reading List Source URL: www.cs.berkeley.edu Download Document from Source Website File Size: 205,73 KB Share Document on Facebook

	Fast Reproducible Floating-Point Summation James Demmel, Hong Diep Nguyen ParLab - EECS - UC Berkeley ARITH 21 April 7-10, 2013 DocID: 1r45M - View Document
	BIT 39(3), pp. 539–560, 1999 FAST AND PARALLEL INTERVAL ARITHMETIC SIEGFRIED M. RUMP Inst. of Computer Science III, Technical University Hamburg-Harburg, Eißendorfer Str. 38, 21071 Hamburg, Germany. DocID: 1qF1b - View Document
	Static Analysis of Finite Precision Computations Eric Goubault and Sylvie Putot CEA LIST, Laboratory for the Modelling and Analysis of Interacting Systems, Point courrier 94, Gif-sur-Yvette, FFrance, Firstname.Las DocID: 1pipx - View Document
	Motivations for an arbitrary precision interval arithmetic and the MPFI library N. Revol ()∗ ´ INRIA, Project Arenaire, LIP (CNRS/ENSL/INRIA/UCBL), Ecole Normale DocID: 1mOXx - View Document
	References Presented at the DMA Analytics-CRM Community Town Hall on Machine Learning & Automated Modeling - March 18, 2015 Source: Peter Zajonc, Senior Director, Epsilon Marty Rose, Senior Data Scientist, Acxiom Useful DocID: 1jYXE - View Document