computer aided geometric design
Recently Published Documents


TOTAL DOCUMENTS

161
(FIVE YEARS 16)

H-INDEX

20
(FIVE YEARS 1)

2021 ◽  
Vol 2 (5) ◽  
Author(s):  
Soroosh Tayebi Arasteh ◽  
Adam Kalisz

AbstractSplines are one of the main methods of mathematically representing complicated shapes, which have become the primary technique in the fields of Computer Graphics (CG) and Computer-Aided Geometric Design (CAGD) for modeling complex surfaces. Among all, Bézier and Catmull–Rom splines are the most common in the sub-fields of engineering. In this paper, we focus on conversion between cubic Bézier and Catmull–Rom curve segments, rather than going through their properties. By deriving the conversion equations, we aim at converting the original set of the control points of either of the Catmull–Rom or Bézier cubic curves to a new set of control points, which corresponds to approximately the same shape as the original curve, when considered as the set of the control points of the other curve. Due to providing simple linear transformations of control points, the method is very simple, efficient, and easy to implement, which is further validated in this paper using some numerical and visual examples.


Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 843
Author(s):  
Kinga Kruppa ◽  
Roland Kunkli ◽  
Miklós Hoffmann

Minkowski Pythagorean hodograph curves are widely studied in computer-aided geometric design, and several methods exist which construct Minkowski Pythagorean hodograph (MPH) curves by interpolating Hermite data in the R2,1 Minkowski space. Extending the class of MPH curves, a new class of Rational Envelope (RE) curve has been introduced. These are special curves in R2,1 that define rational boundaries for the corresponding domain. A method to use RE and MPH curves for skinning purposes, i.e., for circle-based modeling, has been developed recently. In this paper, we continue this study by proposing a new, more flexible way how these curves can be used for skinning a discrete set of circles. We give a thorough overview of our algorithm, and we show a significant advantage of using RE and MPH curves for skinning purposes: as opposed to traditional skinning methods, unintended intersections can be detected and eliminated efficiently.


Author(s):  
Rashad A. Abdel-Baky ◽  
Fatemah Mofarreh

This work is concerned with the study of the kinematic-geometry of a special kind of tube surfaces, so-called sweeping surface in Euclidean 3-space [Formula: see text]. It is generated by a plane curve moving through space such that the movement of any point on the surface is always orthogonal to the plane. In particular, the type-2 Bishop frame is considered and some important theorems are obtained. Also, the problem of singularity and convexity of such sweeping surface is discussed. Finally, an application is presented and plotted using computer aided geometric design.


2020 ◽  
Vol 20 (4) ◽  
pp. 865-880
Author(s):  
HATİCE KUŞAK SAMANCI ◽  
SERKAN ÇELİK ◽  
MUHSİN İNCESU

Bezier surfaces are commonly used in Computer-Aided Geometric Design since it enables in geometric modeling of the objects. In this study, the shape operator of the timelike and spacelike surfaces has been analyzed in Minkowski-3 space. Then, the obtained results were applied to a numeric example


Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2219
Author(s):  
Jorge Delgado Gracia

In computer-aided geometric design, a polynomial surface is usually represented in Bézier form. The usual form of evaluating such a surface is by using an extension of the de Casteljau algorithm. Using error-free transformations, a compensated version of this algorithm is presented, which improves the usual algorithm in terms of accuracy. A forward error analysis illustrating this fact is developed.


Author(s):  
Kinga Kruppa

AbstractSpecial curves in the Minkowski space such as Minkowski Pythagorean hodograph curves play an important role in computer-aided geometric design, and their usages are thoroughly studied in recent years. Bizzarri et al. (2016) introduced the class of Rational Envelope (RE) curves, and an interpolation method for G1 Hermite data was presented, where the resulting RE curve yielded a rational boundary for the represented domain. We now propose a new application area for RE curves: skinning of a discrete set of input circles. We show that if we do not choose the Hermite data correctly for interpolation, then the resulting RE curves are not suitable for skinning. We introduce a novel approach so that the obtained envelope curves touch each circle at previously defined points of contact. Thus, we overcome those problematic scenarios in which the location of touching points would not be appropriate for skinning purposes. A significant advantage of our proposed method lies in the efficiency of trimming offsets of boundaries, which is highly beneficial in computer numerical control machining.


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Sidra Maqsood ◽  
Muhammad Abbas ◽  
Kenjiro T. Miura ◽  
Abdul Majeed ◽  
Azhar Iqbal

