PHP Classes

Regular Delaunay Triangulation: Render Delaunay triangulation graphs with weights

Recommend this page to a friend!
  Info   View files Example   Screenshots Screenshots   View files View files (2)   DownloadInstall with Composer Download .zip   Reputation   Support forum   Blog    
Ratings Unique User Downloads Download Rankings
Not enough user ratingsTotal: 104 This week: 1All time: 9,717 This week: 560Up
Version License PHP version Categories
rdt 0.1Free For Educatio...4Algorithms, Graphics, Geography
Description 

Author

This package can render Delaunay triangulation graphs with weights.

It implements the Delaunay triangulation algorithm considering weights for each point on the plane.

A separate class renders the graph of triangles with the edges computed with the Delaunay triangulation.

Picture of Chi H.
  Performance   Level  
Name: Chi H. <contact>
Classes: 28 packages by
Country: France France
Age: 39
All time rank: 34222 in France France
Week rank: 109 Up5 in France France Up
Innovation award
Innovation award
Nominee: 22x

Winner: 3x

Example

<?php

/***************************************************************
* Copyright notice
*
* (c) 2014 Chi Hoang (info@chihoang.de)
* All rights reserved
*
***************************************************************/
 
require_once("main.php");
 
 
// Turn off all error reporting
error_reporting(0);

// example 1
$set=array();
$tree=array(145,136,103,141,305,209,127,65,502,80,310,942,206,316,300,259,222,651,3,305,698,355,387,324,175,133,503,232,386,247,118,289,857,42,341,225,65,149,964,324,208,714,386,77,107);
for (
$i=0,$end=count($tree);$i<$end;$i+=3)
{
// $set[]=array($tree[$i],$tree[$i+1],$tree[$i+2]);
}
$tri=new voronoi();
$set=$tri->main();
list(
$tree,$size)=$tri->buildtree($set);

$nearest=new nearestneighbor();
//$p=new Point(12,322);
$p=new Point(60,60);
//$p=new Point(26,229);
$find=$nearest->main($tri,$tree,$p);
$nearest->show($tri,$find,0,$p);

//example2
//$set=array();
//$tree=array(172,31,238,106,233,397,118,206,58,28,268,382,10,380,342,26,67,371,380,14,382,200,24,200,194,190,10,88,276,331);
//for ($i=0,$end=count($tree);$i<$end;$i+=2)
//{
// $set[]=array($tree[$i],$tree[$i+1]);
//}
//$tri=new voronoi();
//list($tree,$size)=$tri->buildtree($set);

//$nearest=new nearestneighbor();
//$p=new Point(12,322);
//$p=new Point(160,160);
//$p=new Point(326,229);
//$p=new Point(188,298);

//$find=$nearest->main($tri,$tree,$p);
//$nearest->show($tri,$find,0,$p);

// experimental point-in-polygon
//=$nearest->polytest($tri,0,$p);
//$find=$nearest->polytest($tri,$size-4,$p);
?>


Screenshots  
  • screenshot.png
  Files folder image Files  
File Role Description
Accessible without login Plain text file example.php Example example class
Plain text file main.php Class main class

 Version Control Unique User Downloads Download Rankings  
 0%
Total:104
This week:1
All time:9,717
This week:560Up