No optimal 1‐planar graph triangulates any nonorientable closed surface

Suzuki [Discrete Math. 310 (2010), 6–11] proved that for any orientable closed surface F² other than the sphere, there exists an optimal 1‐planar graph which can be embedded on F² as a triangulation. However, for nonorientable closed surfaces, the existence of such graphs is unknown. In this article, we prove that no optimal 1‐planar graph triangulates a nonorientable closed surface.     

Interpolating minimal energy C1‐Surfaces on Powell–Sabin Triangulations: Application to the resolution of elliptic problems

In this article, we present a method to obtain a C¹‐surface, defined on a bounded polygonal domain Ω, which interpolates a specific dataset and minimizes a certain “energy functional.” The minimization space chosen is the one associated to the Powell–Sabin finite element, whose elements are C¹‐quadratic splines. We develop a general theoretical framework for that, and we consider two main applications of the theory. For both of them, we give convergence results, and we present some numerical and graphical examples. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 798–821, 2015     

A study of gridless method with dynamic clouds of points for solving unsteady CFD problems in aerodynamics

When solving unsteady computational fluid dynamics problems in aerodynamics with a gridless method, a cloud of points is usually required to be regenerated due to its accommodation to moving boundaries. In order to handle this problem conveniently, a fast dynamic cloud method based on Delaunay graph mapping strategy is proposed in this paper. A dynamic cloud method makes use of algebraic mapping principles and therefore points can be accurately redistributed in the flow field without any iteration. In this way, the structure of the gridless clouds is not necessarily changed so that the clouds regeneration can be avoided successfully. The spatial derivatives of the mathematical modeling of the flow are directly determined by using weighted least‐squares method in each cloud of points, and then numerical fluxes can be obtained. A dual time‐stepping method is further implemented to advance the two‐dimensional Euler equations in arbitrary Lagarangian–Eulerian formulation in time. Finally, unsteady transonic flows over two different oscillating airfoils are simulated with the above method and results obtained are in good agreement with the experimental data. Copyright © 2009 John Wiley & Sons, Ltd.     

Numerical simulations of the steady Navier–Stokes equations using adaptive meshing schemes

In this paper, we consider an adaptive meshing scheme for solution of the steady incompressible Navier–Stokes equations by finite element discretization. The mesh refinement and optimization are performed based on an algorithm that combines the so‐called conforming centroidal Voronoi Delaunay triangulations (CfCVDTs) and residual‐type local a posteriori error estimators. Numerical experiments in the two‐dimensional space for various examples are presented with quadratic finite elements used for the velocity field and linear finite elements for the pressure. The results show that our meshing scheme can equally distribute the errors over all elements in some optimal way and keep the triangles very well shaped as well at all levels of refinement. In addition, the convergence rates achieved are close to the best obtainable. Extension of this approach to three‐dimensional cases is also discussed and the main challenge is the efficient implementation of three‐dimensional CfCVDT generation that is still under development. Copyright © 2007 John Wiley & Sons, Ltd.     

Design of optical triangulation devices

This paper presents the derivation of the precise relation between the displacement of a light spot on an object's surface and the displacement of its image on the detector in an optical triangulation device, along with applications of the design of triangulation devices. Based on this relation, improved designs of optical triangulation devices, including devices of adjustable configurations, are proposed and discussed.     

A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices

A new simplicial variable dimension restart algorithm is introduced to solve the nonlinear complementarity problem on the product spaceS of unit simplices. The triangulation which underlies the algorithm differs from the triangulations ofS used thus far. Moreover, the number of rays along which the algorithm can leave the arbitrarily chosen starting point is much larger. More precisely, there is a ray leading from the starting point to each vertex ofS. In caseS is the product ofn one-dimensional unit simplices the alogrithm is similar to the octahedral algorithm onR ⁿ having 2 ⁿ rays. Also, the accuracy of an approximate solution in the terminal simplex of the algorithm is in general better than for the other algorithms onS. Computational results will show that the number of iterations for the new algorithm is much less. The examples concern the computation of equilibria in noncooperative games, exchange economies and trade models. This author is financially supported by the Netherlands Organisation for the Advancement of Pure Research (ZWO), Grant 46-98. This research is part of the VF-program “Equilibrium and Disequilibrium in Demand and Supply” which has been approved by the Netherlands ministry of education and sciences.     

Geodesic ideal triangulations exist virtually

It is shown that every non-compact hyperbolic manifold of finite volume has a finite cover admitting a geodesic ideal triangulation. Also, every hyperbolic manifold of finite volume with non-empty, totally geodesic boundary has a finite regular cover which has a geodesic partially truncated triangulation. The proofs use an extension of a result due to Long and Niblo concerning the separability of peripheral subgroups.

     

基于无衍射光的表面粗糙度三角测量及其灰色评定方法

 激光三角法是表面形貌非接触测量中的一种常用方法,在几何测量领域应用广泛。传统的激光三角法采用高斯光束作为指示光源,在机械扫描机构的配合下,通过对被测表面逐点扫描完成表面形貌的测量。采用新型的无衍射光替代传统激光光源,解决了普通高斯光束存在的“焦深”问题,简化了机械结构。并采用基于灰色系统理论的灰色滤波进行表面形貌的分离与评定,克服了原有方法对测量数据样本量和统计特性的依赖,并通过实验表明该系统能够准确地完成表面形貌的三维测量,所提出的灰色评定方法能够比较有效地进行表面形貌的分离与评定。     

二元三次样条空间S31,2(Δmn(2)) 的样条拟插值

本文首先利用由两组具有局部最小支集的样条所组成的基函数,构造非均匀2 型三角剖分上二元三次样条空间S₃^1,2(Δ_mn⁽²⁾)的若干样条拟插值算子. 这些变差缩减算子由样条函数B_ij¹支集上5 个网格点或中心和样条函数B_ij²支集上5 个网格点处函数值定义. 这些样条拟插值算子具有较好的逼近性,甚至算子V_mn（f） 能保持近最优的三次多项式性. 然后利用连续模,分析样条拟插值算子V_mn（f）一致逼近于充分光滑的实函数. 最后推导误差估计.     

依赖型值的非奇异自适应三角剖分方法

1 引言 众所周知,三角剖分是在许多科学计算如曲面设计与拟合、有限元计算以及其他大型科学计算等领域中不可回避的问题.