恰有两个主特征值的图与图的剖分

大量研究表明,图的主特征值的数量与图的结构有着密切关系.通过恰有两个主特征值的图的特征定义了2-邻域k-剖分图,研究了恰有两个主特征值的图与2-邻域k-剖分图之间的关系;同时给出一个2-邻域k-剖分图在k=2,3时为等部剖分的条件.     

贯穿剖分的若干性质

用有限条直线对区域 D进行的剖分称为贯穿剖分 ,形成剖分的直线称为贯穿线 .称始于内网点终止于 D的边界的线段为 D内的射线 ,如果一个剖分中的每一条网线或者是贯穿线的一部分或者是某一射线的一部分 ,则称该剖分为拟贯穿剖分 .由于贯穿剖分具有的特殊优越性 ,使其成为多元样条中最常用的剖分 .在多元样条里应用最广的均匀 1-型均匀 2 -型剖分就是贯穿剖分的特例 .但是 ,目前对贯穿剖分的性质研究较少 ,这限制了贯穿剖分优越性的进一步挖掘 .针对这一问题本文研究的贯穿剖分的多种性质 ,如 :边缘点的存在性 ,特型剖分域的存在性 ,染色定…     

环球快报招工

工作要求：你喜欢冰天雪地。喜欢冒着刺骨的寒冷,去发现关于极地气候的一切,并且做出天气预报。要求技能：你得是个数学能手,有许多数字在等着你,你可不能报错温度 。工作地点：南极。相关介绍：南极,天然“冷库”,温度比北极还要低,极端最低气温曾达-89．8℃,为世界上最冷的陆地。空气非常干燥,有“白色荒漠”之称。因气候严酷,除科考学家外,没有人居住。     

有限元方法(二)

§2. 剖分插值 本节讨论平面区域的几何剖分和相应的分片插值方法.对区域进行剖分时,基本单元可以取为三角形、矩形、四边形等等.插值函数可以取为一次(线性)或高次多项式等等.其中以三角剖分和相应的三顶点线性插值最简单,最常用,故主要讨论这一情况.为了尽快进入有限元离散化,可以只读这里的§§2.1-3而转至§3.     

辽河口附近海冰单轴压缩强度的试验与统计特征

为研究影响海冰单轴压缩强度的因素,在渤海辽河口附近海域采集冰坯,加工成方柱状冰样.在试验温度分别为-3℃,-5℃,-7℃,-10℃和-15℃下,对225个冰样沿平行和垂直自然冰表面方向进行加载.研究试样温度,加载方向,应变速率和孔隙率对海冰单轴压缩强度的影响.试验结果表明:海冰单轴强度随试样温度的降低而增加;垂直方向冰样的峰值强度高于水平方向,海冰表现为各向异性.利用试验结果建立了韧性区内海冰单轴压缩强度与应变速率和孔隙率的统计关系.     

Stokes问题的各向异性平行四边形有限元逼近

1 引言 Stokes问题是标准的混合问题,速度与压力同时计算,关于该问题有限元求解的文章很多(见文献[1-5])但大多都是基于对区域的正则剖分或拟一致剖分,即要求网格剖分满足hk/pK≤C,(A)K∈Jh,其中C>0为一常数,hk,pK分别为单元K的直径及内切园直径,在实际应用问题中,由于边界层或区域的拐角处需考虑物质的各向异性特征,此时对空间区域Q的剖分不再满足正则性或拟一致条件,而需要用各向异性网格剖分,才能更贴切地描述其真实情形.     

JYC油田8106-5井组调剖设计及效果预测

针对JYC油田的8106-5井组进行了调剖设计以及效果预测.首先,应用一种数学方法对调剖半径、调剖剂用量进行理论研究,得到8106-5井组的调剖半径为14.09 m,调剖剂用量为266 m3.接着,对调剖效果进行预测.应用油藏工程方法,确定调剖措施后各层的等效渗透率、吸水量,并通过对平面分配系数以及油井的分层含水率的计算,得到8106-5井组的日产油量为1.24 t.通过对产油量递减规律的研究,得到8106-5井组的调剖有效期和累积增油量分别为358 d和413.35 t.结果表明,研究成果对同类型油田的调剖设计及效果预测的研究有推广应用价值.     

