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

학위논문(박사)--서울대학교 대학원 :공과대학 컴퓨터공학부,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

Exact medial axis of quadratic NURBS curves

International audienceWe study the problem of the exact computation of the medial axis of planar shapes the boundary of which is defined by piecewise conic arcs. The algorithm used is a tracing algorithm, similar to existing numeric algorithms. We trace the medial axis edge by edge. Instead of keeping track of points on the medial axis, we are keeping track of the corresponding footpoints on the boundary curves, thus dealing with bisector curves in parametric space. We exploit some algebraic and geometric properties of the bisector curves that allow for efficient trimming and we represent bifurcation points via their associated footpoints on the boundary, as algebraic numbers. The algorithm computes the correct topology of the medial axis identifying bifurcation points of arbitrary degree

A triangular grid generation and optimization framework for the design of free-form gridshells

Gridshells have been widely used in various public buildings, and many of them are defined over complex free-form surfaces with complex boundaries. This emphasizes the importance of general grid generation and optimization methods in the initial design stage to achieve visually sound and easy-to-manufacture structure. In this paper, a framework is presented to generate uniform, well-shaped and fluency triangular grids for structural design over free-form surfaces, especially those with complex boundaries. The framework employs force-based algorithms and a connectivity-regularization algorithm to optimize grid quality. First, an appropriate distribution of internal points is randomly generated on the surface. Secondly, a bubble-packing method is employed to increase the uniformity of the initial point distribution, and the points are connected using Delaunay-based triangularization to produce an initial grid with rods of balanced length. Thirdly, the grid connectivity is optimized using a range of edge-operations including edge-flip, collapse and split. The optimization process features a grid relaxation objective which includes the degree of the vertices, leading to improved regularity. As a final step, the grid is relaxed to improve fluency using a net-like method. As part of its contribution, this paper, therefore, proposes a metric for fluency, which can be used to quantitatively evaluate the suitability of a given grid for architectural and structural expression. Two case-study examples are presented to demonstrate the effective execution of the grid generation and optimization framework. It is shown that by using the proposed framework, the fluency index of the grid can be improved by up to 157%

Efficient contact determination between geometric models

http://archive.org/details/efficientcontact00linmN

Topology-preserving watermarking of vector graphics

Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques

Feature-based decomposition of trimmed surface.

Wu Yiu-Bun.Thesis submitted in: September 2004.Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.Includes bibliographical references (leaves 122-123).Abstracts in English and Chinese.Chapter Chapter 1. --- Introduction --- p.1Chapter Chapter 2. --- Previous Works --- p.2Chapter 2.1. --- Surface Patch ApproachChapter 2.2. --- Triangular Facet ApproachChapter Chapter 3. --- The Decomposition Algorithm --- p.7Chapter 3.1. --- Input to the AlgorithmChapter 3.2. --- Overview of the AlgorithmChapter 3.2.1. --- Voronoi Diagram DevelopmentChapter 3.2.2. --- Feature Point DeterminationChapter 3.2.3. --- Correspondence EstablishmentChapter 3.2.4. --- Surface ApproximationChapter 3.3. --- Output of the AlgorithmChapter Chapter 4. --- Voronoi Diagram Development --- p.16Chapter 4.1. --- Triangulation of the Parametric SpaceChapter 4.1.1. --- Degree of TriangulationChapter 4.2. --- Locating BisectorsChapter 4.2.1. --- Bisector CentroidsChapter 4.2.2. --- Sub-triangulationChapter 4.3. --- Finalizing BisectorsChapter Chapter 5. --- Feature Point Determination --- p.31Chapter 5.1. --- Definition of Feature PointsChapter 5.1.1. --- Continuous Sharp TurnsChapter 5.1.2. --- Discrete Sharp TurnsChapter 5.2. --- Parametric Coordinates of Feature PointsChapter Chapter 6. --- Vertices Correspondence Attachment --- p.42Chapter 6.1. --- Validity of CorrespondencesChapter 6.2. --- Shape NormalizationChapter 6.2.1. --- Normalization with Relative PositionChapter 6.3. --- Ranking ProcessChapter 6.3.1. --- Forward and Backward AttachmentChapter 6.3.2. --- Singly Linked Bisector VerticesChapter Chapter 7. --- Surface Fitting --- p.58Chapter 7.1. --- Parametric PatchesChapter 7.1.1. --- Definition of Parametric Patch RegionChapter 7.1.2. --- Local Parametric Coordinate SystemChapter 7.2. --- Parametric GridsChapter 7.2.1. --- Sample Points on the Patch BoundaryChapter 7.2.2. --- Grid GenerationChapter 7.3. --- Surface Patches ConstructionChapter 7.3.1. --- Knot VectorsChapter 7.3.2. --- Control VerticesChapter Chapter 8. --- Worked Example --- p.71Chapter 8.1. --- Example 1: Deformed Plane 1Chapter 8.2. --- Example 2: Deformed Plane 2Chapter 8.3. --- Example 3: SphereChapter 8.4. --- Example 4: Hemisphere 1Chapter 8.5. --- Example 5: Hemisphere 2Chapter 8.6. --- Example 6: ShoeChapter 8.7. --- Example 7: Shark Main BodyChapter 8.8. --- Example 8: Mask 1Chapter 8.9. --- Example 9: Mask 2Chapter 8.10. --- Example 10: Toy CarChapter Chapter 9. --- Result and Analysis --- p.101Chapter 9.1. --- Continuity between PatchesChapter 9.2. --- Special Cases --- p.102Chapter 9.2.1. --- Degenerated PatchChapter 9.2.2. --- S-Shaped FeatureChapter 9.3. --- Comparison --- p.105Chapter 9.3.1. --- Example 1: Deformed Plane 1Chapter 9.3.2. --- Example 2: Deformed Plane 2Chapter 9.3.3. --- Example 3: SphereChapter 9.3.4. --- Example 4: Hemisphere 1Chapter 9.3.5. --- Example 5: Hemisphere 2Chapter 9.3.6. --- Example 6: ShoeChapter 9.3.7. --- Example 7: Shark Main BodyChapter 9.3.8. --- Example 8: Mask 1Chapter 9.3.9. --- Example 9: Mask 2Chapter 9.3.10. --- Example 10: Toy CarChapter Chapter 10. --- Conclusion --- p.119References --- p.12

