Re: Tessellating PointCloud (ConvexHull? Delaunay)
Robert Kern <[email protected]>
| Newsgroups | gmane.comp.python.scientific.user |
|---|---|
| Message-ID | <CAF6FJiuKTmVB9cq8pg37t1RpCCoT=mQ+21u85tJtP+XzCYNR2A@mail.gmail.com> |
On Wed, Mar 7, 2018 at 2:15 PM, Samuel Maybury <[email protected]> wrote: > > Hi guys, > Been looking to tesselate a 3D point cloud from array of form [[x1 y1 z1][x2 y2 z2]...[xn yn zn]]. > I tried scipy.spatial.convexhull which worked decently, but has the notable limitation of not handling concaves. The STL I then extracted only had half the triangles, but I think I need to take that up with the maker of numpy-stl. > Still kinda new to scipy (and programming in general) so could someone informed please help? > From what I understand Delaunay triangulates every point in the cloud. Is there a way to limit it to only Tessellating to the nearest? > Or a better method for doing this? As I said before, Delaunay triangulation doesn't do much for reconstructing a surface from a point cloud. Following the MeshLab references[1], it looks like variants of a technique called Poisson reconstruction are standard these days. Googling finds these Python projects, but I have no experience with them: https://github.com/mmolero/pypoisson https://gist.github.com/jackdoerner/b9b5e62a4c3893c76e4c [1] http://www.meshlab.net/#references -- Robert Kern _______________________________________________ SciPy-User mailing list [email protected] https://mail.python.org/mailman/listinfo/scipy-user