Xiaowu Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiaowu Li has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Zhinan Wu
School of Mathematics and Computer Science, Yichun University, Yichun 336000, China
8 shared publications - Lin Wang
Monash-Airdoc joint research group, Monash University, Melbourne, VIC, Australia
6 shared publications - Linke Hou
Center for Economic Research, Shandong University, Jinan 250100, China
6 shared publications - Juan Liang
Department of Science, Taiyuan Institute of Technology, Taiyuan 030008, China
5 shared publications - Feng Pan
College of Data Science and Information Engineering, Guizhou Minzu University, Guiyang, 550025, China
3 shared publications - Chunguang Yue
College of Information Engineering, Guizhou Minzu University, Guiyang 550025, China
2 shared publications
Latest Publications
- Open Access
Application of Orthogonal Polynomial in Orthogonal Projection of Algebraic Surface
Point orthogonal projection onto an algebraic surface is a very important topic in computer-aided geometric design and other fields. However, implementing this method is currently extremely challenging and difficult because it is difficult to achieve to desired degree of robustness. Therefore, we construct an orthogonal polynomial, which is the ninth formula, after the inner product of the eighth formula itself. Additionally, we use the Newton iterative method for the iteration. In order to ensure maximum convergence, two techniques are used before the Newton iteration: (1) Newton’s gradient descent method, which is used to make the initial iteration point fall on the algebraic surface, and (2) computation of the foot-point and moving the iterative point to the close position of the orthogonal projection point of the algebraic surface. Theoretical analysis and experimental results show that the proposed algorithm can accurately, efficiently, and robustly converge to the orthogonal projection point for test points in different spatial positions.
Open AccessApplication of Orthogonal Polynomial in Orthogonal Projection of Algebraic Surface
Point orthogonal projection onto an algebraic surface is a very important topic in computer-aided geometric design and other fields. However, implementing this method is currently extremely challenging and difficult because it is difficult to achieve to desired degree of robustness. Therefore, we construct an orthogonal polynomial, which is the ninth formula, after the inner product of the eighth formula itself. Additionally, we use the Newton iterative method for the iteration. In order to ensure maximum convergence, two techniques are used before the Newton iteration: (1) Newton’s gradient descent method, which is used to make the initial iteration point fall on the algebraic surface, and (2) computation of the foot-point and moving the iterative point to the close position of the orthogonal projection point of the algebraic surface. Theoretical analysis and experimental results show that the proposed algorithm can accurately, efficiently, and robustly converge to the orthogonal projection point for test points in different spatial positions.
- Open Access
- 1 March 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (3) , 317
Point Orthogonal Projection onto a Spatial Algebraic Curve
Point orthogonal projection onto a spatial algebraic curve plays an important role in computer graphics, computer-aided geometric design, etc. We propose an algorithm for point orthogonal projection onto a spatial algebraic curve based on Newton’s steepest gradient descent method and geometric correction method. The purpose of Algorithm 1 in the first step of Algorithm 4 is to let the initial iteration point fall on the spatial algebraic curve completely and successfully. On the basis of ensuring that the iteration point fallen on the spatial algebraic curve, the purpose of the intermediate for loop body including Step 2 and Step 3 is to let the iteration point gradually approach the orthogonal projection point (the closest point) such that the distance between them is very small. Algorithm 3 in the fourth step plays an important double acceleration and orthogonalization role. Numerical example shows that our algorithm is very robust and efficient which it achieves the expected and ideal result.
- 1 March 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (3) , 317
Open AccessPoint Orthogonal Projection onto a Spatial Algebraic Curve
Point orthogonal projection onto a spatial algebraic curve plays an important role in computer graphics, computer-aided geometric design, etc. We propose an algorithm for point orthogonal projection onto a spatial algebraic curve based on Newton’s steepest gradient descent method and geometric correction method. The purpose of Algorithm 1 in the first step of Algorithm 4 is to let the initial iteration point fall on the spatial algebraic curve completely and successfully. On the basis of ensuring that the iteration point fallen on the spatial algebraic curve, the purpose of the intermediate for loop body including Step 2 and Step 3 is to let the iteration point gradually approach the orthogonal projection point (the closest point) such that the distance between them is very small. Algorithm 3 in the fourth step plays an important double acceleration and orthogonalization role. Numerical example shows that our algorithm is very robust and efficient which it achieves the expected and ideal result.
- Open Access
- 1 October 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (10) , 912
An Improved Curvature Circle Algorithm for Orthogonal Projection onto a Planar Algebraic Curve
Point orthogonal projection onto planar algebraic curve plays an important role in computer graphics, computer aided design, computer aided geometric design and other fields. For the case where the test point is very far from the planar algebraic curve, we propose an improved curvature circle algorithm to find the footpoint. Concretely, the first step is to repeatedly iterate algorithm (the Newton’s steepest gradient descent method) until the iterated point could fall on the planar algebraic curve. Then seek footpoint by using the algorithm (computing footpoint ) where the core technology is the curvature circle method. And the next step is to orthogonally project the footpoint onto the planar algebraic curve by using the algorithm (the hybrid tangent vertical foot algorithm). Repeatedly run the algorithm (computing footpoint ) and the algorithm (the hybrid tangent vertical foot algorithm) until the distance between the current footpoint and the previous footpoint is near 0. Furthermore, we propose Second Remedial Algorithm based on Comprehensive Algorithm B. In particular, its robustness is greatly improved than that of Comprehensive Algorithm B and it achieves our expected result. Numerical examples demonstrate that Second Remedial Algorithm could converge accurately and efficiently no matter how far the test point is from the plane algebraic curve and where the initial iteration point is.- 1 October 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (10) , 912
Open AccessAn Improved Curvature Circle Algorithm for Orthogonal Projection onto a Planar Algebraic Curve
Point orthogonal projection onto planar algebraic curve plays an important role in computer graphics, computer aided design, computer aided geometric design and other fields. For the case where the test point is very far from the planar algebraic curve, we propose an improved curvature circle algorithm to find the footpoint. Concretely, the first step is to repeatedly iterate algorithm (the Newton’s steepest gradient descent method) until the iterated point could fall on the planar algebraic curve. Then seek footpoint by using the algorithm (computing footpoint ) where the core technology is the curvature circle method. And the next step is to orthogonally project the footpoint onto the planar algebraic curve by using the algorithm (the hybrid tangent vertical foot algorithm). Repeatedly run the algorithm (computing footpoint ) and the algorithm (the hybrid tangent vertical foot algorithm) until the distance between the current footpoint and the previous footpoint is near 0. Furthermore, we propose Second Remedial Algorithm based on Comprehensive Algorithm B. In particular, its robustness is greatly improved than that of Comprehensive Algorithm B and it achieves our expected result. Numerical examples demonstrate that Second Remedial Algorithm could converge accurately and efficiently no matter how far the test point is from the plane algebraic curve and where the initial iteration point is. - Open Access
- 5 December 2018
- Published by MDPI AG in Mathematics
- Vol. 6 (12) , 306
Hybrid Second Order Method for Orthogonal Projection onto Parametric Curve in n-Dimensional Euclidean Space
Orthogonal projection a point onto a parametric curve, three classic first order algorithms have been presented by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, H-H-H method). In this research, we give a proof of the approach’s first order convergence and its non-dependence on the initial value. For some special cases of divergence for the H-H-H method, we combine it with Newton’s second order method (hereafter, Newton’s method) to create the hybrid second order method for orthogonal projection onto parametric curve in an n-dimensional Euclidean space (hereafter, our method). Our method essentially utilizes hybrid iteration, so it converges faster than current methods with a second order convergence and remains independent from the initial value. We provide some numerical examples to confirm robustness and high efficiency of the method.
- 5 December 2018
- Published by MDPI AG in Mathematics
- Vol. 6 (12) , 306
Open AccessHybrid Second Order Method for Orthogonal Projection onto Parametric Curve in n-Dimensional Euclidean Space
Orthogonal projection a point onto a parametric curve, three classic first order algorithms have been presented by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, H-H-H method). In this research, we give a proof of the approach’s first order convergence and its non-dependence on the initial value. For some special cases of divergence for the H-H-H method, we combine it with Newton’s second order method (hereafter, Newton’s method) to create the hybrid second order method for orthogonal projection onto parametric curve in an n-dimensional Euclidean space (hereafter, our method). Our method essentially utilizes hybrid iteration, so it converges faster than current methods with a second order convergence and remains independent from the initial value. We provide some numerical examples to confirm robustness and high efficiency of the method.
- Open Access
Integrated Hybrid Second Order Algorithm for Orthogonal Projection onto a Planar Implicit Curve
The computation of the minimum distance between a point and a planar implicit curve is a very important problem in geometric modeling and graphics. An integrated hybrid second order algorithm to facilitate the computation is presented. The proofs indicate that the convergence of the algorithm is independent of the initial value and demonstrate that its convergence order is up to two. Some numerical examples further confirm that the algorithm is more robust and efficient than the existing methods.
Open AccessIntegrated Hybrid Second Order Algorithm for Orthogonal Projection onto a Planar Implicit Curve
The computation of the minimum distance between a point and a planar implicit curve is a very important problem in geometric modeling and graphics. An integrated hybrid second order algorithm to facilitate the computation is presented. The proofs indicate that the convergence of the algorithm is independent of the initial value and demonstrate that its convergence order is up to two. Some numerical examples further confirm that the algorithm is more robust and efficient than the existing methods.
- Open Access
Convergence Analysis on a Second Order Algorithm for Orthogonal Projection onto Curves
Regarding the point projection and inversion problem, a classical algorithm for orthogonal projection onto curves and surfaces has been presented by Hu and Wallner (2005). The objective of this paper is to give a convergence analysis of the projection algorithm. On the point projection problem, we give a formal proof that it is second order convergent and independent of the initial value to project a point onto a planar parameter curve. Meantime, for the point inversion problem, we then give a formal proof that it is third order convergent and independent of the initial value.
Open AccessConvergence Analysis on a Second Order Algorithm for Orthogonal Projection onto Curves
Regarding the point projection and inversion problem, a classical algorithm for orthogonal projection onto curves and surfaces has been presented by Hu and Wallner (2005). The objective of this paper is to give a convergence analysis of the projection algorithm. On the point projection problem, we give a formal proof that it is second order convergent and independent of the initial value to project a point onto a planar parameter curve. Meantime, for the point inversion problem, we then give a formal proof that it is third order convergent and independent of the initial value.
- Open Access
Hybrid Second-Order Iterative Algorithm for Orthogonal Projection onto a Parametric Surface
To compute the minimum distance between a point and a parametric surface, three well-known first-order algorithms have been proposed by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, the First-Order method). In this paper, we prove the method’s first-order convergence and its independence of the initial value. We also give some numerical examples to illustrate its faster convergence than the existing methods. For some special cases where the First-Order method does not converge, we combine it with Newton’s second-order iterative method to present the hybrid second-order algorithm. Our method essentially exploits hybrid iteration, thus it performs very well with a second-order convergence, it is faster than the existing methods and it is independent of the initial value. Some numerical examples confirm our conclusion.
Open AccessHybrid Second-Order Iterative Algorithm for Orthogonal Projection onto a Parametric Surface
To compute the minimum distance between a point and a parametric surface, three well-known first-order algorithms have been proposed by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, the First-Order method). In this paper, we prove the method’s first-order convergence and its independence of the initial value. We also give some numerical examples to illustrate its faster convergence than the existing methods. For some special cases where the First-Order method does not converge, we combine it with Newton’s second-order iterative method to present the hybrid second-order algorithm. Our method essentially exploits hybrid iteration, thus it performs very well with a second-order convergence, it is faster than the existing methods and it is independent of the initial value. Some numerical examples confirm our conclusion.
- 30 May 2017
- Published by Pushpa Publishing House in Advances and Applications in Statistics
- Vol. 50 (5) , 385-395
ON CONVOLUTION OF UNIMODAL DISTRIBUTION AND MULTIMODAL DISTRIBUTION
- 30 May 2017
- Published by Pushpa Publishing House in Advances and Applications in Statistics
- Vol. 50 (5) , 385-395
ON CONVOLUTION OF UNIMODAL DISTRIBUTION AND MULTIMODAL DISTRIBUTION
- Open Access
The Accurate Method for Computing the Minimum Distance between a Point and an Elliptical Torus
We present an accurate method to compute the minimum distance between a point and an elliptical torus, which is called the orthogonal projection problem. The basic idea is to transform a geometric problem into finding the unique real solution of a quartic equation, which is fit for orthogonal projection of a point onto the elliptical torus. Firstly, we discuss the corresponding orthogonal projection of a point onto the elliptical torus for test points at six different spatial positions. Secondly, we discuss the same problem for test points on three special positions, e.g., points on the z-axis, the long axis and the minor axis, respectively.
Open AccessThe Accurate Method for Computing the Minimum Distance between a Point and an Elliptical Torus
We present an accurate method to compute the minimum distance between a point and an elliptical torus, which is called the orthogonal projection problem. The basic idea is to transform a geometric problem into finding the unique real solution of a quartic equation, which is fit for orthogonal projection of a point onto the elliptical torus. Firstly, we discuss the corresponding orthogonal projection of a point onto the elliptical torus for test points at six different spatial positions. Secondly, we discuss the same problem for test points on three special positions, e.g., points on the z-axis, the long axis and the minor axis, respectively.
- Open Access
- 6 February 2016
- Published by MDPI AG in Algorithms
- Vol. 9 (1) , 15
A Geometric Orthogonal Projection Strategy for Computing the Minimum Distance Between a Point and a Spatial Parametric Curve
A new orthogonal projection method for computing the minimum distance between a point and a spatial parametric curve is presented. It consists of a geometric iteration which converges faster than the existing Newton’s method, and it is insensitive to the choice of initial values. We prove that projecting a point onto a spatial parametric curve under the method is globally second-order convergence.
- 6 February 2016
- Published by MDPI AG in Algorithms
- Vol. 9 (1) , 15
Open AccessA Geometric Orthogonal Projection Strategy for Computing the Minimum Distance Between a Point and a Spatial Parametric Curve
A new orthogonal projection method for computing the minimum distance between a point and a spatial parametric curve is presented. It consists of a geometric iteration which converges faster than the existing Newton’s method, and it is insensitive to the choice of initial values. We prove that projecting a point onto a spatial parametric curve under the method is globally second-order convergence.