1. Finding the Largest Volume Parallelepipedon of Arbitrary Orientation in a Solid
- Author
-
Rubén Molano, María del Mar Ávila, Juan P. Torres, Daniel Caballero, Andrés Caro, Maria Luisa Durán, Jose Sancho, and Pablo G. Rodríguez
- Subjects
Parallelogram ,General Computer Science ,Volume of interest ,Orientation (computer vision) ,Computer science ,Feature extraction ,General Engineering ,Volume (computing) ,Approximation algorithm ,Order (ring theory) ,polyhedron ,TK1-9971 ,parallelepipedon ,volume of interest (VOI) ,Computer vision algorithms ,General Materials Science ,Electrical engineering. Electronics. Nuclear engineering ,Algorithm ,Inscribed figure - Abstract
3D Computer Vision algorithms are a subject of research and application for several industrial processes. The Volume of Interest (VOI) usually refer to sub-objects with basic shapes for computing these algorithms. However, in many cases the objects are available as irregular shapes with many vertices, and in order to apply algorithms effectively, it is essential to compute the largest volume parallelepipedon contained in 3D objects. There are no other approximation algorithms for finding the largest volume parallelepipedon of arbitrary orientation inscribed in a closed 3D contour with a computational cost better than the algorithm proposed in this paper, been $O(n^{3})$ .
- Published
- 2021