As the LHC prepares to start taking data, this review is intended to provide a QCD theorist's
understanding and views on jet finding at hadron colliders, including recent developments …

The study of algorithms for generating unstructured meshes of triangles and tetrahedra
began with mechanical and aeronautical engineers who decompose physical domains into …

Delaunay refinement is a technique for generating unstructured meshes of triangles for use
in interpolation, the finite element method, and the finite volume method. In theory and …

Written by experts, Digital Terrain Modeling: Principles and Methodology provides
comprehensive coverage of recent developments in the field. The topics include terrain …

In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments
that constrain the edges of the triangulation, while still maintaining most of the favorable …

Although the properties of natural neighbour interpolation and its usefulness with scattered
and irregularly spaced data are well-known, its implementation is still a problem in practice …

Efficient sampling often relies on irregular point sets that uniformly cover the sample space.
We present a flexible and simple optimization strategy for such point sets. It is based on the …

Meshes composed of triangles or tetrahedra are used in applications such as computer
graphics, interpolation, surveying, and terrain databases. Although the algorithms described …

We propose a new data structure to compute the Delaunay triangulation of a set of points in
the plane. It combines good worst case complexity, fast behavior on real data, small memory …

We present algorithms for the efficient insertion and removal of constraints in Delaunay
Triangulations. Constraints are considered to be points or any kind of polygonal lines …