Learn More
In this paper, we present a robust normal estimation algorithm based on the low-rank subspace clustering technique. The main idea is based on the observation that compared with the points around sharp features, it is relatively easier to obtain accurate normals for the points within smooth regions. The points around sharp features and smooth regions are(More)
We presented two integrated solution schemes, sectional feature based strategy and surface feature based strategy, for modeling industrial components from point cloud to surfaces without using triangulation. For the sectional feature based strategy, slicing, curve feature recognition and constrained fitting are introduced. This strategy emphasizes the(More)
In this paper, we propose an automatic hole-filling method, particularly for recovering missing feature curves and corners. We first extract the feature vertices around a hole of a CAD model and classify them into different feature sets. These feature sets are then automatically paired, using ordered double normals, Gaussian mapping and convex/concave(More)
This paper presents a versatile detail editing approach for triangular meshes based on filtering the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates of the mesh vertices, then filter the Laplacian coordinates, and finally reconstruct the mesh from the filtered Laplacian coordinates by solving a linear least square(More)
We propose a robust method for detecting features on triangular meshes by combining normal tensor voting with neighbor supporting. Our method contains two stages: feature detection and feature refinement. First, the normal tensor voting method is modified to detect the initial features, which may include some pseudo features. Then, at the feature refinement(More)