Abstract
Complex rational maps have been used to construct birational quadratic maps based on two special syzygies of degree one. Similar to complex rational curves, rational curves over generalized complex numbers have also been constructed by substituting the imaginary unit with a new independent quantity. We first establish the relationship between degree one, generalized, complex rational Bézier curves and quadratic rational Bézier curves. Then we provide conditions to determine when a quadratic rational planar map has a generalized complex rational representation. Thus, a rational quadratic planar map can be made birational by suitably choosing the middle Bézier control points and their corresponding weights. In contrast to the edges of complex rational maps of degree one, which are circular arcs, the edges of the planar maps can be generalized to hyperbolic and parabolic arcs by invoking the hyperbolic and parabolic numbers.
MSC:
68W30
1. Introduction
A birational planar map is a rational function from to with a rational function inverse to , i.e., . The research on birational maps traces its history back to 1863 when birational maps were known as Cremona transformations. H. Hudson published a monograph in 1927 to classify Cremona transformations in the plane and in 3D space [1]. However, [1] predates by over half a century Bézier and B-spline curves and surfaces.
Free-form deformation (FFD) is an artist-friendly tool, which is used to model deformations by warping the ambient space [2]. FFD has numerous applications such as image morphing [3,4], facial animation [5] and medical image registration [6].
A preimage of a given is defined as any for which . Computing FFD preimages is also required in many applications, e.g., extended FFD [7] and directly manipulated FFD [8]. However, computing preimages usually involves solving a system of nonlinear equations using either numerical methods or algebraic techniques. The computation of preimages can be simplified when the rational map used in FFD is birational. Hence, the notion of birational FFD is put forward in [9], i.e., an FFD in which the control points can be moved freely and the FFD can be made birational by adjusting the weights.
Birational FFDs of degree , i.e., birational quadrilateral maps, are constructed by considering axial moving lines in [10]. The inverses of birational quadrilateral maps are also discussed from the viewpoint of generalized barycentric coordinates [11,12]. The relationship between the inverses of rational quadrilateral maps and their characteristic conic is presented in [13]. Hence, by setting the isoparametric curves to be monoid curves, Seberberg et al. [9] studied the construction of the birational 2D FFD of degree . To characterize the birational maps, Botbol et al. [14] provides a birationality criterion for bigraded birational maps. Note that the current methods to construct birational maps focus on the discussion of 2D rational maps related to bidegree cases [9,10].
Complex rational curves were introduced by J. Sánchez-Reyes by allowing complex weights in rational Bézier curves [15]. Based on the observation that complex rational curves have two special syzygies of low degrees [16], we can construct birational quadratic planar maps by exploiting their complex rational representations [17], which are complex rational maps of degree one. Complex rational planar maps of degree one represent exactly Möbius transformations. Based on Möbius transformations, Lipman et al. also introduced the four-point interpolant (FPI) maps, where four endpoints are free to move. Since Möbius transformations map lines to circles, the boundaries of the complex rational planar maps of degree one and FPI are limited circular arcs. Recently, the planar and bent corner-operated and transimilar (COTS) maps have been proposed to take the unit square to a region bounded by four log-spiral edges [18,19]. Based on the self-similar property of the log-spiral, the tiles of the COTS map of a regular pattern are similar, which will reduce the query cost of point inclusion testing (PIT) [20] and total area calculation (TAC). To increase the flexibility to construct birational planar maps and inspired by recent work on generalized complex rational curves [21], we shall discuss the construction of birational quadratic planar maps by probing their generalized complex representations. The main contributions of this study are as follows:
- We introduce generalized complex rational curves and planar maps, and we discuss their properties.
- We prove that degree one, generalized, complex rational maps correspond to quadratic birational planar maps.
- We propose a new method to construct quadratic birational planar maps via generalized complex rational planar maps.
This paper is organized in the following fashion. We begin in Section 2 by recalling some preliminary results about rational curves over generalized complex numbers. In Section 3, we establish the relationship between quadratic rational Bézier curves and degree one complex rational curves. By considering the bivariate case of generalized complex rational curves, we construct birational quadratic planar maps by degree one, generalized, complex rational maps in Section 4. We close in Section 5 with a brief summary of our work.
2. Rational Curves over Generalized Complex Numbers
2.1. Complex, Hyperbolic and Parabolic Numbers
Hyperbolic and parabolic numbers generalize complex numbers by introducing a new quantity : either (complex numbers), or (hyperbolic numbers), or (parabolic numbers). The quantity here is not a real number but an independent quantity. In addition, commutes with every real number, and multiplication is associative and distributes through addition. Thus, we have the following multiplication rules:
The conjugate of is defined by
Multiplying a generalized complex number by its conjugate yields a real number, i.e., . The modulus (or absolute value) of is defined by
For generalized complex numbers, the analog of Euler’s formula is also true [22]. We have the following exponential formulas:
- (Complex numbers) ;
- (Hyperbolic numbers) ;
- (Parabolic numbers) .
The exponential of generalized complex numbers represents either a rotation for complex numbers, a scissor shear for hyperbolic numbers [23] or a classical shear for parabolic numbers [24].
A generalized complex number can be identified with a point in the plane . Using the standard basis , we identify with the point or vector . In analogy with complex numbers, we shall call the coefficient of 1 the real component and the coefficient of the imaginary component of a hyperbolic or parabolic number.
The hyperbolic numbers can be used to help solve cubic Equations [25] and write Lorentz transformations in the special theory of relativity [22]. The parabolic numbers can be used to help analyze the mechanics of a mechanism [26].
2.2. Complex, Hyperbolic and Parabolic Rational Curves and Planar Maps
Generalized complex Bézier curves are defined by
where are generalized complex control points, are generalized complex weights and are Bernstein polynomials. is called a complex, hyperbolic or parabolic rational Bézier curve when , respectively. By separating the real and imaginary parts of (1), we obtain
where . Multiplying the numerator and denominator in (1) by the conjugate of the denominator yields
Thus, c(s) corresponds to a real rational curve in the homogeneous form:
Note that when are polynomials of degree n, i.e., c(s) is a generalized complex rational curve of degree n, its counterpart is a real rational curve of degree .
To discuss rational planar maps, we extend the generalized complex rational curves in 2D as follows:
where . Recall that a syzygy of is a vector of polynomials
such that
Following the results in [21], we have the following observation
Lemma 1.
Given a rational planar map with generalized complex rational representation (4),
are two syzygies of . Moreover, .
Proof.
These results follow directly by substituting (5) into and . □
Note that the set of all syzygies of is also a free module of rank two over the ring (for more details, the interested reader is referred to the proof of Proposition 2.1 in [27]). Moreover, -bases of generalized complex rational curves can be calculated via these syzygies in the one-dimensional case [16,21].
3. Generalized Complex Rational Linear Curves
Let denote the generalized complex rational Bézier curve of degree one:
where , , . Note that when , will degenerate to a line segment connecting and . Hence, in the rest of this paper, we assume at least one of .
Lemma 2.
Let
be the corresponding real rational curve of . Then, the control points and the weights in (7) have the following properties:
- (1)
- (2)
- (3)
- , ;
- (4)
- is the conjugate of ;
- (5)
- , where
- (6)
- Geometrically, is on three different lines when is set to . All three lines pass through a common point . More precisely,
- (a)
- When , the line is the perpendicular bisector of the line segment between and ;
- (b)
- When , the line is symmetric to the line about the axis ;
- (c)
- When , the line is parallel to the y-axis, which also passes through the midpoint .
- (7)
- The weight satisfies
Proof.
Items (1), (2), and (3) can be verified by multiplying the denominator and numerator of (6) by .
Since the conjugate of is , it follows from (3) that is the conjugate of . Hence, (4) holds.
Again, according to (3),
By solving for in (9), we obtain . Substituting , into yields
By setting , it follows from (9) that Thus, (5) holds.
We shall prove (6) based on (5). Since
corresponds to the vector , it follows that
- (a)
- When , the vector , which is perpendicular to the vector . Thus, is on the perpendicular bisector of the line segment between and ;
- (b)
- When , the vector . Hence, . Since the vector is symmetric to the vector about the axis , it follows that is on a line symmetric to the line about the axis ;
- (c)
- When , the vector . Hence, , which is on a line parallel to the y-axis.
Next, we shall prove (7). Recall from (8) that . On the other hand,
Hence, when ,
Thus, and (7) holds. □
Based on the above analysis, we are now ready to derive conditions for a general real rational quadratic Bézier curve to have a generalized complex rational representation.
Theorem 1.
Suppose that the two endpoints and their weights are fixed for the rational quadratic curve (7). If the middle control point and its weight satisfy the following two conditions:
- (1)
- can be expressed as for some ;
- (2)
- can be expressed as
then has a generalized complex rational representation.
Proof.
When the middle control point and its corresponding weight satisfy conditions (1) and (2), it can be verified that corresponds to a generalized complex rational representation if we choose such that and set
where
□
Remark 1.
Based on Theorem 1, a rational quadratic Bézier curve in (7) with complex rational representation is fully determined by , and the parameter λ. To ensure that the curve segment is located in the convex hull of the control polygon , we shall adopt the positive square root for in (10). The complementary segment of the curve is generated by reversing of the sign of [28].
Remark 2.
When , we can divide the numerator and the denominator of by . Hence, can be rewritten as
Thus, the choice of the ratio , instead of itself, affects the shape of the curve .
Remark 3.
Remark 4.
In the case of hyperbolic rational curves, since , it follows from (10) that the parameter λ must satisfy: .
Example 1.
() Consider two endpoints and their corresponding weights . Choose with . From (10), we need to set the weight :
Choose . Then, , , . The corresponding rational quadratic curves are shown in Figure 1a (blue curves).
Figure 1.
Generalized complex rational curves of degree one. The control polygon (red color) and the corresponding curve (blue color) vary as the parameter changes.
Example 2.
4. Construction of Quadratic Birational Maps via Generalized Complex Representations
To generate planar rational maps, we generalize in (6) to the bivariate setting as follows.
Consider three non-collinear endpoints . Let
where are generalized complex weights, denoted by
To avoid the degenerate case, we also assume , , . In addition, at least one of , , is not fully real throughout the rest of the paper. Note that the complex, hyperbolic and parabolic rational curves are invariant with respect to Möbius transformations, i.e., applying a Möbius transformation to the control points and weights is equivalent to applying the Möbius transformation to every point on the curve (for more details, the readers are referred to Theorem 4.5 in [21]).
Multiplying the numerator and denominator in (13) by the conjugate of the denominator yields the corresponding quadratic real rational planar map:
where are Bernstein polynomials defined by
and ,
.
Denote by , the homogeneous form of . Next, we shall derive the syzygies of a planar rational map that is endowed with a generalized complex representation (13).
From Lemma 1, there are two special syzygies in the form (5) of , which are -independent. Let and . Then, after calculation, we obtain
where
With the above notation in hand, we are now ready to give the inversion formulas for a rational quadratic map with a generalized complex rational representation.
Theorem 2.
Proof.
The proof is similar to the proof of Theorem 4 in [17]. □
Given three endpoints , , and their corresponding weights , , , next we shall show how to obtain and , , such that the rational quadratic map is endowed with a generalized complex rational representation.
Note that not all three middle points are free to be chosen arbitrarily. Without loss of generality, we consider the two boundary curves , first. Choose two parameters to fix the middle points , i.e.,
Then from (10) in Theorem 1, we obtain
By setting the generalized complex weight such that , we can compute , from (11).
Let , then
In this way, we can construct a planar rational quadratic map (14) that is endowed with a generalized complex rational representation
Based on Theorem 2, the planar rational quadratic map is also birational.
In general, the method of constructing a planar rational quadratic map that is endowed with a generalized complex rational representation can be summarized in the following Algorithm 1.
| Algorithm 1 To construct a birational quadratic planar map with a generalized complex rational representation |
| Input: Three endpoints ; weights ; two parameters Output: A quadratic planar map that is endowed with generalized complex representation
|
Example 4.
() Fix three endpoints . Set the weights . The control points are fixed by choosing , i.e.,
Hence
From (12), we obtain
Choose . Hence, from (11),
Set . and can be calculated as follows:
Thus, we obtain a rational quadratic map with complex rational representation
See Figure 2 for an illustration of the birational map .
Figure 2.
A birational quadratic planar map (). The points on the red line segments are fixed when the points on the blue line segments are chosen.
Let , , , . Solving the system of equations
with respect to the variables , we obtain the inversion equation:
Example 5.
() Fix three endpoints . Set the weights . The control points are fixed by choosing , i.e.,
Hence
From (12), we obtain
Choose . Hence, from (11),
Set . and can be calculated as follows:
Thus, we obtain a rational quadratic map with complex rational representation
See Figure 3 for an illustration of the birational map .
Figure 3.
A birational quadratic planar map (). The points on the red line segments are fixed when the points on the blue line segments are chosen.
Let , , , , solving the system of equations
and with respect to the variables , we obtain the inversion equation:
5. Conclusions
We extended the construction of birational quadratic maps based on rational maps over generalized complex numbers. When we need to construct birational quadratic maps, the new method provides more options for choosing the middle control points and their corresponding weights. Hence, we increase the flexibility of the boundary curves of birational quadratic maps. The proof of the birational property is based on the construction of two special syzygies. The formulas for the inversion equation are also provided. Although we have generalized the construction of birational maps based on generalized complex representations, the choice of the middle control points is still limited, and we cannot construct quadratic birational planar maps by moving the three middle points freely. In the future, we hope to construct general birational maps by setting to the real values other than , which will be used as a shape parameter to control the shape of the boundaries.
Author Contributions
Conceptualization, X.W.; Methodology, R.G.; Validation, Y.H., Q.N. and R.L.; Writing—original draft, X.W.; Writing—review & editing, R.G.; Funding acquisition, X.W. and Q.N. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the National Natural Science Foundation of China No. 122011292, No. 61772167, and No. 11771420; Natural Science Foundation of the Jiangsu Higher Education Institutions of China: 22KJB110015.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Hudson, H.P. Cremona Transformations in Plane and Space; The University Press: Cambridge, UK, 1927; Volume 38. [Google Scholar]
- Sederberg, T.W.; Parry, S.R. Free-form deformation of solid geometric models. In Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques, Dallas, TX, USA, 18–22 August 1986; pp. 151–160. [Google Scholar]
- Lee, S.Y.; Chwa, K.Y.; Shin, S.Y. Image metamorphosis using snakes and free-form deformations. In Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA, 6–11 August 1995; pp. 439–448. [Google Scholar]
- Wolberg, G. Image morphing: A survey. Vis. Comput. 1998, 14, 360–372. [Google Scholar] [CrossRef]
- Parke, F.I.; Waters, K. Computer Facial Animation; CRC Press: Boca Raton, FL, USA, 2008. [Google Scholar]
- Rohlfing, T.; Maurer, C.R.; Bluemke, D.A.; Jacobs, M.A. Volume-preserving nonrigid registration of MR breast images using free-form deformation with an incompressibility constraint. IEEE Trans. Med. Imaging 2003, 22, 730–741. [Google Scholar] [CrossRef] [PubMed]
- Coquillart, S. Extended free-form deformation: A sculpturing tool for 3d geometric modeling. In Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques, Dallas, TX, USA, 6–10 August 1990; pp. 187–196. [Google Scholar]
- Gain, J.E.; Dodgson, N.A. Preventing self-intersection under free-form deformation. IEEE Trans. Vis. Comput. Graph. 2001, 7, 289–298. [Google Scholar] [CrossRef]
- Sederberg, T.W.; Goldman, R.N.; Wang, X. Birational 2D free-form deformation of degree 1× n. Comput. Aided Geom. Des. 2016, 44, 1–9. [Google Scholar] [CrossRef]
- Sederberg, T.W.; Zheng, J. Birational quadrilateral maps. Comput. Aided Geom. Des. 2015, 32, 1–4. [Google Scholar] [CrossRef]
- Deng, C.; Zhu, F.; Liu, J. The limit of a family of barycentric coordinates for quadrilaterals. Comput. Aided Geom. Des. 2015, 38, 38–39. [Google Scholar] [CrossRef]
- Floater, M.S. The inverse of a rational bilinear mapping. Comput. Aided Geom. Des. 2015, 33, 46–50. [Google Scholar] [CrossRef]
- Deng, C.; Li, Y.; Mu, X.; Zhao, Y. Characteristic conic of rational bilinear map. J. Comput. Appl. Math. 2019, 346, 277–283. [Google Scholar] [CrossRef]
- Botbol, N.; Busé, L.; Chardin, M.; Hassanzadeh, S.H.; Simis, A.; Tran, Q.H. Effective criteria for bigraded birational maps. J. Symb. Comput. 2017, 81, 69–87. [Google Scholar] [CrossRef]
- Sánchez-Reyes, J. Complex rational Bézier curves. Comput. Aided Geom. Des. 2009, 26, 865–876. [Google Scholar] [CrossRef]
- Wang, X.; Goldman, R. μ-bases for complex rational curves. Comput. Aided Geom. Des. 2013, 30, 623–635. [Google Scholar] [CrossRef]
- Wang, X.; Wu, M.; Liu, Y.; Ni, Q. Constructing quadratic birational maps via their complex rational representation. Comput. Aided Geom. Des. 2021, 85, 101969. [Google Scholar] [CrossRef]
- Kurzeja, K.; Rossignac, J. Becots: Bent corner-operated tran-similar maps and lattices. Comput.-Aided Des. 2020, 129, 102912. [Google Scholar] [CrossRef]
- Rossignac, J. Corner-operated tran-similar (cots) maps, patterns, and lattices. ACM Trans. Graph. 2020, 39, 1–14. [Google Scholar] [CrossRef]
- Tilove. Set membership classification: A unified approach to geometric intersection problems. IEEE Trans. Comput. 1980, C-29, 874–883. [Google Scholar] [CrossRef]
- Du, J.; Goldman, R.; Wang, X. Rational curves over generalized complex numbers. J. Symb. Comput. 2019, 93, 56–84. [Google Scholar] [CrossRef]
- Kulyabov, D.; Korolkova, A.; Gevorkyan, M. Hyperbolic numbers as einstein numbers. J. Phys. Conf. Ser. 2020, 1557, 012027. [Google Scholar] [CrossRef]
- Salomon, D. Computer Graphics and Geometric Modeling; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
- VanArsdale, D. Homogeneous transformation matrices for computer graphics. Comput. Graph. 1994, 18, 177–191. [Google Scholar] [CrossRef]
- Sobczyk, G. The hyperbolic number plane. Coll. Math. J. 1995, 26, 268–280. [Google Scholar] [CrossRef]
- Fischer, I. Dual-Number Methods in Kinematics, Statics and Dynamics; CRC Press: Boca Raton, FL, USA, 1998. [Google Scholar]
- Chen, F.; Cox, D.; Liu, Y. The μ-basis and implicitization of a rational parametric surface. J. Symb. Comput. 2005, 39, 689–706. [Google Scholar] [CrossRef]
- Farin, G.E.; Farin, G. Curves and Surfaces for CAGD: A Practical Guide; Morgan Kaufmann: Burlington, MA, USA, 2002. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).