Tagged Questions
18
votes
3answers
656 views
Creating a 2D meshing algorithm in Mathematica
As what is proving to be a difficult, but entertaining task, I am attempting to adapt a 2D meshing algorithm created for MATLAB and port it to Mathematica. I understand meshing functions already exist ...
7
votes
2answers
287 views
Create triangular mesh from random list of points
I have a list of points. I would like to take these points and create a mesh of triangles from them, making sure triangles don't overlap. So here's a list of points:
...
6
votes
1answer
609 views
Delaunay Triangulation for 3D Surface Data
I want to do a Delaunay triangulation on scattered 3D surface data. Mathematica itself does it only for 2D through the command DelaunayTriangulation[], which gives ...
6
votes
2answers
339 views
Finding concave hull for separated small clusters
Data :
data3D = Import[file, "VertexData"];
Graphics3D[Point[data3D]]
How to find concave polygon for separated small clusters.
11
votes
2answers
600 views
Finding a Concave Hull
I have a 3d clustered data:
Is there any other way to get concavehull of 3D data points?
19
votes
3answers
456 views
Build a refined grid based on intersecting line
I honestly have no idea where to begin with this problem. In summary, I have a 2D coarse grid with an intersecting line. For an easy example, let's assume it's a 4x4 grid.
I wish to pass through ...
7
votes
1answer
176 views
7
votes
1answer
455 views
Construct a simple mesh or tetrahedral mesh from 3D image surface
I have a 3D Y-Shape hollow tube, not so good surface.
Import["http://dl.dropbox.com/u/68983831/tube02.vtk", "Graphics3D"]
I tried to use following vertex data ...
17
votes
1answer
531 views
How can the {x,y,z} points that fall on the outer boundary of a set of values be selected and smoothly surfaced?
For a given set of x,y,z values, that may, or may not form a uniform shape, how can the center of the data cloud be found, and the surface points be located and a solid smooth surface created from ...
12
votes
2answers
658 views
How to get actual triangles from DelaunayTriangulation[]?
The ComputationalGeometry package has a DelaunayTriangulation[] function. It returns a list of points connected to each point, ...
