| 
					 | 
				
					Delaunay Triangulator (v. 1.0) Разработано maljovec002  | 
			
The user taps where they want to place a point and the software constructs the Delaunay triangulation given the point set specified. 
A Delaunay triangulation is considered an optimal triangulation of points as it maximizes the minimum angle of all angles of all triangles
Software uses the incremental algorithm.


			
		| 
						[2010-03-29] A Google User: Hey not bad..pretty good, maybe u could include the option for voronoi cells oso..oh but the prog can't handle too many points, will crash..  | 
					
						![]() ![]() ![]()  							 						 | 
				
| 
						[2010-03-29] KiD: Hey not bad..pretty good, maybe u could include the option for voronoi cells oso..oh but the prog can't handle too many points, will crash..  | 
					
						![]() ![]() ![]()  							 						 | 
				
| 
				 Android-Online.ru © 2013  |