Abstract
The patch layout of 3D surfaces reveals the high-level geometric and topological structures. In this paper, we study the patch layout computation by detecting and enclosing feature loops on surfaces. We present a hybrid framework which combines several key ingredients, including feature detection, feature filtering, feature curve extension, patch subdivision and boundary smoothing. Our framework is able to compute patch layouts through concave features as previous approaches, but also able to generate nice layouts through smoothing regions. We demonstrate the effectiveness of our framework by comparing with the state-of-the-art methods.
[Display omitted]
•A hybrid framework that can extract patch layouts that are better than the state-of-the-art.•A novel criterion to evaluate the quality of patch layouts.•Improved algorithms for smoothing curves on surfaces.