Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM (Q555011)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5930820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM |
scientific article; zbMATH DE number 5930820 |
Statements
Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM (English)
0 references
22 July 2011
0 references
Summary: This work contributes 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 \(n\)-dimensional space (\(n\)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 an empirical way and by taking into account both lower dimensional cases (2D and 3D) and higher-dimensional cases (4D and 5D).
0 references
extreme vertices model in the \(n\)-dimensional space (\(n\)D-EVM)
0 references
connected components labeling
0 references
boundary extraction
0 references
0 references
0.7643134593963623
0 references
0.704989492893219
0 references
0.6892592906951904
0 references
0.6733136773109436
0 references
