Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM

DOI10.1155/2011/937263zbMath1221.68276OpenAlexW2058023191WikidataQ58690578 ScholiaQ58690578MaRDI QIDQ555011

Ricardo Pérez-Aguila

Publication date: 22 July 2011

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/937263

zbMATH Keywords

connected components labelingboundary extractionextreme vertices model in the \(n\)-dimensional space (\(n\)D-EVM)

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the discrete compactness of orthogonal pseudo-polytopes via their \(n\)D-EVM representation
• LABELING OF N-DIMENSIONAL IMAGES WITH CHOOSABLE ADJACENCY OF THE PIXELS
• Connected Component Labeling Using Quadtrees
• Linear-time connected-component labeling based on sequential local operations
• Constructive validity is nonarithmetic
• Sequential Operations in Digital Picture Processing

This page was built for publication: Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM