Re: 3D caliper
Posted by
Gabriel Landini on
Jan 16, 2010; 4:31pm
URL: http://imagej.273.s1.nabble.com/3D-caliper-tp3689657p3689660.html
On Friday 15 January 2010, Mike Doube wrote:
> How might one find a bounding box that has the least volume, or shortest
> sum of edge lengths, or a non-brute-force Feret?
This seems one way for the bounding box:
http://www.mlahanas.de/CompGeom/opt_bbox.htmHere is a presentation with various methods:
http://www.csam.ucl.ac.be/news/slides/gorissen09.pdfNot sure what is the best method to find the maximum Feret, but if one is
tempted to do it brute force, one should be able to save a lot of time by
computing the convex hull first, as the max Feret *has* to be in the convex
hull (if I am not wrong). And no, I do not think brute force is a good idea.
Cheers,
Gabriel