Abstract

This paper presents a CAD model simplification procedure that consists in recognizing and suppressing blend chains of certain types. The proposed method involves Euler operators (KEV, KEF, and KFMV) developed on top of an open-source geometric modeling kernel. The simplification process consists of two stages: recognition and suppression. The suppression stage ensures the geometric and topological validity of the simplification result. The proposed approach is targeted for use in batch mode, which poses strict requirements to the robustness of the suppression algorithm. The essential properties of the approach are its sustainability, predictability of the result, and extensible architecture, which allows new topological cases to be added without modifying the algorithm’s core. At the recognition stage, the algorithm constructs an attributed adjacency graph, which is then enriched with the information about types of edges, their properties, and assumed kinds of blend faces. At the suppression stage, the algorithm iterates through the adjacency graph and composes candidate blend faces into chains. For each face in a chain, local topology analysis is carried out to determine the corresponding sequence of Euler operators that are supposed to eliminate that face. The algorithm can be extended by adding descriptors of new topological cases into the processing. Upon applying the Euler operators, the affected edges are reconstructed to obtain a geometrically correct boundary representation of the model.

中文翻译：

---

通过自动识别和抑制混合链简化CAD模型

摘要

本文提出了一种CAD模型简化程序，该程序包括识别和抑制某些类型的混合链。所提出的方法涉及在开源几何建模内核之上开发的Euler运算符（KEV，KEF和KFMV）。简化过程包括两个阶段：识别和抑制。抑制阶段可确保简化结果的几何和拓扑有效性。提出的方法旨在用于批处理模式，这对抑制算法的鲁棒性提出了严格的要求。该方法的基本特性是其可持续性，结果的可预测性以及可扩展的体系结构，从而可以在不修改算法核心的情况下添加新的拓扑实例。在识别阶段，该算法构造了一个属性邻接图，然后在其中添加了有关边缘类型，其属性以及假定的混合面类型的信息。在抑制阶段，该算法遍历邻接图并将候选混合面组成链。对于链中的每个面孔，都执行局部拓扑分析以确定应该消除该面孔的欧拉算子的相应顺序。可以通过在处理中添加新拓扑实例的描述符来扩展该算法。在应用Euler算子时，受影响的边缘将被重建以获得模型的几何正确边界表示。该算法遍历邻接图并将候选混合面组成链。对于链中的每个面孔，都执行局部拓扑分析以确定应该消除该面孔的欧拉算子的相应顺序。可以通过在处理中添加新拓扑实例的描述符来扩展该算法。在应用Euler算子时，受影响的边缘将被重建以获得模型的几何正确边界表示。该算法遍历邻接图并将候选混合面组成链。对于链中的每个面孔，都执行局部拓扑分析以确定应该消除该面孔的欧拉算子的相应顺序。可以通过在处理中添加新拓扑实例的描述符来扩展该算法。在应用Euler算子时，受影响的边缘将被重建以获得模型的几何正确边界表示。可以通过在处理中添加新拓扑实例的描述符来扩展该算法。在应用Euler算子时，受影响的边缘将被重建以获得模型的几何正确边界表示。可以通过在处理中添加新拓扑实例的描述符来扩展该算法。在应用Euler算子时，受影响的边缘将被重建以获得模型的几何正确边界表示。