G# - computational geometry for .NETCompute 2D Delaunay triangulations and 2D and 3D convex hulls in .NET environment. | |
Download |
G# - computational geometry for .NET Ranking & Summary
Advertisement
- License:
- Free to try
- Price:
- Free to try
- Publisher Name:
- By Ceometric
- Publisher web site:
- http://www.ceometric.com/
- Operating Systems:
- Windows Vista, Windows XP, Windows 2000
- Additional Requirements:
- Microsoft .NET Framework 2.0
- File Size:
- 497.8K
- Total Downloads:
- 142
G# - computational geometry for .NET Tags
- 2D 2D and 3D composit 2D plot 2D data 2D to 3D 2D to 3D Converter 2D embankment convex planar figure convex 2D map 2D model 2d image 2d plotter 2d interface 2D interior convex hull Delaunay triangulation Delaunay 2D motion demonstration 2D modules generator 2D geometry fit 2D circle display 2D trace generate 2D texture 2D texture generator 2D developer 2D chard 2D Truss Analysis 2D diagram Delaunay triangulator transform 2D coordinates 2D form 2D map segment 2D Arcade GRAFCET 2D 2D code 2D co 2D c 2D graphic 2D reconstruction 2D convolution 2D Coordinate 2D curve plotter display non-convex polyhedra 2D value array 2D field 2D oscillator 2D Viewer 2D pattern 2D Shape convex polygon 2D function 2d evolvent 2D cellular 2D map creator 2D LFO define 2D grammar 2D grammar interpreter Delaunay algorithm 2D programming 2D spatial position polygonal 2D sector convex optimization 2D collision system 2D Benchmark 2D API 2D engine 2D arrays 2D Gel 2D energy eigenstates 2D icon 2D array simulation 2D array 2D Wavelet 2D pointing task divide 2D plan convex lens simulation convex lens use 2D curves A wonderful tool for 2D Sprites
G# - computational geometry for .NET Description
The G# computational geometry namespace for .NET provides fast and robust classes to compute 2D Delaunay triangulations and 2D and 3D convex hulls. The algorithms have O(n*log(n)) running time and implement exact arithmetic, which makes them very robust. G# also supports 2D conforming Delaunay triangulations, 2d minimum area and perimeter enclosing rectangles, point cloud diameters, 3d principal axes bounding boxes and minimum enclosing circles. G# is perfectly suitable for large-scale computations with hundreds of thousands of points. Every method is well documented and almost self-explaining. The 3D convex hull provides mass properties and a tight bounding box along the principal axes of inertia of the convex hull. You can also access some basic floating point and exact arithmetic predicates.
G# - computational geometry for .NET Related Software