File: tinlibDownload   Add to favorates  [Vote: very good!  5  4  3  2  1 Vote: very bad!]
  Directory: Graph program
  Dev tools: C-C++
  File size: 226 KB
  Update: 2010-05-20
  Downloads: 31
  Uploader: jusygg
 Describe: Triangle mesh generator with Delaunay algorithm£¬contrained£¬refinement
File list(Click to check if it's the file you need, and recomment it at the bottom):
  tindemo.c
  tindemo.exe
  tinlib.c
  tinlib.h
  tinner.glade
  xyz.txt
  callbacks.c
  callbacks.h
  cgui.bat
  ct.bat
  flexray.c
  flexray.h
  interface.c
  interface.h
  main.c
  readme.txt
  rgbtools.c
  rgbtools.h
  space.c
  space.h
  support.c
  support.h
  outline.txt
  triangles.txt
Please Comment: [Very Good!] [Commonly] [passworded] [Bad Descibe] [Not code/document] [lost file]  [Can't uncompress] [Very bad!] [Note]
 [Dairy Queen]:.CÎļþ~~~
 To Search: tinlib 
 Search in more than 1370000 codes/documents:
 [Delaunayrefinementmeshgeneration.rar] - Delaunay triangulation in two-dimensional, three-dimensional meshed in the basics, theorems, and to achieve.
 [delaunay_demo.zip] - triangulation algorithm, demo image
 [03VCimagesegmentationandEdgeDetectionsourc] - 03 VC image segmentation and Edge Detection source code, using different methods of image segmentation

 [200591032228730.rar] - Delaunay triangulation planar discrete points of the triangle, friends interact more ah
 [lesson32.rar] - roam a classical algorithm can be seen surrounded After opening the boxes, Mesh Subdivision reflects the pedigree of detail
 [fractal(5).rar] - Document fractal (1) ~ fractal (5) is to spend my efforts to prepare the fractal geometry of some classic graphical Matlab detailed painting (includin
 [delaunaytriangulation.rar] - Introduction of the point and line segment has to determine the relationship between the methods and convex hull generation algorithm Based on the co
 [sanjiaopoufen.rar] - This procedure is used to achieve the C optimal triangulation problem. Using a dynamic programming algorithm to achieve.
 [Delaunay.zip] - In mathematics, and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in
 [2D.rar] - C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory---------------------------------------------------