%DELAUNAY Delaunay triangulation.
%   TRI = DELAUNAY(X,Y) returns a set of triangles such that no data
%   points are contained in any triangle's circumcircle. Each row of
%   the M-by-3 matrix TRI defines one such triangle and contains
%   indices into the vectors X and Y.
%
%   TRI = DELAUNAY(X,Y,'sorted') assumes that the points X and Y are
%   sorted first by Y and then by X, and that duplicate points have
%   already been eliminated.
%
%   The Delaunay triangulation is used with: GRIDDATA (to
%   interpolate scattered data), CONVHULL, VORONOI (to compute the
%   VORONOI diagram), and is useful by itself to create a triangular
%   grid for scattered data points.
%
%   The functions DSEARCH and TSEARCH search the triangulation to
%   find nearest neighbor points or enclosing triangles, respectively.
%   
%   Based on sweepline Voronoi code by Steven Fortune.
%   
%   See also VORONOI, TRIMESH, TRISURF, GRIDDATA, CONVHULL, DSEARCH, TSEARCH.

%   Clay M. Thompson 7-8-95
%   Copyright (c) 1984-98 by The MathWorks, Inc.
%   $Revision: 1.8 $  $Date: 1997/11/21 23:40:34 $

%   The author of this software is Steven Fortune, AT&T Bell Laboratories.
%   Reference: Steve J. Fortune (1987) A Sweepline Algorithm for
%   Voronoi Diagrams, Algorithmica 2, 153-174.
%
%   Permission to use, copy, modify, and distribute this software for any
%   purpose without fee is hereby granted, provided that this entire notice
%   is included in all copies of any software which is or includes a copy
%   or modification of this software and in all copies of the supporting
%   documentation for such software.
%   THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
%   WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR AT&T MAKE ANY
%   REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
%   OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.

%   This calls a MATLAB mex file.


