Graph-based heuristics for recognition of machined features from a 3D solid model
Computer-Aided Design
Introduction to Solid Modeling
Introduction to Solid Modeling
A method for generating volumetric features from surface features
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Geometric algorithms for recognition of features from solid models
Geometric algorithms for recognition of features from solid models
Blend recognition algorithm and applications
Proceedings of the sixth ACM symposium on Solid modeling and applications
Advances in Feature-Based Manufacturing
Advances in Feature-Based Manufacturing
Reconstruction of feature volumes and feature suppression
Proceedings of the seventh ACM symposium on Solid modeling and applications
Recognizing Shape Features in Solid Models
IEEE Computer Graphics and Applications
A small feature suppression/unsuppression system for preparing B-rep models for analysis
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Making the most of using depth reasoning to label line drawings of engineering objects
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Frontal geometry from sketches of engineering objects: is line labelling necessary?
Computer-Aided Design
Detecting design intent in approximate CAD models using symmetry
Computer-Aided Design
Feature suppression based CAD mesh model simplification
Computer-Aided Design
Constructing regularity feature trees for solid models
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
| Hi-index | 0.00 |
This paper reports an algorithm for deletion of blends (or fillets) from Boundary Representation (B-rep) solid models. Blend deletion is usually performed as the first step in feature recognition since it simplifies the model for recognition of volumetric features. The algorithm handles several blend types that include face-face, face-edge and vertex blends. It also handles interactions of blends with other blends and/or volumetric features. The main feature of our approach is the usage of the underlying blend structure in predicting the final topology. This results in fewer intersections and greater predictability than earlier face-deletion approaches, especially for large blend networks. Another unique feature of our algorithm is the recreation of new faces in certain situations of blend deletion.