基于新的D1三角剖分的变维数单纯算法

我们构造了关于 R~n 的一种新的三角剖分——D_1三角剖分,且证明了它比熟知的三角剖分的单纯形个数都少.基于 D_1三角剖分,我们建立了一种新的变维数单纯算法.几个数值例子表明新的 D_1三角剖分及算法的确是更有效的.     

分片代数曲线Bezout数的估计

分片代数曲线定义为二元样条函数的零点集合.首先证明了关于三角剖分的一个猜想. 随后,指出了分片线性代数曲线与四色猜想之间的内在联系.通过经典的Morgan-Scott剖分,指出分片代数曲线的ezout数的不稳定性.利用组合优化方法,得到任意阶光滑分片代数曲线的Bezout数的上界.这个上界不仅适用于三角剖分,而且对任意网线为直线段的剖分均成立.     

扬州市2005年中考数学试卷试题

一、选择题(每题3分,共36分)1.若家用电冰箱冷藏室的温度是4℃,冷冻室的温度比冷藏室的温度低22℃,则冷冻室的温度是A.-26℃B.-18℃C.26℃D.18℃2.润扬长江公路大桥的建设创造了多项国内第一,综合体现了目前我国公路桥梁建设的最高水平.据统计,其混凝土浇灌量为1060000m3,用科学记数法表示为A.1.06×106m3B.1.06×105m3C.1.06×104m3D.10.6×105m33.某同学为了解扬州车站今年“春运”期间每天乘车人数,随机抽查了其中5天的乘车人数.所抽查的这5天中每天的乘车人数是这个问题的A.总体B.个体C.样本D.样本容量4.下列图形中不是中心对称图…     

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

It is well known that the complexity of the Delaunay triangulation of $n$ points in $\RR ^d$, i.e., the number of its simplices, can be $\Omega (n^{\lceil {d}/{2}\rceil })$. In particular, in $\RR ^3$, the number of tetrahedra can be quadratic. Put another way, if the points are uniformly distributed in a cube or a ball, the expected complexity of the Delaunay triangulation is only linear. The case of points distributed on a surface is of great practical importance in reverse engineering since most surface reconstruction algorithms first construct the Delaunay triangulation of a set of points measured on a surface. In this paper we bound the complexity of the Delaunay triangulation of points distributed on the boundary of a given polyhedron. Under a mild uniform sampling condition, we provide deterministic asymptotic bounds on the complexity of the three-dimensional Delaunay triangulation of the points when the sampling density increases. More precisely, we show that the complexity is $O(n^{1.8})$ for general polyhedral surfaces and $O(n\sqrt{n})$ for convex polyhedral surfaces. Our proof uses a geometric result of independent interest that states that the medial axis of a surface is well approximated by a subset of the Voronoi vertices of the sample points.     

A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

Delaunay triangulations and Voronoi diagrams have found numerous applications in surface modeling, surface mesh generation, deformable surface modeling and surface reconstruction. Many algorithms in these applications begin by constructing the three-dimensional Delaunay triangulation of a finite set of points scattered over a surface. Their running-time therefore depends on the complexity of the Delaunay triangulation of such point sets. Although the complexity of the Delaunay triangulation of points in R³ may be quadratic in the worst case, we show in this paper that it is only linear when the points are distributed on a fixed set of well-sampled facets of R³ (e.g. the planar polygons in a polyhedron). Our bound is deterministic and the constants are explicitly given.     

Optimality of the Delaunay triangulation in ℝ d

In this paper we present new optimality results for the Delaunay triangulation of a set of points in ℝ ^d . These new results are true in all dimensionsd. In particular, we define a power function for a triangulation and show that the Delaunay triangulation minimizes the power function over all triangulations of a point set. We use this result to show that (a) the maximum min-containment radius (the radius of the smallest sphere containing the simplex) of the Delaunay triangulation of a point set in ℝ ^d is less than or equal to the maximum min-containment radius of any other triangulation of the point set, (b) the union of circumballs of triangles incident on an interior point in the Delaunay triangulation of a point set lies inside the union of the circumballs of triangles incident on the same point in any other triangulation of the point set, and (c) the weighted sum of squares of the edge lengths is the smallest for Delaunay triangulation, where the weight is the sum of volumes of the triangles incident on the edge. In addition we show that if a triangulation consists of only self-centered triangles (a simplex whose circumcenter falls inside the simplex), then it is the Delaunay triangulation.     

