As a boundary-type meshless method, the singular hybrid boundary node method（SHBNM） is based on the modified variational principle and the moving least square（MLS） approximation, so it has the advantages of both b...As a boundary-type meshless method, the singular hybrid boundary node method（SHBNM） is based on the modified variational principle and the moving least square（MLS） approximation, so it has the advantages of both boundary element method（BEM） and meshless method. In this paper, the dual reciprocity method（DRM） is combined with SHBNM to solve Poisson equation in which the solution is divided into particular solution and general solution. The general solution is achieved by means of SHBNM, and the particular solution is approximated by using the radial basis function（RBF）. Only randomly distributed nodes on the bounding surface of the domain are required and it doesn＇t need extra equations to compute internal parameters in the domain. The postprocess is very simple. Numerical examples for the solution of Poisson equation show that high convergence rates and high accuracy with a small node number are achievable.展开更多
In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping （HC） a...In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping （HC） algorithm. If the ray pierces the patch only once, we locate the parametric value of the intersection to a smaller triangular domain, which is determined by pairs of lines and quadratic curves, by using a multi-degree reduction method. The triangular domain is iteratively clipped into a smaller one by combining a subdivision method, until the domain size reaches a prespecified threshold. When the ray intersects the patch more than once, Descartes＇ rule of signs and a split step are required to isolate the intersection points. The algorithm can be proven to clip the triangular domain with a cubic convergence rate after an appropriate preprocessing procedure. The proposed algorithm has many attractive properties, such as the absence of an initial guess and insensitivity to small changes in coefficients of the original problem. Experiments have been conducted to illustrate the efficacy of our method in solving ray-triangular Bezier patch intersection problems.展开更多
基金Foundation item： Supported by the National Natural Science Foundation of China（50608036）
文摘As a boundary-type meshless method, the singular hybrid boundary node method（SHBNM） is based on the modified variational principle and the moving least square（MLS） approximation, so it has the advantages of both boundary element method（BEM） and meshless method. In this paper, the dual reciprocity method（DRM） is combined with SHBNM to solve Poisson equation in which the solution is divided into particular solution and general solution. The general solution is achieved by means of SHBNM, and the particular solution is approximated by using the radial basis function（RBF）. Only randomly distributed nodes on the bounding surface of the domain are required and it doesn＇t need extra equations to compute internal parameters in the domain. The postprocess is very simple. Numerical examples for the solution of Poisson equation show that high convergence rates and high accuracy with a small node number are achievable.
基金Project supported by the National Natural Science Foundation of China （Nos. 61100105, 61572020, and 61472332）, the Natural Science Foundation of Fujian Province of China （No. 2015J01273）, and the Fundamental Research Funds for the Central Universities, China （Nos. 20720150002 and 20720140520）
文摘In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping （HC） algorithm. If the ray pierces the patch only once, we locate the parametric value of the intersection to a smaller triangular domain, which is determined by pairs of lines and quadratic curves, by using a multi-degree reduction method. The triangular domain is iteratively clipped into a smaller one by combining a subdivision method, until the domain size reaches a prespecified threshold. When the ray intersects the patch more than once, Descartes＇ rule of signs and a split step are required to isolate the intersection points. The algorithm can be proven to clip the triangular domain with a cubic convergence rate after an appropriate preprocessing procedure. The proposed algorithm has many attractive properties, such as the absence of an initial guess and insensitivity to small changes in coefficients of the original problem. Experiments have been conducted to illustrate the efficacy of our method in solving ray-triangular Bezier patch intersection problems.
