An Exact Algorithm for Finding Minimum Oriented Bounding Boxes

@inproceedings{Jylnki2015AnEA,
  title={An Exact Algorithm for Finding Minimum Oriented Bounding Boxes},
  author={Jukka Jyl{\"a}nki},
  year={2015}
}
  • Jukka Jylänki
  • Published 2015
A new method is presented for computing tight-fitting enclosing bounding boxes for point sets in three dimensions. The algorithm is based on enumerating all box orientations that are uniquely determined by combinations of edges in the convex hull of the input point set. By using a graph search technique over the vertex graph of the hull, the iteration can be done quickly in expected O(n(logn)) time for input point sets that have a uniform distribution of directions on their convex hull. Under… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Finding minimal enclosing boxes

International Journal of Computer & Information Sciences • 1985
View 4 Excerpts
Highly Influenced

Geometric Tools for Computer Graphics

P. J. SCHNEIDER, D. EBERLY
Elsevier Science Inc., New York, NY, USA. • 2002
View 4 Excerpts
Highly Influenced

The 3 d quickhull algorithm

J. T. K AJIYA
MathGeoLib : A C + + library for 3 D mathematics and geometry manipulation • 2014

The 3d quickhull algorithm. Game Developers Conference. Available at http://www.gdcvault.com/play/1020141/ Physics-for-Game-Programmers

D. GREGORIUS
2014
View 1 Excerpt

MathGeoLib: A C++ library for 3D mathematics and geometry manipulation. Available at http://clb.demon.fi/MathGeoLib/ and https:// github.com/juj/MathGeoLib

J. JYLÄNKI
2011
View 1 Excerpt

Chinese postman problem (cpp): solution methods and computational time

M. G. FILHO, R. DE AVILA RIBEIRO JUNQUEIRA
Int. J. of Logistics Systems and Management. • 2010

Similar Papers

Loading similar papers…