From contours to surfaces: testbed and initial results
CHI '87 Proceedings of the SIGCHI/GI Conference on Human Factors in Computing Systems and Graphics Interface
Optimal surface reconstruction from planar contours
Communications of the ACM
A new general triangulation method for planar contours
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Conversion of complex contour line definitions into polygonal element mosaics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Understanding three-dimensional images: the recognition of abdominal anatomy from computed axial tomograms (cat)
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
ACM Transactions on Graphics (TOG)
Piecewise-linear interpolation between polygonal slices
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
History consideration in reconstructing polyhedral surfaces from parallel slices
Proceedings of the 7th conference on Visualization '96
Scanline surfacing: building separating surfaces from planar contours
Proceedings of the conference on Visualization '00
Straight-skeleton based contour interpolation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Contour interpolation by straight skeletons
Graphical Models
Constructing smooth branching surfaces from cross sections
Proceedings of the 2006 ACM symposium on Solid and physical modeling
G1-smooth branching surface construction from cross sections
Computer-Aided Design
Reconstruction of multi-label domains from partial planar cross-sections
SGP '09 Proceedings of the Symposium on Geometry Processing
Online reconstruction of 3D objects from arbitrary cross-sections
ACM Transactions on Graphics (TOG)
| Hi-index | 0.14 |
A particular style of search is considered that is motivated by the problem of reconstructing the surface of three-dimensional objects given a collection of planar contours representing cross-sections through the objects. An improvement on the simple divide-and-conquer method is presented. The key idea is to locate bottlenecks (minimal separators), which markedly reduces the number of searches required but reduces other measures (e.g. nodes expanded) by only a constant factor. It is observed that for well-behaved search spaces, the search efficiency can be improved further by making 'pessimal guesses'. This suggests a style of search in which the region of the search space thought to be close to the optimal solution (on whatever grounds are available) is examined last, while the outlying regions (the pessimal guesses) are examined first.