898 research outputs found
Algebraic level sets for CAD/CAE integration and moving boundary problems
Boundary representation (B-rep) of CAD models obtained from solid modeling kernels are commonly used in design, and analysis applications outside the CAD systems. Boolean operations between interacting B-rep CAD models as well as analysis of such multi-body systems are fundamental operations on B-rep geometries in CAD/CAE applications. However, the boundary representation of B-rep solids is, in general, not a suitable representation for analysis operations which lead to CAD/CAE integration challenges due to the need for conversion from B-rep to volumetric approximations. The major challenges include intermediate mesh generation step, capturing CAD features and associated behavior exactly and recurring point containment queries for point classification as inside/outside the solid. Thus, an ideal analysis technique for CAD/CAE integration that can enable direct analysis operations on B-rep CAD models while overcoming the associated challenges is desirable. ^ Further, numerical surface intersection operations are typically necessary for boolean operations on B-rep geometries during the CAD and CAE phases. However, for non-linear geometries, surface intersection operations are non-trivial and face the challenge of simultaneously satisfying the three goals of accuracy, efficiency and robustness. In the class of problems involving multi-body interactions, often an implicit knowledge of the boolean operation is sufficient and explicit intersection computation may not be needed. Such implicit boolean operations can be performed by point containment queries on B-rep CAD models. However, for complex non-linear B-rep geometries, the point containment queries may involve numerical iterative point projection operations which are expensive. Thus, there is a need for inexpensive, non-iterative techniques to enable such implicit boolean operations on B-rep geometries. ^ Moreover, in analysis problems with evolving boundaries (ormoving boundary problems), interfaces or cracks, blending functions are used to enrich the underlying domain with the known behavior on the enriching entity. The blending functions are typically dependent on the distance from the evolving boundaries. For boundaries defined by free form curves or surfaces, the distance fields have to be constructed numerically. This may require either a polytope approximation to the boundary and/or an iterative solution to determine the exact distance to the boundary. ^ In this work a purely algebraic, and computationally efficient technique is described for constructing signed distance measures from Non-Uniform Rational B-Splines (NURBS) boundaries that retain the geometric exactness of the boundaries while eliminating the need for iterative and non-robust distance calculation. The proposed technique exploits the NURBS geometry and algebraic tools of implicitization. Such a signed distance measure, also referred to as the Algebraic Level Sets, gives a volumetric representation of the B-rep geometry constructed by purely non-iterative algebraic operations on the geometry. This in turn enables both the implicit boolean operations and analysis operations on B-rep geometries in CAD/CAE applications. Algebraic level sets ensure exactness of geometry while eliminating iterative numerical computations. Further, a geometry-based analysis technique that relies on hierarchical partition of unity field compositions (HPFC) theory and its extension to enriched field modeling is presented. The proposed technique enables direct analysis of complex physical problems without meshing, thus, integrating CAD and CAE. The developed techniques are demonstrated by constructing algebraic level sets for complex geometries, geometry-based analysis of B-rep CAD models and a variety of fracture examples culminating in the analysis of steady state heat conduction in a solid with arbitrary shaped three-dimensional cracks. ^ The proposed techniques are lastly applied to investigate the risk of fracture in the ultra low-k (ULK) dies due to copper (Cu) wirebonding process. Maximum damage induced in the interlayer dielectric (ILD) stack during the process steps is proposed as an indicator of the reliability risk. Numerical techniques based on enriched isogeometric approximations are adopted to model damage in the ULK stacks using a cohesive damage description. A damage analysis procedure is proposed to conduct damage accumulation studies during Cu wirebonding process. Analysis is carried out to identify weak interfaces and potential sites for crack nucleation as well as damage nucleation patterns. Further, the critical process condition is identified by analyzing the damage induced during the impact and ultrasonic excitation stages. Also, representative ILD stack designs with varying Cu percentage are compared for risk of fracture
Feature Sensitive Three-Dimensional Point Cloud Simplification using Support Vector Regression
Contemporary three-dimensional (3D) scanning devices are characterized by high speed and resolution. They provide dense point clouds that contain abundant data about scanned objects and require computationally intensive and time consuming processing. On the other hand, point clouds usually contain a large amount of redundant data that carry little or no additional information about scanned object geometry. To facilitate further analysis and extraction of relevant information from point cloud, as well as faster transfer of data between different computational devices, it is rational to carry out its simplification at an early stage of the processing. However, the reduction of data during simplification has to ensure high level of information contents preservation; simplification has to be feature sensitive. In this paper we propose a method for feature sensitive simplification of 3D point clouds that is based on epsilon insensitive support vector regression (epsilon-SVR). The proposed method is intended for structured point clouds. It exploits the flatness property of epsilon-SVR for effective recognition of points in high curvature areas of scanned lines. The points from these areas are kept in simplified point cloud along with a reduced number of points from flat areas. In addition, the proposed method effectively detects the points in the vicinity of sharp edges without additional processing. Proposed simplification method is experimentally verified using three real world case studies. To estimate the quality of the simplification, we employ non-uniform rational b-splines fitting to initial and reduced scan lines
Feature Sensitive Three-Dimensional Point Cloud Simplification using Support Vector Regression
Contemporary three-dimensional (3D) scanning devices are characterized by high speed and resolution. They provide dense point clouds that contain abundant data about scanned objects and require computationally intensive and time consuming processing. On the other hand, point clouds usually contain a large amount of redundant data that carry little or no additional information about scanned object geometry. To facilitate further analysis and extraction of relevant information from point cloud, as well as faster transfer of data between different computational devices, it is rational to carry out its simplification at an early stage of the processing. However, the reduction of data during simplification has to ensure high level of information contents preservation; simplification has to be feature sensitive. In this paper we propose a method for feature sensitive simplification of 3D point clouds that is based on epsilon insensitive support vector regression (epsilon-SVR). The proposed method is intended for structured point clouds. It exploits the flatness property of epsilon-SVR for effective recognition of points in high curvature areas of scanned lines. The points from these areas are kept in simplified point cloud along with a reduced number of points from flat areas. In addition, the proposed method effectively detects the points in the vicinity of sharp edges without additional processing. Proposed simplification method is experimentally verified using three real world case studies. To estimate the quality of the simplification, we employ non-uniform rational b-splines fitting to initial and reduced scan lines
Recognition of Occluded Object Using Wavelets
Ph.DDOCTOR OF PHILOSOPH
Recommended from our members
Coupling, Conservation, and Performance in Numerical Simulations
This thesis considers three aspects of the numerical simulations, which arecoupling, conservation, and performance. We conduct a project and addressone challenge from each of these aspects.We propose a novel penalty force to enforce contacts with accurate Coulombfriction. The force is compatible with fully-implicit time integration and theuse of optimization-based integration. In addition to processing collisionsbetween deformable objects, the force can be used to couple rigid bodies todeformable objects or the material point method. The force naturally leads tostable stacking without drift over time, even when solvers are not run toconvergence. The force leads to an asymmetrical system, and we provide apractical solution for handling these.Next we present a new technique for transferring momentum and velocity betweenparticles and MAC grids based on the Affine-Particle-In-Cell (APIC) frameworkpreviously developed for co-locatedgrids. We extend the original APIC paper and show thatthe proposed transfers preserve linear and angular momentum and also satisfyall of the original APIC properties.Early indications in the original APIC paper suggested that APIC might besuitable for simulating high Reynolds fluids due to favorable retention ofvortices, but these properties were not studied further. We use twodimensional Fourier analysis to investigate dissipation in the limit \dt=0.We investigate dissipation and vortex retention numerically to quantify theeffectiveness of APIC compared with other transfer algorithms.Finally we present an efficient solver for problems typically seen inmicrofluidic applications.Microfluidic ``lab on a chip'' devices are small devices that operate on smalllength scales on small volumes of fluid. Designs for microfluidic chips aregenerally composed of standardized and often repeated components connected bylong, thin, straight fluid channels. We propose a novel discretizationalgorithm for simulating the Stokes equations on geometry with these features,which produces sparse linear systems with many repeated matrix blocks. Thediscretization is formally third order accurate for velocity and second orderaccurate for pressure in the norm. We also propose a novel linearsystem solver based on cyclic reduction, reordered sparse Gaussian elimination,and operation caching that is designed to efficiently solve systems withrepeated matrix blocks
Smooth path planning with Pythagorean-hodoghraph spline curves geometric design and motion control
This thesis addresses two significative problems regarding autonomous systems, namely path and trajectory planning. Path planning deals with finding a suitable path from a start to a goal position by exploiting a given representation of the environment. Trajectory planning schemes govern the motion along the path by generating appropriate reference (path) points.
We propose a two-step approach for the construction of planar smooth collision-free navigation paths. Obstacle avoidance techniques that rely on classical data structures are initially considered for the identification of piecewise linear paths that do not intersect with the obstacles of a given scenario.
In the second step of the scheme we rely on spline interpolation algorithms with tension parameters to provide a smooth planar control strategy. In particular, we consider Pythagorean\u2013hodograph (PH) curves, since they provide an exact computation of fundamental geometric quantities. The vertices of the previously produced piecewise linear paths are interpolated by using a G1 or G2 interpolation scheme with tension based on PH splines. In both cases, a strategy based on the asymptotic analysis of the interpolation scheme is developed in order to get an automatic selection of the tension parameters.
To completely describe the motion along the path we present a configurable trajectory planning strategy for the offline definition of time-dependent C2 piece-wise quintic feedrates. When PH spline curves are considered, the corresponding accurate and efficient CNC interpolator algorithms can be exploited
Smooth path planning with Pythagorean-hodoghraph spline curves geometric design and motion control
This thesis addresses two significative problems regarding autonomous systems, namely path and trajectory planning. Path planning deals with finding a suitable path from a start to a goal position by exploiting a given representation of the environment. Trajectory planning schemes govern the motion along the path by generating appropriate reference (path) points.
We propose a two-step approach for the construction of planar smooth collision-free navigation paths. Obstacle avoidance techniques that rely on classical data structures are initially considered for the identification of piecewise linear paths that do not intersect with the obstacles of a given scenario.
In the second step of the scheme we rely on spline interpolation algorithms with tension parameters to provide a smooth planar control strategy. In particular, we consider Pythagorean–hodograph (PH) curves, since they provide an exact computation of fundamental geometric quantities. The vertices of the previously produced piecewise linear paths are interpolated by using a G1 or G2 interpolation scheme with tension based on PH splines. In both cases, a strategy based on the asymptotic analysis of the interpolation scheme is developed in order to get an automatic selection of the tension parameters.
To completely describe the motion along the path we present a configurable trajectory planning strategy for the offline definition of time-dependent C2 piece-wise quintic feedrates. When PH spline curves are considered, the corresponding accurate and efficient CNC interpolator algorithms can be exploited
Computer-Aided Geometry Modeling
Techniques in computer-aided geometry modeling and their application are addressed. Mathematical modeling, solid geometry models, management of geometric data, development of geometry standards, and interactive and graphic procedures are discussed. The applications include aeronautical and aerospace structures design, fluid flow modeling, and gas turbine design
- …