New Algorithms Based on BPLI Solution for Reconstructing 3-D Surfaces from Parallel Contours
Hongbin Zha · Acta Scicentiarum Naturalum Universitis Pekinesis · 2003
The correspondence and branching problems are vexed problems when reconstructing 3-D surfaces from 2-D parallel contours.BPLI tries to reconstruct non-intersecting surfaces from arbitrary input set of contours and latch a lambent solution of the two problems;however,BPLI remains the shortages of producing degenerate portions and involving time-consuming operations.After an overall analysis of BPLI,this paper proposed a series of new algorithms to improve BPLI approach:first,we proposed a new contour matching algorithm so that the correct similar contour portions of each pair of adjacent slices can be found though the contours are not finely segmented.Secondly,we triangulate the unmatched portions with a new dynamic programming scheme,which has ability to handle degenerate portions in the mesh.These improvements result in a fast triangulating process.