15 years, 4 months ago
Highlights
Community contributions featuredFinding a minimal bounding sphere is easy. There is a trivial n^4 time algorithm for doing it, just search over all sets of tetrahedra over the convex hull of the object, take t…
15 years, 4 months ago
15 years, 4 months ago
Hi everyone! In my spare time, I've started working on a C++0x library for triangulated meshes built on top of the wonderful Eigen library: http://eigen.tuxfami...itle=M…
15 years, 1 month ago
Don't mean to nag or anything, but it was always my favorite feature on the site. Are there any plans to resurrect it in the near future? I really do miss seeing all the coo…
15 years, 5 months ago
This is basically an informal sort of poll, but it is based on a comment that I made in the unlimited detail thread. The main motivation for asking this question should be self…
15 years, 6 months ago
Latest Activity
See all in DiscussionsHi everyone! In my spare time, I've started working on a C++0x library for triangulated meshes built on top of …
15 years, 1 month ago
Finding a minimal bounding sphere is easy. There is a trivial n^4 time algorithm for doing it, just search over …
15 years, 4 months ago
Here is a really dead simple/bone headed algorithm that I've used to do level-set surface reconstruction. Unlike marching cubes/tets/whatever it …
15 years, 4 months ago