Download G# geometry libraries for .NET 2.2.0

Download Now

G# geometry libraries for .NET 2.2.0

Publisher's description

Top-performing and robust geometry libraries for .NET

G# is a computational geometry math library for .NET.

G# supports Delaunay and conforming Delaunay triangulations, 2d and 3d convex hulls, smallest enclosing circles and rectangles, bounding boxes and much more. It easily handles large point sets.

Here are some key features of G# geometry libraries for .NET:

  - 2D Delaunay triangulations

A 2d triangulation of a 3d set of points is the triangulation of the projection of the points onto the XY plane. This simply says that the Z-coordinate is ignored for the triangulation.

A Delaunay triangulation maximizes the minimum angle of all triangles in the triangulation. This property makes it the triangulation of choice for projectable point sets as they occur - for example - in a Digital Terrain Model (DTM) or a Digital Elevation Model (DEM).

G# implements a fast O(n·log(n)) randomized incremental algorithm which enables you to triangulate even very large point sets very fast. G# implements exact arithmetic thus providing ultimate robustness.

Click here to see an example. Click here to see a performance chart.

  - 2D conforming Delaunay triangulations

A 2d conforming Delaunay triangulation allows to insert edge constraints while maintaining the Delaunay property by the insertion of additional triangulation points.

Thus, a conforming Delaunay triangulation can respect holes, islands and boundaries.

  - 2D and 3d convex hulls

A 2d convex hull is the shortest path enclosing a planar set of points. G# finds the convex hull of n planar points in O(n·log(n)) time. Exact arithmetic provides ultimate robustness.

A 3d convex hull encloses a set of 3d points with a minimal surface area. G# finds the convex hull of n 3d points in O(n·log(n)) time. Exact arithmetic provides ultimate robustness.

  - Mass moments of inertia and 3d container loading

Compute mass moments of inertia and the pricipal axes of the mass moments of inertia of 3d convex hulls! Use these methods to compute a bounding box along the principal axes of a 3d convex hull. Click here to see how this bounding box can be used as a fast approximate solution for a 3d container loading problem.

  - Minimum area and perimeter enclosing rectangles

G# uses the rotating caliper technique to compute the minimum area and minimum perimeter enclosing rectangles of a 2d point set in O(n·log(n)) time.  Click here to see an example.

  - Smallest enclosing circles

Compute the smallest enclosing circle of a planar point set in expected O(n) time!

Click here to see an example. Click here to see a performance chart.

  - Stereolithography (STL) file import and export

Import and export binary and ASCII stereolithograpy STL format files. This file format is widely spread and supported by many other software packages.

  - Polyline generation

Convert hundreds of thousands of unordered lines in space into 3d polylines. Ultra fast! A polyline is a list of sorted edges where the end point of each edge is the start point of the next edge.

  - Predicates

Many geometric algorithms base on a few standard tests, whose robustness and performance are crucial for the robustness and performance of the entire algorithm.

G# provides state-of-the-art implementations of the most important predicates. Amongst them, you will find robust exact arithmetic predicates due to the work of Jonathan R. Shewchuck, which have been ported to .NET.

  - Credits

Check out Jonathan R. Shewchuck’s  great "Triangle" site! The exact arithmetic predicates used in G# are a .NET implementation of Jonathan Shewchuck’s predicates in C, which are in the public domain. ceometric can not guarantee that the ported predicates work correctly. Nevertheless, they never failed in numerous tests. If you have problems using them, please report.

Changes on the new version:
Surface reconstruction from unordered wireframe edges.



DownloadBuy Now

Related software downloads:

HTML code for linking to this page:

Related Tags:

  c# linear algebra      C# math      C# convex hulls      C# geometry      C# triangulation      C# polyline      .NET linear algebra      .NET math      .NET convex hulls      .NET geometry      .NET triangulation      .NET polyline    

Top searches

spider games card  mkv file player  transfer wma to mp3  Quote tracker  local seo firm  playing a mkv file  send email directly  avi converter mpeg  convert video files avi  backup software solutions  moyea flash video server  convert audio mkv  ovulation fertility chart  modern warfare 2 games  images to download  bingo cards to make  compare two folder  cpu temperature monitor
windows  divx compressor  autocad school  web based remote support
software  home automation market  cr2 converter  Evo to mp4  windows 2008 backup
exchange 

More Tags

User tools

newer version? let us know!
suggest to a friend
report error
add to my alerts

Download Time

Latest Added
More Updates >>

Related Categories

Active X

Basic VB VB DotNet

Compilers & Interpreters

Components & Libraries

Debugging

Delphi

Help Tools

Install & Setup

Management & Distribution

Other

Source Editors

Development >>