Constructing regularity feature trees for solid models

M Li, FC Langbein, RR Martin - … Modeling and Processing-GMP 2006: 4th …, 2006 - Springer
Geometric Modeling and Processing-GMP 2006: 4th International Conference …, 2006Springer
Approximate geometric models, eg as created by reverse engineering, describe the
approximate shape of an object, but do not record the underlying design intent.
Automatically inferring geometric aspects of the design intent, represented by feature trees
and geometric constraints, enhances the utility of such models for downstream tasks. One
approach to design intent detection in such models is to decompose them into regularity
features. Geometric regularities such as symmetries may then be sought in each regularity …
Abstract
Approximate geometric models, e.g. as created by reverse engineering, describe the approximate shape of an object, but do not record the underlying design intent. Automatically inferring geometric aspects of the design intent, represented by feature trees and geometric constraints, enhances the utility of such models for downstream tasks. One approach to design intent detection in such models is to decompose them into regularity features. Geometric regularities such as symmetries may then be sought in each regularity feature, and subsequently be combined into a global, consistent description of the model’s geometric design intent. This paper describes a systematic approach for finding such regularity features based on recovering broken symmetries in the model. The output is a tree of regularity features for subsequent use in regularity detection and selection. Experimental results are given to demonstrate the operation and efficiency of the algorithm.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果