Robust Arithmetic in Computational Geometry / Volodymyr Agafonkin | Observable

What an interesting piece!

Robust Arithmetic in Computational Geometry / Volodymyr Agafonkin | Observable

Every developer should know that floating point numbers implement approximations.

During my master thesys in Civil Enginineering (twenty years ago!) I learned that professor Jonathan R Shewchuk wrote almost perfect C code about this, and used in its Delaunay triangulation. At that time I hadn’t the time to really study it as it seemed to me a little like magic.

Now this page in its exact test is using robust-predicates, a modern JavaScript, a port of Jonathan Shewchuk’s robust predicates code.

Wow.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

This site uses Akismet to reduce spam. Learn how your comment data is processed.