Second order surface analysis using hybrid symbolic and numeric operators

Journal ArticleResults from analyzing the curvature of a surface can be used to improve the implementation, efficiency, and effectiveness of manufacturing and visualization of sculptured surfaces. In this paper, we develop a robust method using hybrid symbolic and numeric operators to create trimmed surfaces each of which is solely convex, concave, or saddle and partitions the original surface. The same method is also used to identify regions whose curvature lies within prespecified bounds

Error Bounded Variable Distance Offset Operator for Free Form Curves and Surfaces

Most offset approximation algorithms for freeform curves and surfaces may be classified into two main groups. The first approximates the curve using simple primitives such as piecewise arcs and lines and then calculates the (exact) offset operator to this approximation. The second offsets the control polygon/mesh and then attempts to estimate the error of the approximated offset over a region. Most of the current offset algorithms estimate the error using a finite set of samples taken from the region and therefore can not guarantee the offset approximation is within a given tolerance over the whole curve or surface. This paper presents new methods to globally bound the error of the approximated offset of freeform curves and surfaces and then automatically derive new approximations with improved accuracy. These tools can also be used to develop a global error bound for a variable distance offset operation and to detect and trim out loops in the offset. 1 Introduction Offset surfaces ar..

A Graphical Method of Computing Offset Curves

Computation of offset curves is an operation critical to many computer-aided design and manufacturing (CAD/CAM) applications. Though simple on the surface, differences between the straightforward mathematical definition and the demands of CAD/CAM environment in the formulation and expression of an offset curve create a problem for which only complicated, approximate solutions are presently available. This thesis explores one of the newest methods of offset curve computation, using graphics hardware to directly compute the offset curve for arbitrary input geometry. Linear segments of the input curve are represented as meshes in 3D space, and the rendering process is used to create a field of depth values from which the offset curve is extracted as an isoline. This results in significant performance enhancements over previous, similar methods. Combined with a quantification of the errors involved in a graphical approach, these advances bring the technique closer to industrial readiness. Algorithm performance is shown to be linear with respect to geometric complexity of the input curve

오프셋 곡선 및 곡면의 자가 교차 검출 및 제거

