Computing the Discrete Compactness of Orthogonal Pseudo‐Polytopes via Their nD‐EVM Representation
Ricardo Pérez-Aguila · Mathematical Problems in Engineering · 2010
This work is devoted to present a methodology for the computation of Discrete Compactness in n‐dimensional orthogonal pseudo‐polytopes. The proposed procedures take in account compactness′ definitions originally presented for the 2D and 3D cases and extend them directly for considering the nD case. There are introduced efficient algorithms for computing discrete compactness which are based on an orthogonal polytopes representation scheme known as the Extreme Vertices Model in the n‐Dimensional Space (nD‐EVM). It will be shown the potential of the application of Discrete Compactness in higher‐dimensional contexts by applying it, through EVM‐based algorithms, in the classification of video sequences, associated to the monitoring of a volcano′s activity, which are expressed as 4D orthogonal polytopes in the space‐color‐time geometry.