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 and 3d principal axes bounding boxes. 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.
People who downloaded this software also downloaded...
SubmitWolf 7.08.002.0418
Auto submit your site to over 2400 search engines.
Web Camera 2.0
web camera solution
EA Install 1.01
Create an installer for MetaTrader Expert Advisors.
Speed Test Silver 1.0.6
website monitoring & full speed testing
WebCloner Professional 2.6.6
site ripper & image downloader
YoPoW 3.3.1
create a web album
Movie Review Magic 4.0.1
Create movie review website.
Html To Jpeg Converter 3000 7.4
Convert your HTML files to JPEG format.
Pdf to Website Converter 3000 7.4
Batch convert PDF files to HTML.
a2z Script Installer 3.0
Install scripts on a Web site as it is to install software on a PC.






