Back to Results
First PageMeta Content
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

Document Date: 2013-04-15 20:12:06


Open Document

File Size: 205,73 KB

Share Result on Facebook

Company

Computer Sciences / /

Country

Canada / /

/

Facility

Computer Sciences University of California at Berkeley Berkeley / LEDA library / /

IndustryTerm

quasi-robust algorithms / point location algorithms / stable algorithms / et al. algorithm / geometric algorithms / quasi-robust algorithm / expression evaluation algorithms / parsimonious algorithm / divide-and-conquer algorithm / correct algorithm / geometric algorithm / to any algorithm / convex hull algorithm / et al. algorithms / correct solution / triangulation algorithm / fragile algorithms / /

Organization

University of California / Okawa Foundation / National Science Foundation / U. S. Government / Natural Sciences and Engineering Research Council of Canada / /

Person

Jonathan Richard Shewchuk / Fortune Wyk / Van Wyk / /

Position

author / representative / /

ProvinceOrState

California / /

Technology

parsimonious algorithm / correct algorithm / RAM / Karasick et al. algorithm / real RAM-correct algorithm / geometric algorithm / Quickhull convex hull algorithm / Avnaim et al. algorithms / geometric algorithms / expression evaluation algorithms / point location algorithms / 2D Delaunay triangulation algorithm / divide-and-conquer algorithm / /

SocialTag