Calculates the Voronoi diagram or Delaunay triangulation for a given set of points in the plane using a sweep algorithm. (See S.J. Fortune, Algorithmica 2 (1987) pp. 153-174.). Classes : P . Computational geometry (search also classes G and Q) Type : C subroutine in VORONOI package. Access : Some uses prohibited. Portable. Precision: Single. Note : Fullsource is a shell archive containing source, example, Makefile, and manual page. Usage : voronoi [-s -t -p] Details : Fullsource Sites : (1) NETLIB
NETLIB: Public access repository, The University of Tennessee at Knoxville and Bell Laboratories Precision: Single. Note : Fullsource is a shell archive containing source, example, Makefile, and manual page. You may access components from NETLIB outside GAMS as follows. Fullsource : echo 'send sweep2 from voronoi' | mail netlib@ornl.gov
GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology
This page was generated on Tue Sep 16, 2008 at 10:28:16 UTC