1,430 research outputs found

    Smooth Parametrizations in Dynamics, Analysis, Diophantine and Computational Geometry

    Full text link
    Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the present paper is to provide a short overview of some results and open problems on smooth parametrization and its applications in several apparently rather separated domains: Smooth Dynamics, Diophantine Geometry, Approximation Theory, and Computational Geometry. The structure of the results, open problems, and conjectures in each of these domains shows in many cases a remarkable similarity, which we try to stress. Sometimes this similarity can be easily explained, sometimes the reasons remain somewhat obscure, and it motivates some natural questions discussed in the paper. We present also some new results, stressing interconnection between various types and various applications of smooth parametrization

    ์˜คํ”„์…‹ ๊ณก์„  ๋ฐ ๊ณก๋ฉด์˜ ์ž๊ฐ€ ๊ต์ฐจ ๊ฒ€์ถœ ๋ฐ ์ œ๊ฑฐ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(๋ฐ•์‚ฌ)--์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› :๊ณต๊ณผ๋Œ€ํ•™ ์ปดํ“จํ„ฐ๊ณตํ•™๋ถ€,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๋ฅผ ์ด์šฉํ•˜์—ฌ ๊ตฌํ•œ๋‹ค. ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ๊ฒฝ์šฐ, ์›๋ž˜ ๊ณก๋ฉด์˜ ์ฃผ๊ณก๋ฅ  ์ค‘ ํ•˜๋‚˜๊ฐ€ ์˜คํ”„์…‹ ๋ฐ˜์ง€๋ฆ„์˜ ์—ญ์ˆ˜์™€ ๊ฐ™์„ ๋•Œ ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ๋ฒ•์„ ์ด ์ •์˜๊ฐ€ ๋˜์ง€ ์•Š๋Š” ํŠน์ด์ ์ด ์ƒ๊ธฐ๋Š”๋ฐ, ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„ ์ด ์ด ๋ถ€๊ทผ์„ ์ง€๋‚  ๋•Œ๋Š” ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„ ์˜ ๊ณ„์‚ฐ์ด ๋ถˆ์•ˆ์ •ํ•ด์ง„๋‹ค. ๋”ฐ๋ผ์„œ ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„ ์ด ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ํŠน์ด์  ๋ถ€๊ทผ์„ ์ง€๋‚  ๋•Œ๋Š” ์˜คํ”„์…‹ ๊ณก๋ฉด์„ ์ ‘์ด‰ ํ† ๋Ÿฌ์Šค๋กœ ์น˜ํ™˜ํ•˜์—ฌ ๋” ์•ˆ์ •๋œ ๋ฐฉ๋ฒ•์œผ๋กœ ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„ ์„ ๊ตฌํ•œ๋‹ค. ๊ณ„์‚ฐ๋œ ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„ ์œผ๋กœ๋ถ€ํ„ฐ ๊ต์ฐจ ๊ณก์„ ์˜ xyzxyz-๊ณต๊ฐ„์—์„œ์˜ ๋ง๋‹จ ์ , ๊ฐ€์ง€ ๊ตฌ์กฐ ๋“ฑ์„ ๋ฐํžŒ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์€ ๋˜ํ•œ ๋ฐ”์šด๋”ฉ ๋ณผ๋ฅจ ๊ธฐ๋ฐ˜์˜ ์˜คํ”„์…‹ ๊ณก์„  ๋ฐ ๊ณก๋ฉด์˜ ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„  ๊ฒ€์ถœ์„ ๊ฐ€์†ํ™”ํ•˜๋Š” ๋ฐฉ๋ฒ•์„ ์ œ์‹œํ•œ๋‹ค. ๋ฐ”์šด๋”ฉ ๋ณผ๋ฅจ์€ ๊ธฐ์ € ๊ณก์„  ๋ฐ ๊ณก๋ฉด์„ ๋‹จ์ˆœํ•œ ๊ธฐํ•˜๋กœ ๊ฐ์‹ธ๊ณ  ๊ธฐํ•˜ ์—ฐ์‚ฐ์„ ์ˆ˜ํ–‰ํ•จ์œผ๋กœ์จ ๊ฐ€์†ํ™”์— ๊ธฐ์—ฌํ•œ๋‹ค. ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„ ์„ ๊ตฌํ•˜๊ธฐ ์œ„ํ•˜์—ฌ, ๋ณธ ๋…ผ๋ฌธ์€ ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ๋ฐ”์šด๋”ฉ ๋ณผ๋ฅจ ๊ตฌ์กฐ๋ฅผ ๊ธฐ์ € ๊ณก๋ฉด์˜ ๋ฐ”์šด๋”ฉ ๋ณผ๋ฅจ๊ณผ ๊ธฐ์ € ๊ณก๋ฉด์˜ ๋ฒ•์„  ๊ณก๋ฉด์˜ ๋ฐ”์šด๋”ฉ ๋ณผ๋ฅจ์˜ ๊ตฌ์กฐ๋กœ๋ถ€ํ„ฐ ๊ณ„์‚ฐํ•˜๋ฉฐ ์ด๋•Œ ๊ฐ ๋ฐ”์šด๋”ฉ ๋ณผ๋ฅจ์˜ ๋‘๊ป˜๋ฅผ ๊ณ„์‚ฐํ•œ๋‹ค. ๋˜ํ•œ, ๋ฐ”์šด๋”ฉ ๋ณผ๋ฅจ ์ค‘์—์„œ ์‹ค์ œ ์˜คํ”„์…‹ ๊ณก์„  ๋ฐ ๊ณก๋ฉด์˜ ์ž๊ฐ€ ๊ต์ฐจ์— ๊ธฐ์—ฌํ•˜์ง€ ์•Š๋Š” ๋ถ€๋ถ„์„ ๊นŠ์€ ์žฌ๊ท€ ์ „์— ์ฐพ์•„์„œ ์ œ๊ฑฐํ•˜๋Š” ์—ฌ๋Ÿฌ ์กฐ๊ฑด๋“ค์„ ๋‚˜์—ดํ•œ๋‹ค. ํ•œํŽธ, ์ž๊ฐ€ ๊ต์ฐจ๊ฐ€ ์ œ๊ฑฐ๋œ ์˜คํ”„์…‹ ๊ณก์„  ๋ฐ ๊ณก๋ฉด์€ ๊ธฐ์ € ๊ณก์„  ๋ฐ ๊ณก๋ฉด์˜ ๋ณด๋กœ๋…ธ์ด ๊ตฌ์กฐ์™€ ๊นŠ์€ ๊ด€๋ จ์ด ์žˆ๋Š” ๊ฒƒ์ด ์•Œ๋ ค์ ธ ์žˆ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ์ž์œ  ๊ณก๋ฉด์˜ ์—ฐ์†๋œ ์˜คํ”„์…‹ ๊ณก๋ฉด๋“ค๋กœ๋ถ€ํ„ฐ ์ž์œ  ๊ณก๋ฉด์˜ ๋ณด๋กœ๋…ธ์ด ๊ตฌ์กฐ๋ฅผ ์œ ์ถ”ํ•˜๋Š” ๋ฐฉ๋ฒ•์„ ์ œ์‹œํ•œ๋‹ค. ํŠนํžˆ, ์˜คํ”„์…‹ ๊ณก๋ฉด์˜ ์ž๊ฐ€ ๊ต์ฐจ ๊ณก์„  ์ƒ์—์„œ ๋‚˜ํƒ€๋‚˜๋Š” ๊ฐ€์ง€ ์ ์ด๋‚˜ ๋ง๋‹จ ์ ๊ณผ ๊ฐ™์€ ํŠน์ด์ ๋“ค์ด ์ž์œ  ๊ณก๋ฉด์˜ ๋ณด๋กœ๋…ธ์ด ๊ตฌ์กฐ์—์„œ ์–ด๋–ป๊ฒŒ ํ•ด์„๋˜๋Š”์ง€ ์ œ์‹œํ•œ๋‹ค.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

    Subdivision surfaces with creases and truncated multiple knot lines

    Get PDF
    We deal with subdivision schemes based on arbitrary degree B-splines. We focus on extraordinary knots which exhibit various levels of complexity in terms of both valency and multiplicity of knot lines emanating from such knots. The purpose of truncated multiple knot lines is to model creases which fair out. Our construction supports any degree and any knot line multiplicity and provides a modelling framework familiar to users used to B-splines and NURBS systems

    On Thermodynamical Properties of Some Coset CFT Backgrounds

    Full text link
    We investigate the thermodynamical features of two Lorentzian signature backgrounds that arise in string theory as exact CFTs and possess more than two disconnected asymptotic regions: the 2-d charged black hole and the Nappi-Witten cosmological model. We find multiple smooth disconnected Euclidean versions of the charged black hole background. They are characterized by different temperatures and electro-chemical potentials. We show that there is no straightforward analog of the Hartle-Hawking state that would express these thermodynamical features. We also obtain multiple Euclidean versions of the Nappi-Witten cosmological model and study their singularity structure. It suggests to associate a non-isotropic temperature with this background.Comment: 1+39 pages, harvmac, 8 eps figure

    Preparation and Analysis of the Geometry Models used in the 1st AIAA Geometry and Mesh Generation Workshop

    Get PDF
    The NASA High-Lift Common Research Model (HL-CRM) was the subject model chosen for the AIAA Geometry and Mesh Generation Workshop I (GMGW-1) and High-Lift Prediction Workshop III (HLPW-3). This paper describes how geometry models of the HLCRM were prepared for use in the workshops and reviews the analysis of their construction that was provided to workshop participants. The refinements made to the HL-CRM geometry model immediately after GMGW-1 are also presented

    Conversion of trimmed NURBS surfaces to Catmull-Clark subdivision surfaces

    Get PDF
    This paper introduces a novel method to convert trimmed NURBS surfaces to untrimmed subdivision surfaces with Bรฉzier edge conditions. We take a NURBS surface and its trimming curves as input, from this we automatically compute a base mesh, the limit surface of which fits the trimmed NURBS surface to a specified tolerance. We first construct the topology of the base mesh by performing a cross-field based decomposition in parameter space. The number and positions of extraordinary vertices required to represent the trimmed shape can be automatically identified by smoothing a cross field bounded by the parametric trimming curves. After the topology construction, the control point positions in the base mesh are calculated based on the limit stencils of the subdivision scheme and constraints to achieve tangential continuity across the boundary. Our method provides the user with either an editable base mesh or a fine mesh whose limit surface approximates the input within a certain tolerance. By integrating the trimming curve as part of the desired limit surface boundary, our conversion can produce gap-free models. Moreover, since we use tangential continuity across the boundary between adjacent surfaces as constraints, the converted surfaces join with G1 continuity. ยฉ 2014 The Authors.EPSRC, Chinese Government (PhD studentship) and Cambridge Trust
    • โ€ฆ
    corecore