The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm

摘要: In many three-dimensional imaging applications the scene is represented by a array of volume elements, or voxels for short. A subset Q specified some property. The objects in are then defined as subsets formed which “connected” appropriate sense. It often interest to detect and display surface an object scene, say one it.In this paper, problem detection translated into traversal directed graph, G. nodes G correspond faces separating from not Q. has been proven that connected subgraphs surfaces components (i.e., scene). Further properties graph have proven, allow us keep number marked (needed avoid loops traversal) small fraction total visited nodes.This boundary algorithm implemented. We discuss interaction between underlying mathematical theory design working software. illustrate software on clinical studies input computed tomographic (CT) data output dynamically rotating displays isolated organs. Even though medical application leads very large scale problems, our allows use method routinely minicomputer CT scanner.