학위논문(박사)--서울대학교 대학원 :공과대학 컴퓨터공학부,2020. 2. 김명수.Offset curves and surfaces have many applications in computer-aided design and manufacturing, but the self-intersections and redundancies must be trimmed away for their practical use. We present a new method for offset curve and surface trimming that detects the self-intersections and eliminates the redundant parts of an offset curve and surface that are closer than the offset distance to the original curve and surface. We first propose an offset trimming method based on constructing geometric constraint equations. We formulate the constraint equations of the self-intersections of an offset curve and surface in the parameter domain of the original curve and surface. Numerical computations based on the regularity and intrinsic properties of the given input curve and surface is carried out to compute the solution of the constraint equations. The method deals with numerical instability around near-singular regions of an offset surface by using osculating tori that can be constructed in a highly stable way, i.e., by offsetting the osculating torii of the given input regular surface. We reveal the branching structure and the terminal points from the complete self-intersection curves of the offset surface. From the observation that the trimming method based on the multivariate equation solving is computationally expensive, we also propose an acceleration technique to trim an offset curve and surface. The alternative method constructs a bounding volume hierarchy specially designed to enclose the offset curve and surface and detects the self-collision of the bounding volumes instead. In the case of an offset surface, the thickness of the bounding volumes is indirectly determined based on the maximum deviations of the positions and the normals between the given input surface patches and their osculating tori. For further acceleration, the bounding volumes are pruned as much as possible during self-collision detection using various geometric constraints imposed on the offset surface. We demonstrate the effectiveness of the new trimming method using several non-trivial test examples of offset trimming. Lastly, we investigate the problem of computing the Voronoi diagram of a freeform surface using the offset trimming technique for surfaces. By trimming the offset surface with a gradually changing offset radius, we compute the boundary of the Voronoi cells that appear in the concave side of the given input surface. In particular, we interpret the singular and branching points of the self-intersection curves of the trimmed offset surfaces in terms of the boundary elements of the Voronoi diagram.오프셋 곡선 및 곡면은 computer-aided design (CAD)와 computer-aided manufacturing (CAM)에서 널리 이용되는 연산들 중 하나이다. 하지만 실용적인 활용을 위해서는 오프셋 곡선 및 곡면에서 생기는 자가 교차를 찾고 이를 기준으로 오프셋 곡선 및 곡면에서 원래의 곡선 및 곡면에 가까운 불필요한 영역을 제거하여야한다. 본 논문에서는 오프셋 곡선 및 곡면에서 생기는 자가 교차를 계산하고, 오프셋 곡선 및 곡면에서 생기는 불필요한 영역을 제거하는 알고리즘을 제안한다. 본 논문은 우선 오프셋 곡선 및 곡면의 자가 교차점들과 그 교차점들이 기인한 원래 곡선 및 곡면의 점들이 이루는 평면 이등변 삼각형 관계로부터 오프셋 곡선 및 곡면의 자가 교차점의 제약 조건을 만족시키는 방정식들을 세운다. 이 제약식들은 원래 곡선 및 곡면의 변수 공간에서 표현되며, 이 방정식들의 해는 다변수 방정식의 해를 구하는 solver를 이용하여 구한다. 오프셋 곡면의 경우, 원래 곡면의 주곡률 중 하나가 오프셋 반지름의 역수와 같을 때 오프셋 곡면의 법선이 정의가 되지 않는 특이점이 생기는데, 오프셋 곡면의 자가 교차 곡선이 이 부근을 지날 때는 자가 교차 곡선의 계산이 불안정해진다. 따라서 자가 교차 곡선이 오프셋 곡면의 특이점 부근을 지날 때는 오프셋 곡면을 접촉 토러스로 치환하여 더 안정된 방법으로 자가 교차 곡선을 구한다. 계산된 오프셋 곡면의 자가 교차 곡선으로부터 교차 곡선의 $xyz$-공간에서의 말단 점, 가지 구조 등을 밝힌다. 본 논문은 또한 바운딩 볼륨 기반의 오프셋 곡선 및 곡면의 자가 교차 곡선 검출을 가속화하는 방법을 제시한다. 바운딩 볼륨은 기저 곡선 및 곡면을 단순한 기하로 감싸고 기하 연산을 수행함으로써 가속화에 기여한다. 오프셋 곡면의 자가 교차 곡선을 구하기 위하여, 본 논문은 오프셋 곡면의 바운딩 볼륨 구조를 기저 곡면의 바운딩 볼륨과 기저 곡면의 법선 곡면의 바운딩 볼륨의 구조로부터 계산하며 이때 각 바운딩 볼륨의 두께를 계산한다. 또한, 바운딩 볼륨 중에서 실제 오프셋 곡선 및 곡면의 자가 교차에 기여하지 않는 부분을 깊은 재귀 전에 찾아서 제거하는 여러 조건들을 나열한다. 한편, 자가 교차가 제거된 오프셋 곡선 및 곡면은 기저 곡선 및 곡면의 보로노이 구조와 깊은 관련이 있는 것이 알려져 있다. 본 논문에서는 자유 곡면의 연속된 오프셋 곡면들로부터 자유 곡면의 보로노이 구조를 유추하는 방법을 제시한다. 특히, 오프셋 곡면의 자가 교차 곡선 상에서 나타나는 가지 점이나 말단 점과 같은 특이점들이 자유 곡면의 보로노이 구조에서 어떻게 해석되는지 제시한다.1. Introduction 1 1.1 Background and Motivation 1 1.2 Research Objectives and Approach 7 1.3 Contributions and Thesis Organization 11 2. Preliminaries 14 2.1 Curve and Surface Representation 14 2.1.1 Bezier Representation 14 2.1.2 B-spline Representation 17 2.2 Differential Geometry of Curves and Surfaces 19 2.2.1 Differential Geometry of Curves 19 2.2.2 Differential Geometry of Surfaces 21 3. Previous Work 23 3.1 Offset Curves 24 3.2 Offset Surfaces 27 3.3 Offset Curves on Surfaces 29 4. Trimming Offset Curve Self-intersections 32 4.1 Experimental Results 35 5. Trimming Offset Surface Self-intersections 38 5.1 Constraint Equations for Offset Self-Intersections 38 5.1.1 Coplanarity Constraint 39 5.1.2 Equi-angle Constraint 40 5.2 Removing Trivial Solutions 40 5.3 Removing Normal Flips 41 5.4 Multivariate Solver for Constraints 43 5.A Derivation of f(u,v) 46 5.B Relationship between f(u,v) and Curvatures 47 5.3 Trimming Offset Surfaces 50 5.4 Experimental Results 53 5.5 Summary 57 6. Acceleration of trimming offset curves and surfaces 62 6.1 Motivation 62 6.2 Basic Approach 67 6.3 Trimming an Offset Curve using the BVH 70 6.4 Trimming an Offset Surface using the BVH 75 6.4.1 Offset Surface BVH 75 6.4.2 Finding Self-intersections in Offset Surface Using BVH 87 6.4.3 Tracing Self-intersection Curves 98 6.5 Experimental Results 100 6.6 Summary 106 7. Application of Trimming Offset Surfaces: 3D Voronoi Diagram 107 7.1 Background 107 7.2 Approach 110 7.3 Experimental Results 112 7.4 Summary 114 8. Conclusion 119 Bibliography iDocto

