作者: Ying Bai , Xiao Han , Jerry L. Prince
DOI: 10.1007/S10851-009-0140-7
关键词: Cartesian coordinate system 、 Connected component 、 Digital topology 、 Computer science 、 Computer graphics 、 Adjacency list 、 Image processing 、 Theoretical computer science 、 Octree 、 Simple (abstract algebra) 、 Modelling and Simulation 、 Statistics and Probability 、 Geometry and topology 、 Applied mathematics 、 Condensed matter physics 、 Computer Vision and Pattern Recognition
摘要: The theory of digital topology is used in many different image processing and computer graphics algorithms. Most the existing theories apply to uniform cartesian grids, they are not readily extensible new algorithms targeting at adaptive grids. This article provides a rigorous extension classical framework for octree including characterization adjacency, connected components, simple points. Motivating examples, proofs major propositions, algorithm pseudocodes provided.