An Approximation Algorithm for Computing Minimum-Length Polygons in 3D Images

摘要: Length measurements in 3D images have raised interest image geometry for a long time. This paper discusses the Euclidean shortest path (ESP) to be calculated loop of face-connected grid cubes orthogonal grid, which are defined by minimum-length polygonal (MLP) curves. We propose new approximation algorithm computing such an MLP. It is much simpler and easier understand implement than previously published algorithms Li Klette. also has straightforward application finding approximate minimumlength arc (MLA), generalization MLP problem. two heuristic simple cube-arc within component, with minimum number between this component. may interpreted as being solution general ESP problem (which known NP-hard) assuming regular subdivision space into uniform size.