Procesado de geometría en CAGD mediante S-series

El diseño geométrico asistido por ordenador (CAGD) se basa en la representación de entidades geométricas en el estándar nurbs, por lo que se debe obtener una aproximación polinómica o racional de aquellas funciones trascendentes, entidades que no pueden ser expresadas en la base de Bernstein. En principio se podría pensar en una aproximación mediante series de Taylor truncadas. De esta forma se obtendría una buena aproximación alrededor de un punto, pero se precisarían grados muy elevados para errores pequeños y los programas de CAD tienen limitado el grado maximo admisible. Una forma de evitar estos grados elevados seria conectar varios desarrollos de Taylor, pero en este caso aparecerían huecos en la unión de dos expansiones, algo inaceptable en una representación para CAD. En esta tesis se introduce la herramienta matemática básica empleada en este trabajo, las s-series. Estas series resultan de la base s-monomial, basada en expansiones de hermite en un intervalo unitario de la variable. Asimismo, se describen las estrategias para calcular de manera eficiente la aproximación de una entidad mediante s-series. Seguidamente, se comparan las aproximaciones mediante s-series con las basadas en series de poisson. A continuación, se aproxima la clotoide como ejemplo de aplicación de las estrategias de aproximación mediante s-series expuestas. Finalmente, se aplican las s-series a las técnicas de deformación. El objetivo de este capítulo consiste en conseguir una aproximación polinómica Bernstein-Bezier de los objetos deformados

Piecewise Arc-Length Parameterized NURBS Tool Paths Generation for 3-Axis CNC Machining of Accurate, Smooth Sculptured Surfaces

In current industrial applications many engineering parts having complex shapes are designed using sculptured surfaces in CAD system. Due to the lack of smooth motions and accurate machining of these surfaces using standard linear and circular motions in conventional CNC machines, new commercial CNC systems are equipped with parametric curve interpolation function. However, in some applications these surfaces can be very complex that are susceptible to gouging and due to the approximation of; CL-path in CAM system and path parameter in real –time, high machining accuracy, smooth kinematic and feed-rate profiles, are difficult to achieve. This dissertation focuses on developing algorithms that generate tool paths in NURBS form for smooth, high speed and accurate sculptured surface machining. The first part of the research identifies and eliminates gouge cutter location (CL) point from the tool path. The proposed algorithm uses global optimization technique (Particle Swarm Optimization) to check all the CC-points along a tool-path with high accuracy, and only gouging free CC-points are used to generate the set of valid CL-points. Mathematical models have been developed and implemented to cover most of the cutter shapes, used in the industry. In the second phase of the research, all valid CL-points along the tool-path are used to generate CL-path in B-spline form. The main contribution of this part is to formulate an error function of the offset approximation and to represent it in NURBS form to globally bound the approximation errors. Based on this error function, an algorithm is proposed to generate tool-paths in B-spline from with; globally controlled accuracy, fewer control points and low function degree, compared to its contemporaries. The proposed approach thus presents an error-bounded method for B-spline curve approximation to the ideal CL-path within the accuracy. This part of research has two components, one is for 2½- axis (pocket) and the other one is for 3-axis (surface) CNC machining. The third part deals with the problem of CL-path parameter estimation during machining in real time. Once the gouging free CL-path in NURBS form with globally controlled accuracy is produced, it is re-parameterized with approximate arc-length in the off-line stage. The main features of this work are; (1) sampling points and calculating their approximate arc-lengths within error bound by decomposing the input path into Bezier curve segments, (2) fitting the NURBS curve with approximate arc-length parameter to the sample points until the path and parameterization errors are within the tolerance, and (3) segment the curve into pieces with different feed rates if during machining the cutter trajectory errors are beyond the tolerance at highly curved regions in the NURBS tool path

Finite element method in cooling analysis and design of plastic injection moulds

Ph.DDOCTOR OF PHILOSOPH