带有临界点的解析函数的圆模式逼近

一个圆模式是指复平面C上具有特定交角的一种圆格局.给定有界单连通区域ΩC内一个具有有限多个临界点的解析函数F,首先利用有分枝圆模式枝术构造了F的离散近似解,然后证明了这个近似解序列在Ω的紧子集上一致收敛于该解析函数F.这为带有临界点的解析函数的数值计算提供一种新的方法.     

Spanners of additively weighted point sets

We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs (p,r) where p is a point in the plane and r is a real number. The distance between two points (pi,ri) and (pj,rj) is defined as |pipj|−ri−rj. We show that in the case where all ri are positive numbers and |pipj|?ri+rj for all i, j (in which case the points can be seen as non-intersecting disks in the plane), a variant of the Yao graph is a (1+?)-spanner that has a linear number of edges. We also show that the Additively Weighted Delaunay graph (the face-dual of the Additively Weighted Voronoi diagram) has a spanning ratio bounded by a constant. The straight-line embedding of the Additively Weighted Delaunay graph may not be a plane graph. Given the Additively Weighted Delaunay graph, we show how to compute a plane straight-line embedding that also has a spanning ratio bounded by a constant in time.     

Rapid and flexible laser marking and engraving of tilted and curved surfaces

We present a novel method for rapid and flexible laser marking and engraving of tilted, curved and freeform work-piece surfaces. The method is based on integrating a three-dimensional (3D) laser measurement system into a 3D laser marking system. We use the same laser source and optics for measurement and processing with a minimum of additional hardware components. A low power CW laser regime is used to measure the 3D shape of a work-piece surface while a high-peak power-pulsed laser regime is used for processing. The acquired 3D surface data are used to determine the 3D trajectory of the processing beam focus. Neither the 3D shape of the work-piece nor its orientation needs to be known in advance as long as the processed surface lies within the working range of the 3D laser processing system. This eliminates the need for exact work-piece positioning before processing and substantially improves processing flexibility (allowing, e.g. variations in work-piece shape or/and orientation from mark to mark). This paper discusses key issues concerning an implementation of the method and presents typical examples of markings and engravings, which demonstrate the advantages of the method with respect to the existing industrial 2D and 3D laser marking and engraving methods. The method can also be applied to flexible laser structuring and microprocessing of curved surfaces.     

Kinetic collision detection between two simple polygons

We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the two polygons, called the external relative geodesic triangulation, which certifies their disjointness. We show how this subdivision can be maintained as a kinetic data structure when the polygons are moving, and analyze its performance in the kinetic setting.     

A time-of-scan laser triangulation technique for distance measurements

This paper reports the development of an electro-optic device for relative distance measurement. The time-of-scan triangulation technique has been used as measurement principle and a rotating mirror employed as beam deflection system. A calibration technique is needed to calculate the geometrical parameters of the system. The device has an accuracy of 100 μm, a working distance of 20 cm and a range of 10 mm. The accuracy obtained depends on the instability of the rotation speed of the mechanical scanner that affects the measurement of the scanning time.     

N‐flips in even triangulations on the sphere

A triangulation is said to be even if each vertex has even degree. For even triangulations, define the N‐flip and the P2‐flip as two deformations preserving the number of vertices. We shall prove that any two even triangulations on the sphere with the same number of vertices can be transformed into each other by a sequence of N‐ and P2‐flips. © 2005 Wiley Periodicals, Inc. J. Graph Theory     

Bivariate C1 Cubic Spline Spaces Over Even Stratified Triangulations

It is well-known that the basic properties of a bivariate spline space such as dimension and approximation order depend on the geometric structure of the partition. The dependence of geometric structure results in the fact that the dimension of a C ¹ cubic spline space over an arbitrary triangulation becomes a well-known open problem. In this paper, by employing a new group of smoothness conditions and conformality conditions, we determine the dimension of bivariate C ¹ cubic spline spaces over a so-called even stratified triangulation.