Prev: Connecting to remote kernel
Next: MathWorld MapProjections
From: S. B. Gray on 12 Aug 2010 05:26
I think it was Yves Klett who told me about this:

verts = ComputationalGeometry`Methods`ConvexHull3D[plist][[1, 1]];

where plist is the original list of vertices and verts is the list of
vertices on the convex hull of plist. Very simple and very fast, but it
does not distinguish the triangles on the convex hull from the triangles
having interior lines. Eric's does do that (in fact it returns the hull
in terms of those exterior polygons or triangles), and it's not so easy
to do after doing the command listed above. Fortunately I can
accommodate the extra triangle lines.

Maybe version 8 will have a CH function that does everything.

Steve Gray

From: Yves Klett on 13 Aug 2010 06:52
Steve,

just a guess: if you evaluate

Options[ComputationalGeometry`Methods`ConvexHull3D]

you'll see a lot of options, perhaps some of the non-standard ones will
help you (if you figure out what they actually do). Mind you, nothing is
documented and more probably some kind of temporary precursor to future
stuff.

Regards,
Yves



Am 12.08.2010 11:26, schrieb S. B. Gray:
> t is the original list of vertices and verts is the list of
> vertices on the convex hull of plist. Very simple and very fast, but it
> does not distinguish the triangles on the convex hull from the triangles
> having interior lines. Eric's does do that (in fact it returns the hull
> in terms of those exterior polygons or triangles), and it's not so easy
> to do after doing the command listed above. Fortunately I can
> accommodate the extra triangle lines.

 | 
Pages: 1
Prev: Connecting to remote kernel
Next: MathWorld MapProjections