Efficient Boundary Extraction from Orthogonal Pseudo-Polytopes: An Approach Based on the 𝑛D-EVM
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 t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2011-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2011/937263 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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). |
|---|---|
| ISSN: | 1110-757X 1687-0042 |