research-article Free Access
- Authors:
- Kai Li KLMM, AMSS, Chinese Academy of Sciences, China University of Chinese Academy of Sciences, China
KLMM, AMSS, Chinese Academy of Sciences, China
University of Chinese Academy of Sciences, China
Search about this author
- Xiaohong Jia KLMM, AMSS, Chinese Academy of Sciences, China University of Chinese Academy of Sciences, China
KLMM, AMSS, Chinese Academy of Sciences, China
University of Chinese Academy of Sciences, China
Search about this author
- Falai Chen University of Science and Technology of China, Anhui, Hefei, China
University of Science and Technology of China, Anhui, Hefei, China
Search about this author
Computer Aided Geometric DesignVolume 107Issue CDec 2023https://doi.org/10.1016/j.cagd.2023.102253
Published:04 March 2024Publication History
- 0citation
- 0
- Downloads
Metrics
Total Citations0Total Downloads0Last 12 Months0
Last 6 weeks0
- Get Citation Alerts
New Citation Alert added!
This alert has been successfully added and will be sent to:
You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below.
Manage my Alerts
New Citation Alert!
Please log in to your account
- Save to Binder
- Export Citation
- Publisher Site
Computer Aided Geometric Design
Volume 107, Issue C
PreviousArticleNextArticle
Abstract
Abstract
Moving planes have been widely recognized as a potent algebraic tool in various fundamental problems of geometric modeling, including implicitization, intersection computation, singularity calculation, and point inversion of parametric surfaces. For instance, a matrix representation that inherits the key properties of a parametric surface is constructed from a set of moving planes. In this paper, we present an efficient approach to computing such a set of moving planes that follow the given rational parametric surface. Our method is based on the calculation of Dixon resultant matrices, which allows for the computation of moving planes with simpler coefficients, improved efficiency and superior numerical stability when compared to the direct way of solving a linear system of equations for the same purpose. We also demonstrate the performance of our algorithm through experimental examples when applied to implicitization, surface intersection, singularity computation as well as inversion formula computation.
Graphical abstract
Highlights
• | An efficient approach to computing a set of moving planes that follow the given rational parametric surface is proposed. | ||||
• | The moving planes are significant to surface implicitization, surface intersection, inversion formula, etc. | ||||
• | The method has simpler coefficients, improved efficiency and superior numerical stability compared with traditional methods. |
References
- Buchberger, 1988 Buchberger B.,
Applications of Gröbner bases in non-linear computational geometry , in: Trends in Computer Algebra, Springer Berlin Heidelberg, Berlin, Heidelberg, 1988, pp. 52–80.Google Scholar - Busé, 2014 Busé L., Implicit matrix representations of rational Bézier curves and surfaces, Comput. Aided Des. 46 (2014) 14–24.Google ScholarDigital Library
- Busé and Chen, 2021 Busé L., Chen F., Determinantal tensor product surfaces and the method of moving quadrics, Trans. Am. Math. Soc. 374 (7) (2021) 4931–4952.Google Scholar
- Chen et al., 2005 Chen F., Cox D., Liu Y., The μ-basis and implicitization of a rational parametric surface, J. Symb. Comput. 39 (6) (2005) 689–706.Google Scholar
- Chen et al., 2008 Chen F., Wang W., Liu Y., Computing singular points of plane rational curves, J. Symb. Comput. 43 (2) (2008) 92–117.Google Scholar
- Chionh and Goldman, 1992 Chionh E.-W., Goldman R.N.,
Implicitizing rational surfaces with base points by applying perturbations and the factors of zero theorem , in: Mathematical Methods in Computer Aided Geometric Design II, Academic Press, 1992, pp. 101–110.Google Scholar - Chionh et al., 2000 Chionh E.-W., Zhang M., Goldman R.N.,
Implicitization by Dixon a-resultants , in: Proceedings Geometric Modeling and Processing 2000. Theory and Applications, IEEE, 2000, pp. 310–318.Google Scholar - Chionh et al., 2002 Chionh E.-W., Zhang M., Goldman R.N., Fast computation of the Bezout and Dixon resultant matrices, J. Symb. Comput. 33 (1) (2002) 13–29.Google Scholar
- Cox, 2001 Cox D., Equations of parametric curves and surfaces via syzygies, Contemp. Math. 286 (2001) 1–20.Google Scholar
- Cox, 2003 Cox D., Curves, surfaces, and syzygies, Contemp. Math. 334 (2003) 131–150.Google Scholar
- Cox et al., 2000 Cox D., Goldman R., Zhang M., On the validity of implicitization by moving quadrics for rational surfaces with no base points, J. Symb. Comput. 29 (3) (2000) 419–440.Google Scholar
- D.A. Cox et al., 2000 Cox D.A., Little J., O'Shea D., Ideals, Varieties, and Algorithms, Springer, 2000.Google Scholar
- Cox et al., 2006 Cox D.A., Little J., O'Shea D., Using Algebraic Geometry, vol. 185, Springer Science & Business Media, 2006.Google Scholar
- Dixon, 1908 Dixon A.L., The eliminant of three quantics in two independent variables, Proc. Lond. Math. Soc. (2) 7 (1908) 49–69.Google Scholar
- Jia et al., 2022a Jia X., Chen F., Yao S., Singularity computation for rational parametric surfaces using moving planes, ACM Trans. Graph. (TOG) 42 (1) (2022) 1–14.Google Scholar
- Jia et al., 2022b Jia X., Li K., Cheng J., Computing the intersection of two rational surfaces using matrix representations, Comput. Aided Des. 150 (2022).Google Scholar
- Lai and Chen, 2017 Lai Y., Chen F., An improved algorithm for constructing moving quadrics from moving planes, J. Syst. Sci. Complex. 30 (6) (2017) 1483–1506.Google Scholar
- Lai and Chen, 2016 Lai Y., Chen F., Implicitizing rational surfaces using moving quadrics constructed from moving planes, J. Symb. Comput. 77 (Nov.-Dec. 2016) 127–161.Google Scholar
- Lai et al., 2019 Lai Y., Chen F., Shi X., Implicitizing rational surfaces without base points by moving planes and moving quadrics, Comput. Aided Geom. Des. 70 (2019) 1–15.Google Scholar
- Lai et al., 2022 Lai Y., Chen F., Shi X., Gao Y., A constructive approach to implicitizing rational surfaces with LCI base points by moving planes and moving quadrics, Comput. Aided Geom. Des. 92 (2022).Google Scholar
- Sederberg and Chen, 1995 Sederberg T.W., Chen F.,
Implicitization using moving curves and surfaces , in: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, Association for Computing Machinery, New York, NY, USA, 1995, pp. 301–308.Google Scholar - Sederberg et al., 1984 Sederberg T.W., Anderson D.C., Goldman R.N., Implicit representation of parametric curves and surfaces, Comput. Vis. Graph. Image Process. 28 (1) (1984) 72–84.Google Scholar
- Shen and Goldman, 2018 Shen L.-Y., Goldman R., Combining complementary methods for implicitizing rational tensor product surfaces, Comput. Aided Des. 104 (2018) 100–112.Google ScholarDigital Library
- Shen and Goldman, 2017 Shen L.Y., Goldman R., Implicitizing rational tensor product surfaces using the resultant of three moving planes, ACM Trans. Graph. 36 (5) (2017) 1–14.Google Scholar
Cited By
View all
Index Terms
Efficient computation of moving planes for rational parametric surfaces with base points using Dixon resultants
Computing methodologies
Symbolic and algebraic manipulation
Symbolic and algebraic algorithms
Algebraic algorithms
Linear algebra algorithms
Mathematics of computing
Mathematical analysis
Numerical analysis
Computations on matrices
Theory of computation
Randomness, geometry and discrete structures
Computational geometry
Index terms have been assigned to the content through auto-classification.
Recommendations
- Using moving planes to implicitize rational surfaces generated from a planar curve and a space curve
A rational surface(1) S ( s , t ) = ( A ( s ) a ( t ) , B ( s ) b ( t ) , C ( s ) c ( t ) , C ( s ) d ( t ) ) can be generated from a rational planer curve P * ( s ) = ( A ( s ) , B ( s ) , C ( s ) ) and a rational space curve P ( t ) = ( a ( t ) , b ( ...
Read More
- Implicitizing rational surfaces without base points by moving planes and moving quadrics
Highlights
- A tensor product rational surface of bidegree ( m , n ) without base points can always be implicitized by moving quadrics together with moving planes.
Abstract
It was proven by Cox, Goldman and Zhang that a tensor product rational surface without base points can be implicitized by moving quadrics whenever the rational surface doesn't contain low degree moving planes following it. However, ...
Read More
- Implicitizing Rational Tensor Product Surfaces Using the Resultant of Three Moving Planes
Implicitizing rational surfaces is a fundamental computational task in Computer Graphics and Computer Aided Design. Ray tracing, collision detection, and solid modeling all benefit from implicitization procedures for rational surfaces. The univariate ...
Read More
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
Full Access
Get this Article
- Information
- Contributors
Published in
Computer Aided Geometric Design Volume 107, Issue C
Dec 2023
104 pages
ISSN:0167-8396
Issue’s Table of Contents
Elsevier B.V.
Sponsors
In-Cooperation
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
- Published: 4 March 2024
Author Tags
- Moving planes
- Rational parametric surface
- Dixon resultant matrices
- Implicitization
Qualifiers
- research-article
Conference
Funding Sources
Other Metrics
View Article Metrics
- Bibliometrics
- Citations0
Article Metrics
- View Citations
Total Citations
Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
View Author Metrics
Cited By
This publication has not been cited yet
Digital Edition
View this article in digital edition.
View Digital Edition
- Figures
- Other
Close Figure Viewer
Browse AllReturn
Caption
View Issue’s Table of Contents