PHP Classes

PHP Delaunay Triangulation: Perform Delaunay triangulation for a set of points

Recommend this page to a friend!
  Info   View files View files (4)   DownloadInstall with Composer Download .zip   Reputation   Support forum (3)   Blog    
Ratings Unique User Downloads Download Rankings
Not enough user ratingsTotal: 429 This week: 1All time: 6,282 This week: 174Up
Version License PHP version Categories
delaunay-triangle 1.0.5BSD License4Algorithms, Graphics
Description Author

This package can perform Delaunay triangulation for a set of points in a plane.

The main class takes the coordinates a set of points and determines which form edges of a triangle whose points are on the same circumference. It can be used to find minimum spanning trees.

Another class can render the graph of triangles with the edges computed with the Delaunay triangulation.

Innovation Award
PHP Programming Innovation award nominee
August 2013
Number 5


Prize: One downloadable copy of Komodo IDE
Delaunay triangulation is an algorithm for defining triangles from a set of points, such as no point of the set is contained in any of the defined triangles.

This algorithm has many interesting applications like for instance defining meshes for a set points that define edges of a surface.

This class provides a PHP implementation of the Delaunay triangulation algorithm.

Manuel Lemos
Picture of Chi H.
  Performance   Level  
Name: Chi H. <contact>
Classes: 28 packages by
Country: France France
Innovation award
Innovation award
Nominee: 22x

Winner: 3x

  Files folder image Files  
File Role Description
Plain text file delaunay.php Class class file
Accessible without login Plain text file example.php Example example
Accessible without login Plain text file examplehilbert.php Example update
Plain text file hilbert.php Class update

 Version Control Unique User Downloads Download Rankings  
 100%
Total:429
This week:1
All time:6,282
This week:174Up
User Comments (1)
 
For more information send a message to info at phpclasses dot org.