The convex hull of a set of points is the smallest convex set that contains the points. This
article presents a practical convex hull algorithm that combines the two-dimensional …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation
and Ruppert's Delaunay refinement algorithm for quality mesh generation. Several …

This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …

An adaptive mesh projection method for the time-dependent incompressible Euler equations
is presented. The domain is spatially discretised using quad/octrees and a multilevel …

Exact computer arithmetic has a variety of uses, including the robust implementation of
geometric algorithms. This article has three purposes. The first is to offer fast software-level …

Algorithms for summation and dot product of floating-point numbers are presented which are
fast in terms of measured computing time. We show that the computed results are as …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Delaunay refinement is a technique for generating unstructured meshes of triangles or
tetrahedra suitable for use in the finite element method or other numerical methods for …

Exact computation is assumed in most algorithms in computational geometry. In practice,
implementors perform computation in some fixed-precision model, usually the machine …