Mesh generation from points with x, y and z coordinates

by

here are some other good links for mesh generation and its related work.

• TetGen : A Quality Tetrahedral Mesh Generator http://wias-berlin.de/software/tetgen/

• CGal-Computational Geometry Algorithms Library
http://www.cgal.org/.
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/packages.html#Pkg:Triangulation3.
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/contents.html#part_VI.
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Surface_reconstruction_points_3/Chapter_main.html.
3D Surface Mesh Generation – http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Surface_mesher/Chapter_main.html

• GTSLibrary – The GNU Triangulated Surface Library.
http://gts.sourceforge.net/index.html

• Jonathan Shewchuk – http://www.cs.berkeley.edu/~jrs/
http://www.cs.cmu.edu/~quake/robust.html

• VTK: The Visualization Toolkit (VTK) is an open-source, freely available software system http://www.vtk.org/.

• Volume and Surface Meshing – http://www.cse.ohio-state.edu/~tamaldey/mesh.htm.

• Poly2Tri: An open source CDT library http://code.google.com/p/poly2tri/.

• CM2Mesh Tools – http://www.computing-objects.com/index.php.

• Adaptive tessellation – http://fluxionsdividebyzero.com/p1/math/geometry/g046.html#_3D

• CUBIT – The CUBIT Geometry and Mesh Generation Toolkit.
http://cubit.sandia.gov/index.html

• Geometry in Action – http://www.ics.uci.edu/~eppstein/geom.html

• SlimDX – SlimDX is a free open source framework that enables developers to easily build DirectX applications using .NET technologies such as C#, VB
http://slimdx.org/

More Related Contents:

  1. How to determine if a point is in a 2D triangle? [closed]
  2. Circle line-segment collision detection algorithm?
  3. An algorithm for inflating/deflating (offsetting, buffering) polygons
  4. Algorithm to detect intersection of two rectangles?
  5. How to calculate an angle from three points? [closed]
  6. How to find the intersection point between a line and a rectangle?
  7. Sort points in clockwise order?
  8. How do I efficiently determine if a polygon is convex, non-convex or complex?
  9. Finding whether a point lies inside a rectangle or not
  10. How do you calculate the average of a set of circular data? [closed]
  11. What is the fastest algorithm to calculate the minimum distance between two sets of points?
  12. Is there an efficient algorithm to generate a 2D concave hull?
  13. Largest circle inside a non-convex polygon
  14. How to check if line segment intersects a rectangle?
  15. How to compare two shapes?
  16. Combined area of overlapping circles
  17. Calculate largest inscribed rectangle in a rotated rectangle
  18. Circle-circle intersection points
  19. How to find two most distant points?
  20. Find the set of largest contiguous rectangles to cover multiple areas [duplicate]
  21. Sort Four Points in Clockwise Order
  22. Collision detection of huge number of circles
  23. Create non-intersecting polygon passing through all given points
  24. Determining if two line segments intersect? [duplicate]
  25. Calculating the position of points in a circle
  26. Find if a point is inside a convex hull for a set of points without computing the hull itself
  27. Compute the area of intersection between a circle and a triangle?
  28. determine if a point sits inside an arbitrary shape?
  29. Location of highest density on a sphere
  30. Distance from a point to a polygon

Leave a Comment