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

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

Geometric Analysis and Symbol Calculus: Fourier Transform Magnetic Resonance Imaging and Wavelets

Due to its unequalled advantages, the magnetic resonance imaging (MRI) modality has truly revolutionized the diagnosis and evaluation of pathology. Because many morphological anatomic details that may not be visualized by other high tech imaging methods can now be readily shown by diagnostic MRI, it has already become the standard modality by which all other clinical imaging techniques are measured. The unique quantum physical basis of the MRI modality combined with the imaging capabilities of current computer technology has made this imaging modality a target of interdisciplinary interest for clinicians, physicists, biologists, engineers, and mathematicians. Due to the fact that MRI scanners perform corticomorphic processing, this modality is by far more complex than all the other high tech clinical imaging techniques. The purpose of this paper is to outline a phase coherent wavelet approach to Fourier transform MRI. It is based on distributional harmonic analysis on the Heisenberg nilpotent Lie group G and the associated symplectically invariant symbol calculus of pseudodifferential operators. The contour and contrast resolution of MRI scans which is controlled by symplectic filter bank processing gives the noninvasive MRI modality superiority over X-ray computed tomography (CT) in soft tissue differentiation.     

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.     

Accurate integration over atomic regions bounded by zero‐flux surfaces

The approach for the integration over a region covered by zero‐flux surface is described. This approach based on the surface triangulation technique is efficiently realized in a newly developed program TWOE . The elaborated method is tested on several atomic properties including the source function. TWOE results are compared with those produced by using well‐known existing programs. Absolute errors in computed atomic properties are shown to range usually from 10^?6 to 10^?5 au. The demonstrative examples prove that present realization has perfect convergence of atomic properties with increasing size of angular grid and allows to obtain highly accurate data even in the most difficult cases. It is believed that the developed program can be bridgehead that allows to implement atomic partitioning of any desired molecular property with high accuracy. © 2012 Wiley Periodicals, Inc.     

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     

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

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

Triangulations in CGAL

This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library .     

Efficiently navigating a random Delaunay triangulation

Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution hypothesis for the input. In this paper we analyse a new deterministic planar navigation algorithm with constant spanning ratio (w.r.t the Euclidean distance) which follows vertex adjacencies in the Delaunay triangulation. We call this strategy cone walk. We prove that given n uniform points in a smooth convex domain of unit area, and for any start point z and query point q; cone walk applied to z and q will access at most sites with complexity with probability tending to 1 as n goes to infinity. We additionally show that in this model, cone walk is ‐memoryless with high probability for any pair of start and query point in the domain, for any positive ξ. We take special care throughout to ensure our bounds are valid even when the query points are arbitrarily close to the border. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 95–136, 2016     

A vertex incremental approach for maintaining chordality

For a chordal graph G=(V,E), we study the problem of whether a new vertex u∉V and a given set of edges between u and vertices in V can be added to G so that the resulting graph remains chordal. We show how to resolve this efficiently, and at the same time, if the answer is no, specify a maximal subset of the proposed edges that can be added along with u, or conversely, a minimal set of extra edges that can be added in addition to the given set, so that the resulting graph is chordal. In order to do this, we give a new characterization of chordal graphs and, for each potential new edge uv, a characterization of the set of edges incident to u that also must be added to G along with uv. We propose a data structure that can compute and add each such set in O(n) time. Based on these results, we present an algorithm that computes both a minimal triangulation and a maximal chordal subgraph of an arbitrary input graph in O(nm) time, using a totally new vertex incremental approach. In contrast to previous algorithms, our process is on-line in that each new vertex is added without reconsidering any choice made at previous steps, and without requiring any knowledge of the vertices that might be added subsequently.