This paper describes a novel algorithm for surface reconstruction from slices. A number of slices are extracted from a given data oriented along any of the principal axes. Slices are projected onto the XZ plane and equal number of traversals takes place for each slice by a cut plane oriented along the X axis. As the cut plane traverses along each slice, cut points are extracted. To establish correspondence between two consecutive slices, firstly domain mapping takes place. Then a heuristic approach is taken which is based on the comparison of the number of occurrences of particular cut points between slices. Optimization is performed on the basis of minimal differences of the number of occurrences of particular cut points between consecutive slices. Although heuristic approach is not flawless, this algorithm is able to construct surface of fairly complex objects. The algorithm is dynamic enough as the number of slices and the number of traversals can be adjusted depending on the complexity of the object.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
- A New Approach for Surface Reconstruction Using Slices
Abdullah Zawawi Talib
- Springer Berlin Heidelberg