Relevant Degree Programs
Affiliations to Research Centres, Institutes & Clusters
Complete these steps before you reach out to a faculty member!
- Familiarize yourself with program requirements. You want to learn as much as possible from the information available to you before you reach out to a faculty member. Be sure to visit the graduate degree program listing and program-specific websites.
- Check whether the program requires you to seek commitment from a supervisor prior to submitting an application. For some programs this is an essential step while others match successful applicants with faculty members within the first year of study. This is either indicated in the program profile under "Admission Information & Requirements" - "Prepare Application" - "Supervision" or on the program website.
- Identify specific faculty members who are conducting research in your specific area of interest.
- Establish that your research interests align with the faculty member’s research interests.
- Read up on the faculty members in the program and the research being conducted in the department.
- Familiarize yourself with their work, read their recent publications and past theses/dissertations that they supervised. Be certain that their research is indeed what you are hoping to study.
- Compose an error-free and grammatically correct email addressed to your specifically targeted faculty member, and remember to use their correct titles.
- Do not send non-specific, mass emails to everyone in the department hoping for a match.
- Address the faculty members by name. Your contact should be genuine rather than generic.
- Include a brief outline of your academic background, why you are interested in working with the faculty member, and what experience you could bring to the department. The supervision enquiry form guides you with targeted questions. Ensure to craft compelling answers to these questions.
- Highlight your achievements and why you are a top student. Faculty members receive dozens of requests from prospective students and you may have less than 30 seconds to pique someone’s interest.
- Demonstrate that you are familiar with their research:
- Convey the specific ways you are a good fit for the program.
- Convey the specific ways the program/lab/faculty member is a good fit for the research you are interested in/already conducting.
- Be enthusiastic, but don’t overdo it.
G+PS regularly provides virtual sessions that focus on admission requirements and procedures and tips how to improve your application.
Graduate Student Supervision
Doctoral Student Supervision (Jan 2008 - Nov 2020)
This thesis presents a new computer-aided design (CAD) modeling approach for three-dimensional objects. Improving CAD modeling efficiency has always been a central topic in the CAD domain, especially for model editing. Currently, two CAD modeling paradigms, each with its own capabilities and limitations, dominate this subject. The parametric modeling paradigm offers great flexibility for global model edits involving preplanned parametrics but becomes very rigid for unplanned model edits. The very recent direct modeling paradigm provides flexible local model edits but barely supports parametric (global) edits. In order to improve modeling efficiency, flexible local and global model editing need to coexist. This work proposes a novel modeling approach for this purpose, which integrates variational modeling with direct modeling. It is for this reason that this approach is named variational direct modeling. The underlying problem for variational direct modeling is information inconsistency resolution. There are three layers of information in a model: geometry, topology, and constraint. When an information layer is edited, the changes are not reflected in the others automatically. As a result, the consistency of the three information layers in the pre-edit model is broken, and an invalid model is generated. There often exist many options for resolving such inconsistencies, and the fundamental challenge lies in ensuring the validity of resulting models, which requires systematic decision-making among the options. Unfortunately, there has not been much existing research work on such decision-making.The main contributions of this thesis include a thorough analysis of the information inconsistencies and novel, systematic decision-making methods to resolve them. The analysis primarily discusses what forms the inconsistencies take, based on which, effective methods are proposed to take out these inconsistencies and to rethink the relevant information. The presented methods yield a modeling result that (1) is guaranteed to be valid (being solid and well-constrained) and (2) attains a continuous model shape variation for direct edits and (3) exhibits a minimal model variation for parametric edits. These methods have been validated through a series of case studies.
Geometric modeling is an essential part of process planning and verification step in the modern manufacturing practice that employs complex operations such as multi-axis milling. Geometric modeling by itself is used for tool path generation and verification. It is also essential to create important input for mechanistic simulation. Due to this great relevance, many geometric modeling methods have been employed for machining simulation. However it is still a challenge to obtain acceptable combination of accuracy, efficiency and robustness from most of the existing methods. The best known modeling methods also appear to have reached a saturation point. Yet the industrial machining cases are ever increasing in complexity and it demands for a faster method maintaining the acceptable level of accuracy.This thesis presents an enhanced voxel representation format for modeling the machined workpiece geometry in general milling operations. The modeling format is named as Frame-Sliced Voxel representation (FSV-rep) as it uses a novel concept of frame-sliced voxels to represent the boundary of the workpiece volume in a multi-level surface voxel representation for memory-efficient implementation. Frame-sliced voxels enables approximation of the workpiece surface to achieve sub-voxel details. This thesis further identifies an efficient three-step update process that can be followed to compute machined part geometry from an initial FSV-rep workpiece model and set of tool paths. To be computationally feasible and yet robustly handling all tool path types, suitable swept volume representations are identified for various tool path categories. The three-step update process is then used in customized ways for the different categories to utilize the salient features of each. A robust and efficient approach to generate standard surface representation of the machined part geometry from the updated FSV-rep model is also developed.Results show that the FSV-rep model is able to provide acceptable accuracy levels while being significantly faster than popular modeling methods for machined part geometry computation in general multi-axis machining. The specialized swept volume representation identified for planar and 3-axis straight cut operations is further improving the FSV-rep update performance to be up to an order of magnitude faster than possible with general sampled swept volume representations.
Manufactured aero-engine blades are normally inspected in sections. Given discrete section-specific data points, the related geometric error evaluation task for three-dimensional tolerances of the blades is challenging and not yet well studied by researchers. Particularly, the existing method shows limited effectiveness in detecting position error and difficulty in accurate estimation of orientation error of airfoil sections. Moreover, touch-probes on a coordinate measuring machine are traditionally used to collect sectional coordinate data, which is a lengthy process as the data is collected through probe contact with the blade surface. Blade manufacturers would rather use 3D laser scanning that can complete data acquisition much faster. However, this poses a new challenge to data analysis. The collected set of points, referred to as point cloud, is all over the surface rather than at the desired, pre-specified sections. Thus, generating reliable section-specific data from the massive, unorganized scanned data points remains a problem to be solved. This thesis first presents a new methodology for evaluating three-dimensional tolerances of airfoil sections based on reconstructing the airfoil profiles from section-specific data points. According to a given measurement uncertainty, a progressive curve fitting scheme is proposed to generate the airfoil profile that meets the uncertainty constraint. Subsequently, the profile is utilized in related feature extraction of the proposed error evaluation approach. The second part of the thesis focuses on generating the reliable section-specific data points from the complete surface scan. An adaptive surface projection of data points onto the pre-specified section plane is proposed. A localized surface-fitting scheme is devised for this purpose. The main challenge lies in the selection of local data points, referred to as local neighborhood, for surface fitting. In particular, with the non-uniform distribution of data points in a noisy point cloud, existing neighborhood selection methods lead to biased fitting results. To avoid bias, a method of establishing balanced local neighborhood for surface fitting is proposed. An automated technique is also presented for systematic identification of eligible points for projection. The proposed computational framework in this thesis enables fully automatic and accurate evaluation of geometric errors using the latest high-speed geometric inspection platform.
The ease and freedom of shape manipulation achievable through physical modeling materials such as clay for engineering design is steps beyond what is attainable through current computer-aided design (CAD) modelers. With the current CAD modeling paradigm, which creates models through a composition of features constrained by closed-form mathematical formulations, the flexibility in model shape manipulation is limited. As a result, many complex engineering shape designs are either completed in the physical regime then digitized or in the computer-graphics domain where modeling flexibility is significantly higher. Unfortunately, the gain in modeling flexibility is achieved at the expense of well-controlled feature information and modeling precision and accuracy. The resulting models are featureless inexact entities. In order to bring forth geometric modeling flexibility while retaining feature information along with modeling precision and accuracy, this thesis presents a novel hybrid CAD modeler. The hybrid modeler utilizes triangle mesh model representation with the notion of feature imposed as a separate but associated feature information layer. This allows the prismatic features on a model to be modified unrestrictedly without loss of feature information. Users can freely modify the model geometry beyond what is permissible by the current CAD modelers’ feature formulations/management. A robust feature segmentation scheme that divides a triangle mesh model into its elementary features automatically categorizes the unconstrained user modifications into prismatic features and updates the associated feature information layer. An idealization module completes the prismatic feature information extraction process and updates the mesh model to accurately reflect the newly detected/extracted features. Feature-based model editing is incorporated to permit accurate and precise feature-based editing and to maximize the ease-of-use of the hybrid modeler. Accordingly, the hybrid modeler consists of four modules: feature segmentation, feature idealization, unconstrained feature-free model modification and feature-based model editing. With the proposed hybrid modeler, modeling flexibility as well as precision and accuracy are satisfied simultaneously. The hybrid modeler provides the user with a flexible modeling environment for creating and modifying prismatic engineering design models.
3D scanners have become widely used in many industrial applications in reverse engineering, quality inspection, entertainment industry, etc. Despite the popularity of 3D scanners, the raw scanned data, referred to as point cloud, is often contaminated by outliers not belonging to the scanned surface. Moreover, when the scanned surface is highly reflective, outliers become much more extensive due to specular reflections. Such outliers cause considerable issues to point cloud applications and thus need to be removed through an outlier detection process. Considering the commonness of reflective surfaces in mechanical parts, it is critical to investigate the outlier formation mechanism and develop methods to effectively remove outliers. However, research on how outliers are formed in scanning reflective surfaces is very limited. Meanwhile, existing outlier removal methods show limited effectiveness in detecting extensive outliers.This thesis investigates the outlier formation mechanism in scanning reflective surfaces using laser scanners, and develops outlier removal algorithms to effectively and efficiently detect outliers in the scanned point clouds. The overall objective is to remove outliers in a raw data to obtain a clean point cloud in order to ensure the performance of point cloud applications. In particular, two outlier formation models, mixed reflections and multi-path reflections, are proposed and verified through experiments. The effects of scanning orientation on outlier formation are also experimentally investigated. A guidance of proper scan path planning is provided in order to reduce the occurrence of outliers. Regarding outlier removal, a rotating scan approach is proposed to efficiently remove view-dependent outliers. A flexible and effective algorithm is also presented to detect the challenging non-isolated outliers as well as other outliers.
No abstract available.
Master's Student Supervision (2010 - 2018)
For complex sheet metal parts, multiple stamping stages are needed in a sequence. In today’s industry, intermediate parts are transferred between stages automatically by feeding as a strip (progressive die) or a blank (transfer die). Although progressive/transfer dies are highly automated, transfer system parameters need to be predefined. These parameters must ensure that the part is transferred to next stage quickly and safely. However, due to highly complex geometry and motion in the die system, these parameters are conventionally finalized manually according to designers’ experience. In this thesis, algorithms are proposed to optimize transfer system parameters in transfer die, according to the geometry and motion restrictions of the entire system. Two algorithms are proposed to complete a two-step optimization process. In the first step, the geometry of the die set and parts are analyzed. Based on Siemens NX software and customized kinematic model, motions of die components are simulated, an “Obstacle Map” is generated to record the potential collisions between parts (and grippers) and die set during the part transfer process. Obstacle map can be regarded as an inherent property of the entire die system geometry, which can be utilized not only for the optimization algorithm proposed in the second step, but also for future research. In the second step, with obstacle map, motions of the transfer system are analyzed. According to system motion capacity and freedom of modification in practice, transfer system parameters are optimized. The core of the algorithm in this step is to apply overlap between motions to reduce the transfer duration. Lift stroke and press stroke are also optimized when modifications are allowed. The optimized transfer system parameters result in improved strokes per minute, while all the obstacles in the obstacle map are bypassed. One case study for a typical transfer die system with 14 initial SPM is performed to show the effectiveness of the proposed algorithms. Four levels of optimization are conducted with increasing freedom of modification: initial speed -> maximum speed -> allow lift stroke modification -> allow press stroke modification. The results show that the proposed algorithms are valid, SPM can be improved (22.9 -> 26.52 -> 26.61 -> 27.99) in different situations. Some topics can be further addressed based on the works in this thesis, future works can focus on algorithm expansion to progressive die, and algorithm improvements for more complex cases.
A new method is presented to generate ball-end milling tool paths for the efficient three-axis machining of sculptured surfaces. The fundamental principle of the presented method is to generate the tool paths according to a preferred feed direction (PFD) field derived from the surface to be machined. In this work, the PFD at any point on the surface is the feed direction that maximizes the machining strip width. Theoretically, tool paths that always follow the direction of maximum machining strip width at each cutter contact point on the surface would maximize material removal, which leads to the shortest overall tool path length. Scallops are generated when a surface is machined using three-axis ball-end mills. There is no redundant machining if the scallop height is always maximized and the neighboring machining strips do not overlap. Unfortunately, these overlaps commonly exist for tool paths always following the preferred directions. Such redundant machining can be reduced via iso-scallop tool paths. Nonetheless, iso-scallop tool paths do not in general follow the preferred feed directions. To attain maximum machining efficiency via generating the shortest overall tool path length, the presented method analyzes the PFD field of the surface and segments the surface into distinct regions with similar PFD's by identifying the degenerate points and generating their separatrices. The tool paths of each region are generated by the iso-scallop method to mitigate redundant machining. Since a sequential approach is employed to generate the iso-scallop tool paths, an initial tool path is selected in such a way that the growing deviations of the subsequent tool paths from the PFD's are not significant. The proposed method has been validated with numerous case studies, showing that the generated tool paths have a shorter overall length compared with those generated by the existing methods.
This thesis presents a novel geometric modeling methodology of cutter-workpiece engagement extraction for general milling processes. Cutter-workpiece engagement (CWE) geometry is the instantaneous contact area between the cutter and the in-process workpiece. It defines how the cutting edge enters and exits the workpiece. It plays a crucial role for process simulation and directly effects the calculation of cutting force, torque and et cetera. Based on the result of physical simulation, the milling process can be optimized and the machining performance can be improved. Successful optimization depends on the accuracy of the extracted CWE.The difficulty and challenge of CWE extraction comes from various types of cutters, changing geometry of in-process workpiece and multi-axis tool path of cutter movement. Existing methods confront difficulty to be available for general milling processes, which means for any type of cutter, any shape of in-process workpiece and any tool path, even with self-intersections. To fulfill the requirement of generality, this thesis proposes to model all geometries as triangle meshes throughout the simulation and certain strategy of CWE extraction is applied. Our methodology adopts ball pivoting algorithm for cutter swept volume generation. Octree space partition method is applied to speed up triangle-to-triangle intersection calculation which is used for Boolean operation between meshes. The reported method has been tested on several case studies of different complexity. The effectiveness of the proposed methodology shows its potential for further applications.
Airfoil is the basic profile geometry of impeller and turbine blades. The operational efficiency of these blades is governed by stringent tolerance specifications on the airfoils. The specified tolerances are commonly evaluated from discrete coordinate data collected in sections by a touch-probe coordinate measuring machine (CMM). These measurement data are subject to inspection inaccuracies associated with CMM measurement operation. Apart from well-known inspection parameters like profile tolerance, profile thickness and edge radius, the leading edge (LE) and trailing edge (TE) are specified with a unique set of geometric parameters like the maximum linear segment length restriction and the minimum curvature radius restriction. This thesis focuses on evaluating these two localized geometric restrictions along the leading edge and trailing edge of an airfoil.This thesis first presents a robust algorithm to identify the longest linear segment. The main feature of the proposed algorithm is the explicit consideration of measurement uncertainty. The algorithm starts by detecting relatively small linear segments and then merges these segments to determine the longest feasible linear segment under given measurement uncertainty. The effect of measurement uncertainty and data point resolution on the performance of the presented algorithm is demonstrated through case studies. Once the linear segments are identified and excluded, the remaining data points only belong to the non-linear segments. As minimum radius can occur at any location, curvature radius at each point along the non-linear segments is evaluated. Curvature radius at a specific point can only be estimated from its neighborhood. The chosen neighborhood size needs to be balanced between capturing local curvature attribute and effectively considering the effect of measurement uncertainty. An algorithm is thus proposed to evaluate radius via a rolling scheme of five consecutive data points in order to retrieve the local curvature information of the mid-point. A statistical approach is employed where all feasible radii are considered in order to reliably estimate the desired radius. Biarc construction is used as a tool to calculate radius. Compared with existing radius estimation methods, the proposed method has demonstrated to yield better accuracy with varying measurement uncertainty and data point resolution.
This thesis presents geometric computing algorithms for the evaluation of geometric errors on the pressure and suction sides of an airfoil section. Airfoil blades such as those in an impeller have a complex freeform geometry which poses significant challenges to the geometric error evaluation tasks. Reliable error evaluation is critical to the impellers as wrongful rejections will lead to significant financial losses. In practice, touch-probe coordinate measuring machines are employed to acquire measurement data points on the impeller blade surface along pre-specified sections. The measurement data points are then used to evaluate against the specified geometric tolerances including the profile tolerance and airfoil thickness control. Profile tolerances can be defined in three ways: bilateral asymmetric, bilateral symmetric, and unilateral. Existing methods for profile error evaluation are not capable of evaluating all three possible types of profile tolerance. These methods are not adaptive with respect to the specified tolerance zone boundaries. This thesis proposes a novel Scaled Minimax Method which is able to address all types of profile tolerance. The proposed method builds on the conventional Minimax Method and utilizes a scaling constant to control the relative positioning of the evaluated profile error zone boundaries. Thickness control is a less-known tolerance specification for airfoil sections. It controls the overall shape deviation of an airfoil section between the pressure and suction sides. The proposed evaluation method is based on determining a minimum error zone via simultaneously shrinking the outer boundary and growing the inner boundary for the involved measurement data points. Numerous case studies have been performed to validate the effectiveness of the proposed geometric error evaluation methods.
Layer manufacturing has emerged as a highly versatile process to produce complex parts compared to conventional manufacturing processes, which are either too costly to implement or just downright not possible. However, this relatively new manufacturing process is characterized by a few outstanding issues that have kept the process from being widely applied. The most detrimental is the lack of a reliable method on a computational geometry level to predict the resulting part error. Layer setup with regard to the contour profile and thickness of each layer is often rendered to operator-deemed best. As a result, the manufactured part accuracy is not guaranteed and the build time is not easily optimized. Even with the availability of a scheme to predict the resulting finished part, optimal layer setup cannot be determined. Current practice generates the layer contours by simply intersecting a set of parallel planes through the computer model of the design part. The volumetric geometry of each layer is then constructed by extruding the layer contour by the layer thickness in the part building direction. This practice often leads to distorted part geometry due to the unidirectional bias of the extruded layers. Because of this, excessive layers are often employed to alleviate the effect of the part distortion. Such form of the distortion, referred to as systematic distortion, needs to be removed during layer setup. This thesis proposes methods to first remove the systematic distortion and then to determine the optimal layer setup based on a tolerance measure. A scheme to emulate the final polished part geometry is also presented. Case studies are performed in order to validate that the proposed method. The proposed scheme is shown to have significantly reduced the number of layers for constructing an LM part while satisfying a user specified error bound. Therefore, accuracy is better guaranteed due to the existence of error measure and control. Efficiency is greatly increased.