Testing tensor product Bézier surfaces for coincidence: A comprehensive solution (2310.18337v1)
Abstract: It is known that B\'{e}zier curves and surfaces may have multiple representations by different control polygons. The polygons may have different number of control points and may even be disjoint. Up to our knowledge, Pekerman et al. (2005) were the first to address the problem of testing two parametric polynomial curves for coincidence. Their approach is based on reduction of the input curves into canonical irreducible form. They claimed that their approach can be extended for testing tensor product surfaces but gave no further detail. In this paper we develop a new technique and provide a comprehensive solution to the problem of testing tensor product B\'ezier surfaces for coincidence. In (Vlachkova, 2017) an algorithm for testing B\'ezier curves was proposed based on subdivision. There a partial solution to the problem of testing tensor product B\'ezier surfaces was presented. Namely, the case where the irreducible surfaces are of same degree $(n,m)$, $n,m \in \mathbb{N}$, was resolved under certain additional condition. The other cases where one of the surfaces is of degree $(n,m)$ and the other is of degree either $(n,n+m)$, or $(n+m,m)$, or $(n+m,n+m)$ remained open. We have implemented our algorithm for testing tensor product B\'ezier surfaces for coincidence using Mathematica package. Experimental results and their analysis are presented.
- Polynomial decomposition algorithms. J. Symbolic Comput. 1, 159–168. doi:10.1016/S0747-7171(85)80012-2.
- The uniqueness of Bézier control points. Comput. Aided Geom. Des. 14, 877–879. doi:10.1016/S0167-8396(97)00016-2.
- Rebuttal to “comment on the ‘coincidence condition of two Bézier curves of an arbitrary degree’ ”. Comput. Graph. 53, 167–169. doi:https://doi.org/10.1016/j.cag.2015.10.007.
- Conditions for the coincidence of two quartic Bézier curves. Appl. Math. and Comput. 225, 731–736. doi:10.1016/j.amc.2013.09.053.
- Coincidence condition of two Bézier curves of an arbitrary degree. Comput. Graph. 54, 121–126. doi:10.1016/j.cag.2015.07.013.
- Generalizing rational degree elevation. Comput. Aided Geom. Des. 14, 399–406. doi:10.1016/S0167-8396(96)00036-2.
- Curves and Surfaces for CAGD: A Practical Guide. 5th ed., Morgan-Kaufmann, San Francisco.
- The Bernstein polynomial basis: a centennial retrospective. Comput. Aided Geom. Des. 29, 379–419. doi:10.1016/j.cagd.2012.03.001.
- Functional decomposition of polynomials: the tame case. J. Symbolic Comput. 9, 281–299. doi:10.1016/S0747-7171(08)80014-4.
- Pyramid algorithms: A dynamic programming approach to curves and surfaces for geometric modeling. Elsevier Science (USA).
- Polynomial decomposition algorithms. J. Symbolic Comput. 7, 445–456. doi:https://doi.org/10.1016/S0747-7171(89)80027-6.
- Are two curves the same? Comput.-Aided Des. Appl. 2, 85–94. doi:10.1080/16864360.2005.10738356.
- On the conditions for the coincidence of two cubic Bézier curves. J. of Comput. Appl. Math. 236, 1675–1677. doi:10.1016/j.cam.2011.08.024.
- The conditions for the coincidence or overlapping of two Bézier curves. Appl. Math. Comput. 248, 625–630. doi:10.1016/j.amc.2014.10.008.
- Comment on the “coincidence condition of two Bézier curves of an arbitrary degree”. Comput. Graph. 53, 166. doi:10.1016/j.cag.2015.10.006.
- Detecting symmetries in polynomial Bézier curves. J. of Comput. Appl. Math. 288, 274–283. doi:10.1016/j.cam.2015.04.025.
- Comparing Bézier curves and surfaces for coincidence, in: Georgiev, K., Todorov, M., Georgiev, I. (Eds.), Advanced Computing in Industrial Mathematics. Springer International Publishing. volume 681 of LNCS, Studies in Computational Intelligence, pp. 239–250. doi:10.1007/978-3-319-49544-6_20.
- Conditions for coincidence of two cubic Bézier curves. J. Comput. Appl. Math.. 235, 5198–5202. doi:10.1016/j.cam.2011.05.006.
- Trimming Bézier surfaces on Bézier surfaces via blossoming, in: Chen, F., Ju¨¨u\ddot{\rm u}over¨ start_ARG roman_u end_ARGttler, B. (Eds.), LNCS 4975, Springer, Berlin Heidelberg. pp. 578–584. doi:10.1007/978-3-540-79246-8_50.