Topological elements form the basis for tasks such as geometric calculations, feature analysis, and direct modeling in 3D CAD systems. Handling these elements is also essential in various automated systems. This study proposes a method to search for topological elements within a boundary representation (B-rep) model by employing topological queries. To address complex scenarios that are difficult to handle using a single query, a topological query procedure that sequentially executes a predefined set of topological queries is used. To verify the effectiveness of the proposed method, experiments were conducted on Test Cases 1, 2, and 3, confirming the successful search of all target topological elements. Furthermore, tests on modified Snap-fit hook A and Bridge B models demonstrated that the same queries remained effective, provided the topological relationships and geometric constraints expressed in the query were preserved. In addition, a search time comparison showed that the proposed method reduced search time by over 90 % compared to manual processes. Finally, in an experiment involving participants with varying levels of programming proficiency, the results indicated that, for a developer with high programming skills, writing topological queries reduced the time required to search for a single topological element by more than 95 % compared to writing the program code.

中文翻译：

---

BRepQL：用于在 B-rep 模型中搜索拓扑元素的查询语言


拓扑元素构成了 3D CAD 系统中几何计算、特征分析和直接建模等任务的基础。在各种自动化系统中，处理这些元件也是必不可少的。本研究提出了一种通过采用拓扑查询在边界表示 （B-rep） 模型中搜索拓扑元素的方法。为了解决使用单个查询难以处理的复杂场景，使用了按顺序执行一组预定义拓扑查询的拓扑查询过程。为了验证所提出的方法的有效性，对测试案例 1 、 2 和 3 进行了实验，证实了所有目标拓扑元素的成功搜索。此外，对改进的 Snap-fit 钩 A 和 Bridge B 模型的测试表明，如果保留查询中表达的拓扑关系和几何约束，相同的查询仍然有效。此外，检索时间比较表明，与手动过程相比，所提出的方法将检索时间缩短了 90% 以上。最后，在一项涉及不同编程熟练程度的参与者的实验中，结果表明，对于具有高编程技能的开发人员来说，与编写程序代码相比，编写拓扑查询将搜索单个拓扑元素所需的时间减少了 95% 以上。