Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

This publication has 16 references indexed in Scilit:

• Approximating shortest paths on a convex polytope in three dimensions
  Journal of the ACM, 1997
• BOXTREE: A Hierarchical Representation for Surfaces in 3D
  Computer Graphics Forum, 1996
• Output-sensitive results on convex hulls, extreme points, and related problems
  Discrete & Computational Geometry, 1996
• FastMap
  ACM SIGMOD Record, 1995
• The R*-tree: an efficient and robust access method for points and rectangles
  Published by Association for Computing Machinery (ACM) ,1990
• Applications of random sampling in computational geometry, II
  Discrete & Computational Geometry, 1989
• Approximating the diameter of a set of points in the Euclidean space
  Information Processing Letters, 1989
• An object centered hierarchical representation for 3D objects: The prism tree
  Computer Vision, Graphics, and Image Processing, 1987
• Metric entropy of some classes of sets with differentiable boundaries
  Journal of Approximation Theory, 1974
• A lower bound for the volume of strictly convex bodies with many boundary lattice points
  Transactions of the American Mathematical Society, 1963