| Popis: |
We present a rapid and effective point simplification algorithm for surface reconstruction which can represent different levels-of-detail. The core of this algorithm is to generate an approximately minimal set of adaptive balls covering the whole surface by defining and minimizing local quadric error functions. First, the feature points are extracted by simple thresholding curvatures, Second, for the non-feature points, they are covered by distinct balls. The size of each ball varies and reflects how curved the local surface is. Once the size of radius is fixed, the points in each ball will be substituted by an optimized point. Thus, the simplified surface consists of extracted feature points and optimized points. we can employ this algorithm to produce coarse-to-fine models by controlling a general error level, and name it as ESimp for short. Worthy of note, the error level of each ball may be adaptively adjusted according to the local curvature and density of the center of this ball which can avoid holes generation. Finally, the simplified points are triangulated by Cocone algorithm. This algorithm has been applied to a set of large scanned models. Experimental results demonstrate that it can generate high-quality surface approximation with feature preservation. |
