Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-01973-9_88 | ICCS (2) |
Keywords | Field | DocType |
consecutive slice,surface reconstruction,cut plane traverse,cut point,equal number,novel algorithm,heuristic approach,new approach,xz plane,particular cut point,cut plane,cutting plane,boundary | Surface reconstruction,Mathematical optimization,Heuristic,Computer science,Algorithm,Principal axis theorem,Geometry | Conference |
Volume | ISSN | Citations |
5545 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shamima Yasmin | 1 | 6 | 4.75 |
| Abdullah Zawawi Talib | 2 | 65 | 17.73 |