We present a simple yet efficient algorithm for recognizing simple quadric primitives (plane, sphere, cylinder, cone) from triangular meshes. Our approach is an improved version of a previous hierarchical clustering algorithm, which performs pairwise clustering of triangle patches from bottom to top. The key contributions of our approach include a strategy for priority and fidelity consideration of the detected primitives, and a scheme for boundary smoothness between adjacent clusters. Experimental results demonstrate that the proposed method produces qualitatively and quantitatively better results than representative state-of-the-art methods on a wide range of test data.

我们提出了一种简单而有效的算法，用于从三角形网格中识别简单的二次基元（平面，球体，圆柱体，圆锥体）。我们的方法是以前的层次聚类算法的改进版本，该算法从底部到顶部执行三角形补丁的成对聚类。我们方法的主要贡献包括优先考虑优先级和保真度的策略，以及相邻簇之间边界平滑的方案。实验结果表明，在广泛的测试数据上，所提出的方法在质量和数量上均优于代表性的最新方法。