Optimal Delaunay Triangulations

The Delaunay triangulation, in both classic and more generalized sense, is studied in this paper for minimizing the linear interpolation error (measure in L^P-norm) for a given function. The classic Delaunay triangulation can then be characterized as an optimal triangulation that minimizes the interpolation error for the isotropic function ‖x‖^2 among all the triangulations with a given set of vertices. For a more general function, a functiondependent Delaunay triangulation is then defined to be an optimal triangulation that minimizes the interpolation error for this function and its construction can be obtained by a simple lifting and projection procedure. The optimal Delaunay triangulation is the one that minimizes the interpolation error among all triangulations with the same number of vertices, i.e. the distribution of vertices are optimized in order to minimize the interpolation error. Such a function-depend entoptimal Delaunay triangulation is proved to exist for any given convex continuous function.On an optimal Delaunay triangulation associated with f, it is proved that △↓f at the interior vertices can be exactly recovered by the function values on its neighboring vertices.Since the optimal Delaunay triangulation is difficult to obtain in practice, the concept of nearly optimal triangulation is introduced and two sufficient conditions are presented for a triangulation to be nearly optimal.     

On the average length of Delaunay triangulations

We shall show that on the average, the total length of a Delaunay triangulation is of the same order as that of a minimum triangulation, under the assumption that our points are drawn from a homogeneous planar Poisson point distribution.     

Reconstruction Using Witness Complexes

We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different scales. At a high level, our method is very similar in spirit to Chew’s surface meshing algorithm, with one notable difference though: the restricted Delaunay triangulation is replaced by the witness complex, which makes our algorithm applicable in any metric space. To prove its correctness on curves and surfaces, we highlight the relationship between the witness complex and the restricted Delaunay triangulation in 2d and in 3d. Specifically, we prove that both complexes are equal in 2d and closely related in 3d, under some mild sampling assumptions.     

Efficiently updating constrained Delaunay triangulations

TheConstrained Delaunay Triangulation of a set of obstacle line segments in the plane is the Delaunay triangulation of the endpoint set of these obstacles with the restriction that the edge set of the triangulation contains all these obstacles. In this paper we present an optimal (logn +k) algorithm for inserting an obstacle line segment or deleting an obstacle edge in the constrained Delaunay triangulation of a set ofn obstacle line segments in the plane. Herek is the number of Delaunay edges deleted and added in the triangulation during the updates.This work is supported by NSERC grant OPG0041629.     

The greedy triangulation can be computed from the Delaunay triangulation in linear time

The greedy triangulation of a finite planar point set is obtained by repeatedly inserting a shortest diagonal that does not cross those already in the plane. The Delaunay triangulation, which is the straight-line dual of the Voronoi diagram, can be produced in O(nlogn) worst-case time, and often even faster, by several practical algorithms. In this paper we show that for any planar point set S, if the Delaunay triangulation of S is given, then the greedy triangulation of S can be computed in linear worst-case time (and linear space).     

A Monotonicity Property for Weighted Delaunay Triangulations

Given a triangulation of points in the plane and a function on the points, one may consider the Dirichlet energy, which is related to the Dirichlet energy of a smooth function. In fact, the Dirichlet energy can be derived from a finite element approximation. S. Rippa showed that the Dirichlet energy (which he refers to as the “roughness”) is minimized by the Delaunay triangulation by showing that each edge flip which makes an edge Delaunay decreases the energy. In this paper, we introduce a Dirichlet energy on a weighted triangulation which is a generalization of the energy on unweighted triangulations and an analogue of the smooth Dirichlet energy on a domain. We show that this Dirichlet energy has the property that each edge flip which makes an edge weighted Delaunay decreases the energy. The proof is done by a direct calculation, and so gives an alternate proof of Rippa’s result.     

Delaunay triangulations approximate anchor hulls

Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding question for the dual Delaunay triangulation is not addressed in the literature. We show that, for two-dimensional shapes, the Delaunay triangulation approximates a specific structure which we call anchor hulls. As an application we demonstrate that our approximation result is useful for the problem of shape matching.