SAL Home MATH Misc


nnsort finds the Delaunay triangulation of the two- or three-component vectors in 'data_list' and returns a list of simplex vertices in 'vertices' with the corresponding circumcentre and squared radius in the rows of 'circentres'. nnsort also can be used to find the ordered convex hull of the two- or three- component vectors in 'data_list' and returns a list of (d-1)-facet vertices in 'vertices' (dummy filename for 'circentres' must be used).

Current Version:   ??

License Type:   Public Domain

Home Site:

Source Code Availability:


Available Binary Packages:

  • Debian Package: No
  • RedHat RPM Package: No
  • Other Packages: No

Targeted Platforms:

nnsort was written in C, it compiles ok under Linux/gcc.

Software/Hardware Requirements:

C compiler

Other Links:

Mailing Lists/USENET News Groups:


User Comments:

  • None

See A Screen Shot? (Not Yet)

  SAL Home   |   Mathematics   |   Misc

Comments? SAL@KachinaTech.COM
Copyright © 1995-2001 by Herng-Jeng Jou
Copyright © 1997-2001 by Kachina Technologies, Inc.
All rights reserved.