Journal of Applied Mathematics
Volume 2011 (2011), Article ID 937263, 29 pages
Research Article

Efficient Boundary Extraction from Orthogonal Pseudo-Polytopes: An Approach Based on the 𝑛 D-EVM

Computer Engineering Institute, The Technological University of the Mixteca (UTM), Carretera Huajuapan-Acatlima Km. 2.5, Huajuapan de León, 69000 Oaxaca, Mexico

Received 9 December 2010; Accepted 9 March 2011

Academic Editor: Tak-Wah Lam

Copyright © 2011 Ricardo Pérez-Aguila. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This work is devoted to contribute with two algorithms for performing, in an efficient way, connected components labeling and boundary extraction from orthogonal pseudo-polytopes. The proposals are specified in terms of the extreme vertices model in the 𝑛 -dimensional space ( 𝑛 D-EVM). An overview of the model is presented, considering aspects such as its fundamentals and basic algorithms. The temporal efficiency of the two proposed algorithms is sustained in empirical way and by taking into account both lower dimensional cases (2D and 3D) and higher-dimensional cases (4D and 5D).