Waterside creatures or aquatic organisms use a fin or web to generate a thrust force. These fins or webs have a non-convex section, referred to as a non-convex shape. We investigate the drag force acting on ...Waterside creatures or aquatic organisms use a fin or web to generate a thrust force. These fins or webs have a non-convex section, referred to as a non-convex shape. We investigate the drag force acting on a non-convex plate during unsteady motion. We perform the experiment in a water tank during free fall. We fabricate the non-convex plate by cutting isosceles triangles from the side of a convex hexagonal plate. The base angle of the triangle is between 0° to 45°. The base angle is 0 indicates the convex hexagonal thin plate. We estimate the drag coefficient with the force balance acting on the model based on the image analysis technique. The results indicate that increasing the base angle by more than 30° increased the drag coefficient. The drag coefficient during unsteady motion changed with the growth of the vortex behind the model. The vortex has small vortices in the shear layer, which is related to the Kelvin-Helmholtz instabilities.展开更多
Based on the idea of serendipity element,we construct and analyze the first quadratic serendipity finite volume element method for arbitrary convex polygonalmeshes in this article.The explicit construction of quadrati...Based on the idea of serendipity element,we construct and analyze the first quadratic serendipity finite volume element method for arbitrary convex polygonalmeshes in this article.The explicit construction of quadratic serendipity element shape function is introduced from the linear generalized barycentric coordinates,and the quadratic serendipity element function space based on Wachspress coordinate is selected as the trial function space.Moreover,we construct a family of unified dual partitions for arbitrary convex polygonal meshes,which is crucial to finite volume element scheme,and propose a quadratic serendipity polygonal finite volume element method with fewer degrees of freedom.Finally,under certain geometric assumption conditions,the optimal H1 error estimate for the quadratic serendipity polygonal finite volume element scheme is obtained,and verified by numerical experiments.展开更多
An algorithm for partitioning arbitrary simple polygons into a number of convex parts was presented. The concave vertices were determined first, and then they were moved by using the method connecting the concave vert...An algorithm for partitioning arbitrary simple polygons into a number of convex parts was presented. The concave vertices were determined first, and then they were moved by using the method connecting the concave vertices with the vertices of falling into its region B,so that the primary polygon could be partitioned into two subpolygons. Finally, this method was applied recursively to the subpolygons until all the concave vertices were removed. This algorithm partitions the polygon into O(l) convex parts, its time complexity is max(O(n),O(l 2)) multiplications, where n is the number of vertices of the polygon and l is the number of the concave vertices.展开更多
In this paper,we study the problem,of calculating the minimum collision distance between two planar convex polygons when one of them moves to another along a given direction.First,several novel concepts and properties...In this paper,we study the problem,of calculating the minimum collision distance between two planar convex polygons when one of them moves to another along a given direction.First,several novel concepts and properties are explored,then an optimal algorithm OPFIV with time complexity O(log(n+m))is developed and its correctness and optimization are proved rigorously.展开更多
We consider scattering of a time harmonic incident plane wave by a convex polygon with piecewise constant impedance boundary conditions.Standard finite or boundary element methods require the number of degrees of free...We consider scattering of a time harmonic incident plane wave by a convex polygon with piecewise constant impedance boundary conditions.Standard finite or boundary element methods require the number of degrees of freedom to grow at least linearly with respect to the frequency of the incident wave in order to maintain accuracy.Extending earlier work by Chandler-Wilde and Langdon for the sound soft problem,we propose a novel Galerkin boundary element method,with the approximation space consisting of the products of plane waves with piecewise polynomials supported on a graded mesh with smaller elements closer to the corners of the polygon.Theoretical analysis and numerical results suggest that the number of degrees of freedom required to achieve a prescribed level of accuracy grows only logarithmically with respect to the frequency of the incident wave.展开更多
The problem of initial collision between convex polygons is studied in detail, and a fast algorithm for finding the embedded depth is obtained, by which the fast approximate algorithm for solving packing problems of c...The problem of initial collision between convex polygons is studied in detail, and a fast algorithm for finding the embedded depth is obtained, by which the fast approximate algorithm for solving packing problems of convex polygons in plane is constructed.展开更多
A linear-time algorithm was recently published (International Conference Proceedings ofPacific Graphics' 94/CADDM' 94, August 26-29 , 1994 , Beijing , China) for computing the convexhull of a simple polygon. I...A linear-time algorithm was recently published (International Conference Proceedings ofPacific Graphics' 94/CADDM' 94, August 26-29 , 1994 , Beijing , China) for computing the convexhull of a simple polygon. In this note we present a counter-example to that algorithm by exhibiting afamily of polygons for which the algorithm discards vertices that are on the convex hull.展开更多
In this paper, we prove that any polygon P in R^2 containing a fixed smooth, strictly convex and origin-symmetric body Γ whose boundary is real analytic in its interior, can be determined by its Γ-section functions ...In this paper, we prove that any polygon P in R^2 containing a fixed smooth, strictly convex and origin-symmetric body Γ whose boundary is real analytic in its interior, can be determined by its Γ-section functions among the polygons.展开更多
An algorithm for accelerating ray tracing through polygon projection is proposed.Ray tracing,as it is well known,invokes large amount of computation,more than 70 percent of total rendering time is spent in calculating...An algorithm for accelerating ray tracing through polygon projection is proposed.Ray tracing,as it is well known,invokes large amount of computation,more than 70 percent of total rendering time is spent in calculating the intersections between rays and objects.Bounding volume is a commonly used technique for reducing the computation time, but this necessitates intersecting rays with bounding volumes.Our new algorithm avoids the initial intersection tests between primary rays and bounding volumes by polygon projection with little extra overhead.With this technique,the bounding volumes can be constructed as tightly as one wishes.Experiments show that the new algorithm is very efficient.展开更多
文摘Waterside creatures or aquatic organisms use a fin or web to generate a thrust force. These fins or webs have a non-convex section, referred to as a non-convex shape. We investigate the drag force acting on a non-convex plate during unsteady motion. We perform the experiment in a water tank during free fall. We fabricate the non-convex plate by cutting isosceles triangles from the side of a convex hexagonal plate. The base angle of the triangle is between 0° to 45°. The base angle is 0 indicates the convex hexagonal thin plate. We estimate the drag coefficient with the force balance acting on the model based on the image analysis technique. The results indicate that increasing the base angle by more than 30° increased the drag coefficient. The drag coefficient during unsteady motion changed with the growth of the vortex behind the model. The vortex has small vortices in the shear layer, which is related to the Kelvin-Helmholtz instabilities.
基金supported by the National Natural Science Foundation of China(Nos.11871009,12271055)the Foundation of LCP and the Foundation of CAEP(CX20210044).
文摘Based on the idea of serendipity element,we construct and analyze the first quadratic serendipity finite volume element method for arbitrary convex polygonalmeshes in this article.The explicit construction of quadratic serendipity element shape function is introduced from the linear generalized barycentric coordinates,and the quadratic serendipity element function space based on Wachspress coordinate is selected as the trial function space.Moreover,we construct a family of unified dual partitions for arbitrary convex polygonal meshes,which is crucial to finite volume element scheme,and propose a quadratic serendipity polygonal finite volume element method with fewer degrees of freedom.Finally,under certain geometric assumption conditions,the optimal H1 error estimate for the quadratic serendipity polygonal finite volume element scheme is obtained,and verified by numerical experiments.
文摘An algorithm for partitioning arbitrary simple polygons into a number of convex parts was presented. The concave vertices were determined first, and then they were moved by using the method connecting the concave vertices with the vertices of falling into its region B,so that the primary polygon could be partitioned into two subpolygons. Finally, this method was applied recursively to the subpolygons until all the concave vertices were removed. This algorithm partitions the polygon into O(l) convex parts, its time complexity is max(O(n),O(l 2)) multiplications, where n is the number of vertices of the polygon and l is the number of the concave vertices.
文摘In this paper,we study the problem,of calculating the minimum collision distance between two planar convex polygons when one of them moves to another along a given direction.First,several novel concepts and properties are explored,then an optimal algorithm OPFIV with time complexity O(log(n+m))is developed and its correctness and optimization are proved rigorously.
文摘We consider scattering of a time harmonic incident plane wave by a convex polygon with piecewise constant impedance boundary conditions.Standard finite or boundary element methods require the number of degrees of freedom to grow at least linearly with respect to the frequency of the incident wave in order to maintain accuracy.Extending earlier work by Chandler-Wilde and Langdon for the sound soft problem,we propose a novel Galerkin boundary element method,with the approximation space consisting of the products of plane waves with piecewise polynomials supported on a graded mesh with smaller elements closer to the corners of the polygon.Theoretical analysis and numerical results suggest that the number of degrees of freedom required to achieve a prescribed level of accuracy grows only logarithmically with respect to the frequency of the incident wave.
文摘The problem of initial collision between convex polygons is studied in detail, and a fast algorithm for finding the embedded depth is obtained, by which the fast approximate algorithm for solving packing problems of convex polygons in plane is constructed.
文摘A linear-time algorithm was recently published (International Conference Proceedings ofPacific Graphics' 94/CADDM' 94, August 26-29 , 1994 , Beijing , China) for computing the convexhull of a simple polygon. In this note we present a counter-example to that algorithm by exhibiting afamily of polygons for which the algorithm discards vertices that are on the convex hull.
基金Project supported by the Youth Science Foundation of Shanghai Municipal Commission of Education （Grant No.214511）, and in part by the Research Grants Council of the Hong Kong SAR, China （Grant No.HKU7016/07P）
文摘In this paper, we prove that any polygon P in R^2 containing a fixed smooth, strictly convex and origin-symmetric body Γ whose boundary is real analytic in its interior, can be determined by its Γ-section functions among the polygons.
文摘An algorithm for accelerating ray tracing through polygon projection is proposed.Ray tracing,as it is well known,invokes large amount of computation,more than 70 percent of total rendering time is spent in calculating the intersections between rays and objects.Bounding volume is a commonly used technique for reducing the computation time, but this necessitates intersecting rays with bounding volumes.Our new algorithm avoids the initial intersection tests between primary rays and bounding volumes by polygon projection with little extra overhead.With this technique,the bounding volumes can be constructed as tightly as one wishes.Experiments show that the new algorithm is very efficient.
