Pii: S0010-4485(98)00043-8
نویسندگان
چکیده
This paper describes a new approach to solve the problem of intersecting features extraction. Feature extraction is important from several standpoints—automated process planning, NC machining, automated assembly and virtual prototyping. Feature extraction reported in the literature indicates limited success mostly in extracting a partial list of non-intersecting features. There has not been much success in the extraction of intersecting features. Techniques must continue to be developed to extract intersecting features and identify them as combinations of standard features. Our methods of intersecting feature extraction are different from current methods in that they operate on 2D CAD as input data, thus obviating analysis in complex 3D space. q 1998 Elsevier Science Ltd. All rights reserved
منابع مشابه
Meshfree simulation of deforming domains
Spatial discretization of the domain and/or boundary conditions prevents application of many numerical techniques to physical problems with time-varying geometry and boundary conditions. By contrast, the R-functions method (RFM) for solving boundary and initial value problems discretizes not the domain but the underlying functional space, while the prescribed boundary conditions are satisfied e...
متن کاملMMCs and PPCs as constructs of curvature regions for form feature determination
Shape feature information about a part is required to analyze the part for downstream issues such as manufacturability and assemblability. One method of obtaining the feature information is feature recognition from the geometric model. The current approach called Curvature Region (CR) approach for feature determination from solid models categorizes features into two primitive shape classes: pro...
متن کاملApproximation of developable surfaces with cone spline surfaces
Developable surfaces are modelled with pieces of right circular cones. These cone spline surfaces are well-suited for applications: They possess degree two parametric and implicit representations. Bending sequences and the development can be explicitly computed and the offsets are of the same type. The algorithms are based on elementary analytic and constructive geometry. There appear interesti...
متن کاملThe intersection of two ruled surfaces
This paper presents an eecient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set nding problem for a bivariate function, which is also equivalent to the construction of an implicit curve in the plane. Each connected component of the surface intersection curve corresponds to a connected component in the...
متن کامل