Abstract A Bézier model with shape parameters is one of the momentous research topics in geometric modeling and computer-aided geometric design. In this study, a new recursive formula in explicit expression is constructed that produces the generalized blended trigonometric Bernstein (or GBT-Bernstein, for short) polynomial functions of degree m. Using these basis functions, generalized blended trigonometric Bézier (or GBT-Bézier, for short) curves with two shape parameters are also constructed, and their geometric features and applications to curve modeling are discussed. The newly created curves share all geometric properties of Bézier curves except the shape modification property, which is superior to the classical Bézier. The $C^{3}$ C 3 and $G^{2}$ G 2 continuity conditions of two pieces of GBT-Bézier curves are also part of this study. Moreover, in contrast with Bézier curves, our generalization gives more shape adjustability in curve designing. Several examples are presented to show that the proposed method has high applied values in geometric modeling.


2020 ◽  
Vol 8 (2) ◽  
pp. 39-50
Author(s):  
Azhar Ahmad

Makalah ini membincangkan satu kaedah pembinaan lengkungan peralihan berbentuk C yang memenuhi syarat-syarat data interpolasi Hermite Lengkungan peralihan ini dibina berasaskan gabungan dua pilin kuadratik nisbah Bezier atau gabungan bersama satu segmen garis lurus bagi mencapai keselanjaran pada keseluruhan binaan. Kaedah analisis geometri bersama syarat kemonotonan suatu lengkungan kuadratik nisbah Bezier telah digunakan bagi mencapai objektif kajian. Hasil kajian yang dicapai adalah satu teknik pembinaan yang membolehkan kita memperolehi lengkungan peralihan secara terus, mudah diaplikasikan serta tanpa perlu menggunakan sebarang prosedur tranformasi affin. Syarat untuk lengkungan peralihan ini terhasil ditentukan oleh data Hermite yang diberi dan kepelbagaiannya pula dikawal oleh panjang segmen garis lurus yang menghubungkan kedua-dua pilin berkenaan. Keupayaan memenuhi sifat-sifat interpolasi ini memberi banyak kelebihan dan amat sesuai untuk aplikasi tertentu di dalam CAGD (Computer Aided Geometric Design), umpamanya rekabentuk produk industri, trajektori robot non-holonomic, serta rekabentuk mendatar landasan keretapi dan lebuhraya. Oleh kerana kuadratik nisbah Bezier merupakan sebahagian daripada perwakilan NURBS (Nonuniform Rational B-splines) maka adalah mudah bagi kita mengabungjalinkan formulasi lengkungan peralihan yang dicadangkan ini ke dalam kebanyakan sistem pengaturcara CAD (Computer Aided Design).


2020 ◽  
Vol 5 (2) ◽  
pp. 126-134
Author(s):  
Ching-Shoei Chiang ◽  
Hung-Chieh Li

Computer aided geometric design employs mathematical and computational methods for describing geometric objects, such as curves, areas in two dimensions (2D) and surfaces, and solids in 3D. An area can be represented using its boundary curves, and a solid can be represented using its boundary surfaces with intersection curves among these boundary surfaces. In addition, other methods, such as the medial-axis transform, can also be used to represent an area. Although most researchers have presented algorithms that find the medial-axis transform from an area, a algorithm using the contrasting approach is proposed; i.e., it finds an area using a medial-axis transform. The medial-axis transform is constructed using discrete points on a curve and referred to as the skeleton of the area. Subsequently, using the aforementioned discrete points, medial-axis circles are generated and referred to as the muscles of the area. Finally, these medial-axis circles are blended and referred to as the blended boundary curves skin of the area; consequently, the boundary of the area generated is smooth.


Sign in / Sign up

Export Citation Format

Share Document