Feature-based process planning for CNC machining

Journal ArticleToday CNC machining is used successfully to provide program-driven medium lot size manufacturing. The range of applicability of CNC machining should be greater: For small lot sizes such as prototyping or custom products, these machines should provide quick turnaround and flexible production scheduling. To set up for larger lot size production, the CNC machines can be used to construct small lots of production tooling, such as jigs, fixtures, molds and dies

Doctor of Philosophy

dissertationThe medial axis of an object is a shape descriptor that intuitively presents the morphology or structure of the object as well as intrinsic geometric properties of the object’s shape. These properties have made the medial axis a vital ingredient for shape analysis applications, and therefore the computation of which is a fundamental problem in computational geometry. This dissertation presents new methods for accurately computing the 2D medial axis of planar objects bounded by B-spline curves, and the 3D medial axis of objects bounded by B-spline surfaces. The proposed methods for the 3D case are the first techniques that automatically compute the complete medial axis along with its topological structure directly from smooth boundary representations. Our approach is based on the eikonal (grassfire) flow where the boundary is offset along the inward normal direction. As the boundary deforms, different regions start intersecting with each other to create the medial axis. In the generic situation, the (self-) intersection set is born at certain creation-type transition points, then grows and undergoes intermediate transitions at special isolated points, and finally ends at annihilation-type transition points. The intersection set evolves smoothly in between transition points. Our approach first computes and classifies all types of transition points. The medial axis is then computed as a time trace of the evolving intersection set of the boundary using theoretically derived evolution vector fields. This dynamic approach enables accurate tracking of elements of the medial axis as they evolve and thus also enables computation of topological structure of the solution. Accurate computation of geometry and topology of 3D medial axes enables a new graph-theoretic method for shape analysis of objects represented with B-spline surfaces. Structural components are computed via the cycle basis of the graph representing the 1-complex of a 3D medial axis. This enables medial axis based surface segmentation, and structure based surface region selection and modification. We also present a new approach for structural analysis of 3D objects based on scalar functions defined on their surfaces. This approach is enabled by accurate computation of geometry and structure of 2D medial axes of level sets of the scalar functions. Edge curves of the 3D medial axis correspond to a subset of ridges on the bounding surfaces. Ridges are extremal curves of principal curvatures on a surface indicating salient intrinsic features of its shape, and hence are of particular interest as tools for shape analysis. This dissertation presents a new algorithm for accurately extracting all ridges directly from B-spline surfaces. The proposed technique is also extended to accurately extract ridges from isosurfaces of volumetric data using smooth implicit B-spline representations. Accurate ridge curves enable new higher-order methods for surface analysis. We present a new definition of salient regions in order to capture geometrically significant surface regions in the neighborhood of ridges as well as to identify salient segments of ridges

Voronoi Diagrams of Algebraic Distance Fields

International audienceWe design and implement an efficient and certified algorithm for the computation of Voronoi Diagrams (VD's) constrained to a given domain. Our framework is general and applicable to any VD-type where the distance field is given explicitly or implicitly by a polynomial, notably the anisotropic VD or VD's of non-punctual sites. We use the Bernstein form of polynomials and DeCasteljau's algorithm to subdivide the initial domain and isolate bisector, or domains that contain a Voronoi vertex. The efficiency of our algorithm is due to a filtering process, based on bounding the field over the subdivided domains. This allows to exclude functions (thus sites) that do not contribute locally to the lower envelope of the lifted diagram. The output is a polygonal description of each Voronoi cell, within any user-defined precision, isotopic to the exact VD. Correctness of the result is implied by the certified approximations of bisector branches, which are computed by existing methods for handling algebraic curves. First experiments with our C++ implementation, based on double precision arithmetic, demonstrate the adaptability of the algorithm