Hi, guys! My best wishes for a Happy New year!
So I have a small cluster of points in space and I wanted to draw a wireframe. After thinking the problem an undetermined time, I finally got a working function to do the job. Guess what: a subsequent search in the collaboratory let me know that Tom had solved the problem many years before, he he he.
So this time I decided search first and program after
🙂I have a small group of points in space that are generated by a function. I don't know before hand where is each point in space. Generating all the possible connections is easy
but the internal lines are distracting and I prefer if possible not to draw them
Now I'm facing the job of programming a function to find the enclosing polyhedron of a cluster of points. I'm still in the pre-production stage :), i.e. exchanging ideas with my pillow.
So far I know how to detect the outer faces of the polyhedron (using basic vector algebra) but it takes combin(n,3)*(n-3) checks, and I still need to decide how to manage faces of more than 3 coplanar points.
Well, any hint is welcome. Please don't refer me to amazing graphics etc, I'm using Mathcad 2001 and I can only open the oldest sheets.
Saludos,
Al