Finding the Largest Volume Parallelepipedon of Arbitrary Orientation in a Solid

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 vertice...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2021, Vol.9, p.103600-103609
Main Authors: Molano, Ruben, Caballero, Daniel, Rodriguez, Pablo G., Avila, Maria Del Mar, Torres, Juan P., Duran, Maria Luisa, Sancho, Jose Carlos, Caro, Andres
Format: Article
Language:English
Subjects:
Algorithms
Apexes
Approximation algorithms
Computational efficiency
Computer vision
Feature extraction
parallelepipedon
Parallelogram
Partitioning algorithms
polyhedron
Shape
Three-dimensional displays
volume of interest (VOI)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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}) .
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2021.3098234