2 search results - page 1 / 1 » Minimal enclosing parallelepiped in 3D |
COMGEO
2004
ACM
13 years 10 months ago
2004
ACM
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
CGF
2007
13 years 11 months ago
2007
Geometric constraints have proved to be efficient for enhancing the realism of shape animation. The present paper addresses the computation and the preservation of the volume enc...