It is hard to compute the competition number for a graph in general and characterizing a graph by its competition number has been one of important research problems in the study of competition graphs. Sano pointed out...It is hard to compute the competition number for a graph in general and characterizing a graph by its competition number has been one of important research problems in the study of competition graphs. Sano pointed out that it would be interesting to compute the competition numbers of some triangulations of a sphere as he got the exact value of the competition numbers of regular polyhedra. In this paper, we study the competition numbers of several kinds of triangulations of a sphere, and get the exact values of the competition numbers of a 24-hedron obtained from a hexahedron by adding a vertex in each face of the hexahedron and joining the vertex added in a face with the four vertices of the face, a class of dodecahedra constructed from a hexahedron by adding a diagonal in each face of the hexahedron, and a triangulation of a sphere with 3n (n≥2) vertices.展开更多
In this paper, we consider spaces of cubic C^1-spline on a class of triangulations. By using the inductive algorithm, the posed Lagrange interpolation sets are constructed for cubic spline space. It is shown that the ...In this paper, we consider spaces of cubic C^1-spline on a class of triangulations. By using the inductive algorithm, the posed Lagrange interpolation sets are constructed for cubic spline space. It is shown that the class of triangulations considered in this paper are nonsingular for S1/3 spaces. Moreover, the dimensions of those spaces exactly equal to L. L. Schuraaker＇s low bounds of the dimensions. At the end of this paper, we present an approach to construct triangulations from any scattered planar points, which ensures that the obtained triangulations for S1/3 space are nonsingular.展开更多
In this paper, we prove that the surface of any circular cone can be triangulated into 8 non-obtuse and 20 acute triangles. Furthermore, we also show that the bounds are both the best possible.
A smooth interpolatory subdivision algorithm for the generation of surfaces over arbi-trary triangulations is introduced and its convergence properties over nonuniform triangulationsstudied. For uniform data, this met...A smooth interpolatory subdivision algorithm for the generation of surfaces over arbi-trary triangulations is introduced and its convergence properties over nonuniform triangulationsstudied. For uniform data, this method is a generalization of the analysis for univariatesubdivision algorithms and for nonuniform data, an extraordinary point analysis is introducedand the local subdivision matrix anaiysis presented. It is proved that the algorithm producessmooth surfaces over arbitrary triangular networks provided the shape parameters are kept with-in an appropriate range. Finally, two graphical examples of surface interpolation overnonuniform data are given to show the smoothing process of the algorithm.AMS (MOS): 65D05, 65D15,65D17.展开更多
In this paper, the dimension of the double periodic cubic C^1 spline space over non-uniform type-2 triangulations is determined and a local support basis is given.
A near-triangular embedding is an embedded graph into some surface whose all but one facial walks are 3-gons. In this paper we show that if a graph G is a triangulation of an orientable surface Sh, then G has a near-t...A near-triangular embedding is an embedded graph into some surface whose all but one facial walks are 3-gons. In this paper we show that if a graph G is a triangulation of an orientable surface Sh, then G has a near-triangular embedding into Sk for k=h, h＋1,...1,[β（G）/2], where β（G） is the Betti number of G.展开更多
We examine a simple averaging formula for the gradieni of linear finite elemelitsin Rd whose interpolation order in the Lq-norm is O(h2) for d < 2q and nonuniformtriangulations. For elliptic problems in R2 we deriv...We examine a simple averaging formula for the gradieni of linear finite elemelitsin Rd whose interpolation order in the Lq-norm is O(h2) for d < 2q and nonuniformtriangulations. For elliptic problems in R2 we derive an interior superconvergencefor the averaged gradient over quasiuniform triangulations. Local error estimatesup to a regular part of the boundary and the effect of numerical integration arealso investigated.展开更多
In this paper a special kind of triangulated maps on the sphere called fair triangulations is enumerated with the size of maps as parameter.Moreover,the number of several other kinds of triangulations are enumerated a...In this paper a special kind of triangulated maps on the sphere called fair triangulations is enumerated with the size of maps as parameter.Moreover,the number of several other kinds of triangulations are enumerated as well.展开更多
In this paper, the chromatic sum functions of rooted biloopless nonsepavable near-triangulations on the sphere and the projective plane are studied. The chromatic sum function equations of such maps are obtained. From...In this paper, the chromatic sum functions of rooted biloopless nonsepavable near-triangulations on the sphere and the projective plane are studied. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of such maps are derived. An asymptotic evaluation and some explicit expression of enumerating functions are also derived.展开更多
In this paper, we study the chromatic triangulations on the sphere and the projective plane. sum functions of rooted nonseparable near- The chromatic sum function equations of such maps are obtained. From the chromati...In this paper, we study the chromatic triangulations on the sphere and the projective plane. sum functions of rooted nonseparable near- The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equa- tions of such maps are derived. Applying chromatic sum theory, the enumerating problem of different sorts maps can be studied, and a new method of enumeration can be obtained. Moreover, an asymptotic evaluation and some explicit expression of enumerating functions are also derived.展开更多
Three-dimensional reconstructions based on serial fault data can be divided into boundary contour splicing and end contour closure. In boundary contour splicing, the Delaunay triangulation algorithm can generate long,...Three-dimensional reconstructions based on serial fault data can be divided into boundary contour splicing and end contour closure. In boundary contour splicing, the Delaunay triangulation algorithm can generate long, narrow triangles or radial shapes and with end contour closure, the Delaunay triangulation based on the determination of the convex-concave vertices tends to generate long, narrow triangles and triangles whose sizes differ greatly, and in some cases failure. This paper presents a Delaunay triangulation algorithm based on the shortest distance first principle for boundary contour splicing and an improved algorithm which combines Delaunay triangulation based on the determination of convex-concave vertices with interpolation for end contour closure. The results show that the algorithms retain the original advantages of the algorithms while increasing the triangulation effectiveness and enhancing the universality of the algorithms.展开更多
This paper presents a nonconforming finite element scheme for the planar biharmonic equation,which applies piecewise cubic polynomials(P_(3))and possesses O(h^(2))convergence rate for smooth solutions in the energy no...This paper presents a nonconforming finite element scheme for the planar biharmonic equation,which applies piecewise cubic polynomials(P_(3))and possesses O(h^(2))convergence rate for smooth solutions in the energy norm on general shape-regular triangulations.Both Dirichlet and Navier type boundary value problems are studied.The basis for the scheme is a piecewise cubic polynomial space,which can approximate the H^(4) functions with O(h^(2))accuracy in the broken H^(2) norm.Besides,a discrete strengthened Miranda-Talenti estimate(▽^(2)_(h)·,▽^(2)_(h)·)=(Δh·,Δh·),which is usually not true for nonconforming finite element spaces,is proved.The finite element space does not correspond to a finite element defined with Ciarlet’s triple;however,it admits a set of locally supported basis functions and can thus be implemented by the usual routine.The notion of the finite element Stokes complex plays an important role in the analysis as well as the construction of the basis functions.展开更多
Accurate measurement of the transverse position of a beam is crucial in particle accelerators because it plays a key role in determining the beam parameters.Existing methods for beam-position measurement rely on the d...Accurate measurement of the transverse position of a beam is crucial in particle accelerators because it plays a key role in determining the beam parameters.Existing methods for beam-position measurement rely on the detection of image currents induced on electrodes or narrow-band wake field induced by a beam passing through a cavity-type structure.However,these methods have limitations.The indirect measurement of multiple parameters is computationally complex,requiring external calibration to determine the system parameters in advance.Furthermore,the utilization of the beam signal information is incomplete.Hence,this study proposes a novel method for measuring the absolute electron beam transverse position.By utilizing the geometric relationship between the center position of the measured electron beam and multiple detection electrodes and by analyzing the differences in the arrival times of the beam signals detected by these electrodes,the absolute transverse position of the electron beam crossing the electrode plane can be calculated.This method features absolute position measurement,a position sensitivity coefficient independent of vacuum chamber apertures,and no requirement for a symmetrical detector electrode layout.The feasibility of this method is validated through numerical simulations and beam experiments.展开更多
A total of 153 soil samples were collected from Changsha City, China, to analyze the contents of As, Cd, Cr, Cu, Hg, Mn, Ni, Pb and Zn. A combination of sampling data, multivariate statistical method, geostatistical a...A total of 153 soil samples were collected from Changsha City, China, to analyze the contents of As, Cd, Cr, Cu, Hg, Mn, Ni, Pb and Zn. A combination of sampling data, multivariate statistical method, geostatistical analysis, direct exposure method and triangulated irregular network （TIN） model was successfully employed to discriminate sources, simulate spatial distributions and evaluate children＇s health risks of heavy metals in soils. The results show that not all sites in Changsha city may be suitable for living without remediation. About 9.0% of the study area provided a hazard index （HI）1.0, and 1.9% had an HI2.0. Most high HIs were located in the southern and western areas. The element of arsenic and the pathway of soil ingestion were the largest contribution to potential health risks for children. This study indicates that we should attach great importance to the direct soil heavy metals exposure for children＇s health.展开更多
To alleviate the distortion of XRII X-ray image intensifier images in the C-arm CT computer tomography imaging system an algorithm based on the Delaunay triangulation interpolation is proposed.First the causes of the ...To alleviate the distortion of XRII X-ray image intensifier images in the C-arm CT computer tomography imaging system an algorithm based on the Delaunay triangulation interpolation is proposed.First the causes of the phenomenon the classical correction algorithms and the Delaunay triangulation interpolation are analyzed.Then the algorithm procedure is explained using flow charts and illustrations. Finally experiments are described to demonstrate its effectiveness and feasibility. Experimental results demonstrate that the Delaunay triangulation interpolation can have the following effects.In the case of the same center the root mean square distances RMSD and standard deviation STD between the corrected image with Delaunay triangulation interpolation and the ideal image are 5.760 4 ×10 -14 and 5.354 2 ×10 -14 respectively.They increase to 1.790 3 2.388 8 2.338 8 and 1.262 0 1.268 1 1.202 6 after applying the quartic polynomial model L1 and model L2 to the distorted images respectively.The RMSDs and STDs between the corrected image with the Delaunay triangulation interpolation and the ideal image are 2.489 × 10 -13 and 2.449 8 ×10 -13 when their centers do not coincide. When the quartic polynomial model L1 and model L2 are applied to the distorted images they are 1.770 3 2.388 8 2.338 8 and 1.269 9 1.268 1 1.202 6 respectively.展开更多
This paper describes two modified methods for triangular and quadrilateral meshing for finite element analysis of 2D electric machines. One is coupling the classic Delaunay method and advancing front method to generat...This paper describes two modified methods for triangular and quadrilateral meshing for finite element analysis of 2D electric machines. One is coupling the classic Delaunay method and advancing front method to generate optimal triangulation; the other is coupling the classic paving and Delaunay triangulation for optimal quadrilateral meshing. Various electric machine models are meshed successfully to demonstrate the robustness and effectiveness of the methods.展开更多
A non contact three dimensional measurement method is presented in this paper.This system consists of a laser triangulation probe,a probe head and a coordinate measuring machine (CMM).The measurement principle of th...A non contact three dimensional measurement method is presented in this paper.This system consists of a laser triangulation probe,a probe head and a coordinate measuring machine (CMM).The measurement principle of the system is discussed,and a system calibration method employing a reference ball is proposed.The geometric model involving four frames is established to calculate the data points based on the reading of the laser probe and position information from the CMM.A measuring experiment for gesso free form surface using this system is carried out.展开更多
文摘It is hard to compute the competition number for a graph in general and characterizing a graph by its competition number has been one of important research problems in the study of competition graphs. Sano pointed out that it would be interesting to compute the competition numbers of some triangulations of a sphere as he got the exact value of the competition numbers of regular polyhedra. In this paper, we study the competition numbers of several kinds of triangulations of a sphere, and get the exact values of the competition numbers of a 24-hedron obtained from a hexahedron by adding a vertex in each face of the hexahedron and joining the vertex added in a face with the four vertices of the face, a class of dodecahedra constructed from a hexahedron by adding a diagonal in each face of the hexahedron, and a triangulation of a sphere with 3n (n≥2) vertices.
基金The NSF (10471018 and 60533060) of ChinaProgram of New Century Excellent Fellowship of NECCa DoD fund (DAAD19-03-1-0375).
文摘In this paper, we consider spaces of cubic C^1-spline on a class of triangulations. By using the inductive algorithm, the posed Lagrange interpolation sets are constructed for cubic spline space. It is shown that the class of triangulations considered in this paper are nonsingular for S1/3 spaces. Moreover, the dimensions of those spaces exactly equal to L. L. Schuraaker＇s low bounds of the dimensions. At the end of this paper, we present an approach to construct triangulations from any scattered planar points, which ensures that the obtained triangulations for S1/3 space are nonsingular.
文摘In this paper, we prove that the surface of any circular cone can be triangulated into 8 non-obtuse and 20 acute triangles. Furthermore, we also show that the bounds are both the best possible.
文摘A smooth interpolatory subdivision algorithm for the generation of surfaces over arbi-trary triangulations is introduced and its convergence properties over nonuniform triangulationsstudied. For uniform data, this method is a generalization of the analysis for univariatesubdivision algorithms and for nonuniform data, an extraordinary point analysis is introducedand the local subdivision matrix anaiysis presented. It is proved that the algorithm producessmooth surfaces over arbitrary triangular networks provided the shape parameters are kept with-in an appropriate range. Finally, two graphical examples of surface interpolation overnonuniform data are given to show the smoothing process of the algorithm.AMS (MOS): 65D05, 65D15,65D17.
文摘In this paper, the dimension of the double periodic cubic C^1 spline space over non-uniform type-2 triangulations is determined and a local support basis is given.
基金the National Natural Science Foundation of China (19831080)Shanghai City Fundation of Selected Academic Research (04JC14031)
文摘A near-triangular embedding is an embedded graph into some surface whose all but one facial walks are 3-gons. In this paper we show that if a graph G is a triangulation of an orientable surface Sh, then G has a near-triangular embedding into Sk for k=h, h＋1,...1,[β（G）/2], where β（G） is the Betti number of G.
文摘We examine a simple averaging formula for the gradieni of linear finite elemelitsin Rd whose interpolation order in the Lq-norm is O(h2) for d < 2q and nonuniformtriangulations. For elliptic problems in R2 we derive an interior superconvergencefor the averaged gradient over quasiuniform triangulations. Local error estimatesup to a regular part of the boundary and the effect of numerical integration arealso investigated.
基金This article is supported by National Natural Science Foundation of China (19701002)
文摘In this paper a special kind of triangulated maps on the sphere called fair triangulations is enumerated with the size of maps as parameter.Moreover,the number of several other kinds of triangulations are enumerated as well.
基金Supported by the National Natural Science Foundation of China (No. 10771225 10871021+1 种基金 71071016) Fundamental Research Funds for the Central Universities
文摘In this paper, the chromatic sum functions of rooted biloopless nonsepavable near-triangulations on the sphere and the projective plane are studied. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of such maps are derived. An asymptotic evaluation and some explicit expression of enumerating functions are also derived.
基金Supported by National Natural Science Foundation of China (Grant No. 10771225)
文摘In this paper, we study the chromatic triangulations on the sphere and the projective plane. sum functions of rooted nonseparable near- The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equa- tions of such maps are derived. Applying chromatic sum theory, the enumerating problem of different sorts maps can be studied, and a new method of enumeration can be obtained. Moreover, an asymptotic evaluation and some explicit expression of enumerating functions are also derived.
基金Supported by the Science and Technology Foundation of Heilong-jiang Province (No.WC05C02)the Science Research Foundation of Harbin Institute of Technology (No. HIT.2003.22)
文摘Three-dimensional reconstructions based on serial fault data can be divided into boundary contour splicing and end contour closure. In boundary contour splicing, the Delaunay triangulation algorithm can generate long, narrow triangles or radial shapes and with end contour closure, the Delaunay triangulation based on the determination of the convex-concave vertices tends to generate long, narrow triangles and triangles whose sizes differ greatly, and in some cases failure. This paper presents a Delaunay triangulation algorithm based on the shortest distance first principle for boundary contour splicing and an improved algorithm which combines Delaunay triangulation based on the determination of convex-concave vertices with interpolation for end contour closure. The results show that the algorithms retain the original advantages of the algorithms while increasing the triangulation effectiveness and enhancing the universality of the algorithms.
基金supported by National Natural Science Foundation of China(Grant Nos.11871465 and 11471026)the Strategic Priority Research Program of Chinese Academy of Sciences(Grant No.XDB 41000000)。
文摘This paper presents a nonconforming finite element scheme for the planar biharmonic equation,which applies piecewise cubic polynomials(P_(3))and possesses O(h^(2))convergence rate for smooth solutions in the energy norm on general shape-regular triangulations.Both Dirichlet and Navier type boundary value problems are studied.The basis for the scheme is a piecewise cubic polynomial space,which can approximate the H^(4) functions with O(h^(2))accuracy in the broken H^(2) norm.Besides,a discrete strengthened Miranda-Talenti estimate(▽^(2)_(h)·,▽^(2)_(h)·)=(Δh·,Δh·),which is usually not true for nonconforming finite element spaces,is proved.The finite element space does not correspond to a finite element defined with Ciarlet’s triple;however,it admits a set of locally supported basis functions and can thus be implemented by the usual routine.The notion of the finite element Stokes complex plays an important role in the analysis as well as the construction of the basis functions.
基金supported by the National Key R&D Program of China(No.2022YFA1602201)。
文摘Accurate measurement of the transverse position of a beam is crucial in particle accelerators because it plays a key role in determining the beam parameters.Existing methods for beam-position measurement rely on the detection of image currents induced on electrodes or narrow-band wake field induced by a beam passing through a cavity-type structure.However,these methods have limitations.The indirect measurement of multiple parameters is computationally complex,requiring external calibration to determine the system parameters in advance.Furthermore,the utilization of the beam signal information is incomplete.Hence,this study proposes a novel method for measuring the absolute electron beam transverse position.By utilizing the geometric relationship between the center position of the measured electron beam and multiple detection electrodes and by analyzing the differences in the arrival times of the beam signals detected by these electrodes,the absolute transverse position of the electron beam crossing the electrode plane can be calculated.This method features absolute position measurement,a position sensitivity coefficient independent of vacuum chamber apertures,and no requirement for a symmetrical detector electrode layout.The feasibility of this method is validated through numerical simulations and beam experiments.
基金Project (50925417) supported by the National Funds for Distinguished Young Scientists, ChinaProject (50830301) supported by the Key Project of National Natural Science Foundation of China
文摘A total of 153 soil samples were collected from Changsha City, China, to analyze the contents of As, Cd, Cr, Cu, Hg, Mn, Ni, Pb and Zn. A combination of sampling data, multivariate statistical method, geostatistical analysis, direct exposure method and triangulated irregular network （TIN） model was successfully employed to discriminate sources, simulate spatial distributions and evaluate children＇s health risks of heavy metals in soils. The results show that not all sites in Changsha city may be suitable for living without remediation. About 9.0% of the study area provided a hazard index （HI）1.0, and 1.9% had an HI2.0. Most high HIs were located in the southern and western areas. The element of arsenic and the pathway of soil ingestion were the largest contribution to potential health risks for children. This study indicates that we should attach great importance to the direct soil heavy metals exposure for children＇s health.
基金The Natural Science Foundation of Anhui Province(No.1308085MF96)the Project of Chuzhou University(No.2012qd06,2011kj010B)+1 种基金the Scientific Research Foundation of Education Department of Anhui Province(No.KJ2014A186)the National Basic Research Program of China(973 Program)(No.2010CB732503)
文摘To alleviate the distortion of XRII X-ray image intensifier images in the C-arm CT computer tomography imaging system an algorithm based on the Delaunay triangulation interpolation is proposed.First the causes of the phenomenon the classical correction algorithms and the Delaunay triangulation interpolation are analyzed.Then the algorithm procedure is explained using flow charts and illustrations. Finally experiments are described to demonstrate its effectiveness and feasibility. Experimental results demonstrate that the Delaunay triangulation interpolation can have the following effects.In the case of the same center the root mean square distances RMSD and standard deviation STD between the corrected image with Delaunay triangulation interpolation and the ideal image are 5.760 4 ×10 -14 and 5.354 2 ×10 -14 respectively.They increase to 1.790 3 2.388 8 2.338 8 and 1.262 0 1.268 1 1.202 6 after applying the quartic polynomial model L1 and model L2 to the distorted images respectively.The RMSDs and STDs between the corrected image with the Delaunay triangulation interpolation and the ideal image are 2.489 × 10 -13 and 2.449 8 ×10 -13 when their centers do not coincide. When the quartic polynomial model L1 and model L2 are applied to the distorted images they are 1.770 3 2.388 8 2.338 8 and 1.269 9 1.268 1 1.202 6 respectively.
文摘This paper describes two modified methods for triangular and quadrilateral meshing for finite element analysis of 2D electric machines. One is coupling the classic Delaunay method and advancing front method to generate optimal triangulation; the other is coupling the classic paving and Delaunay triangulation for optimal quadrilateral meshing. Various electric machine models are meshed successfully to demonstrate the robustness and effectiveness of the methods.
基金Supported by"863"High Technology Development Comittee ofChina (No."863"- 51 1 - 942 - 0 2 4 ) National Natural Science Foun-dation of China (No.50 0 750 64)
文摘A non contact three dimensional measurement method is presented in this paper.This system consists of a laser triangulation probe,a probe head and a coordinate measuring machine (CMM).The measurement principle of the system is discussed,and a system calibration method employing a reference ball is proposed.The geometric model involving four frames is established to calculate the data points based on the reading of the laser probe and position information from the CMM.A measuring experiment for gesso free form surface using this system is carried out.
