Please use this identifier to cite or link to this item:
http://hdl.handle.net/10662/20375
Title: | Finding the largest volume parallelepipedon of arbitrary orientation in a solid |
Authors: | Molano Gómez, Rubén Caballero Jorna, Daniel García Rodríguez, Pablo Ávila Vegas, María del Mar Torres Muñoz, Juan Pedro Durán Martín-Merás, María Luisa Sancho Núñez, José Carlos Caro Lindo, Andrés |
Keywords: | Parallelogram;parallelepipedon;polyhedron;volume of interest (VOI) |
Issue Date: | 2021 |
Publisher: | IEEE |
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 nding 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(n3). |
URI: | http://hdl.handle.net/10662/20375 |
ISSN: | 2169-3536 |
Appears in Collections: | DISIT - Artículos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2021_Finding_the_Largest_Volume_Parallelepipedon_of_Arbitrary_Orientation_in_a_Solid.pdf | 1,19 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License