TY - GEN
T1 - Algorithms to detect geometric interactions in a feature-based design system
AU - Talwar, Rajeev
AU - Manoochehri, Souran
N1 - Publisher Copyright:
© 1994 American Society of Mechanical Engineers (ASME). All rights reserved.
PY - 1994
Y1 - 1994
N2 - This paper presents efficient and accurate algorithms for the analytical detection of geometric interactions between features in a CAD environment. The developed methodology is meant to be utilized in a knowledge-based design system using feature-based modeling. The algorithms take surface information from the CAD system and use geometric inferencing to evaluate these interactions. Features represented by both convex and concave polyhedra are considered. The methodology developed here is able to deal with concave features effectively and, therefore, eliminates the need for their decomposition into convex subfeatures. Sets of conditional statements based on simple and elegant rules have been developed to distinguish different types of interactions. Feature interactions are classified as intersecting or non-intersecting. For the non-intersecting cases, the features can be contained or separate and, for both cases, they can touch each other through an edge, a vertex and/or a surface. For the intersecting cases, intersections through a surface, an edge, a common edge and a common surface are identified. For all the cases the vertices, edges and surfaces involved in the interactions are identified and the relevant distances are evaluated. A computer program has been successfully implemented for polyhedral features and examples have been given to demonstrate its effectiveness.
AB - This paper presents efficient and accurate algorithms for the analytical detection of geometric interactions between features in a CAD environment. The developed methodology is meant to be utilized in a knowledge-based design system using feature-based modeling. The algorithms take surface information from the CAD system and use geometric inferencing to evaluate these interactions. Features represented by both convex and concave polyhedra are considered. The methodology developed here is able to deal with concave features effectively and, therefore, eliminates the need for their decomposition into convex subfeatures. Sets of conditional statements based on simple and elegant rules have been developed to distinguish different types of interactions. Feature interactions are classified as intersecting or non-intersecting. For the non-intersecting cases, the features can be contained or separate and, for both cases, they can touch each other through an edge, a vertex and/or a surface. For the intersecting cases, intersections through a surface, an edge, a common edge and a common surface are identified. For all the cases the vertices, edges and surfaces involved in the interactions are identified and the relevant distances are evaluated. A computer program has been successfully implemented for polyhedral features and examples have been given to demonstrate its effectiveness.
UR - http://www.scopus.com/inward/record.url?scp=85103552886&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85103552886&partnerID=8YFLogxK
U2 - 10.1115/DETC1994-0071
DO - 10.1115/DETC1994-0071
M3 - Conference contribution
AN - SCOPUS:85103552886
T3 - Proceedings of the ASME Design Engineering Technical Conference
SP - 307
EP - 314
BT - 20th Design Automation Conference
T2 - ASME 1994 Design Technical Conferences, DETC 1994, collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium
Y2 - 11 September 1994 through 14 September 1994
ER -