Introducing tree neighbouring relationship factors in forest pattern spatial analysis:weighted Delaunay triangulation method

It is important to quantify and analyze forest spatial patterns for studying biological characteristics,population interaction and the relationship between the population and environment.In this study,the forest spatial structure unit was generated based on the Delaunay triangulation model(DTM),and the weights were generated using the comprehensive values of the tree diameter at breast height,total height and crown width.The distance between neighbors determined by the DTM was weighted to transform the original coordinates of trees into logical coordinates.Then,a weighted spatial pattern(WSP)was developed.After weighting,the neighboring trees were replaced,the replacement ratio was 38.3%,and there was 57.4%of the central tree.Correlation analysis showed that the uniform angle index of the WSP was significantly correlated with the tree size standard deviation under uniformity(r=0.932)and randomness(r=0.711).The DTM method not only considers the spatial distance between trees,but also considers the non-spatial attributes of trees.By changing the spatial topological relation between trees,this method further improves the spatial structure measurement of forest.

COMBINED DELAUNAY TRIANGULATION AND ADAPTIVE FINITE ELEMENT METHOD FOR CRACK GROWTH ANALYSIS

The paper presents the utilization of the adaptive Delaunay triangulation in the finite element modeling of two dimensional crack propagation problems, including detailed description of the proposed procedure which consists of the Delaunay triangulation algorithm and an adaptive remeshing technique. The adaptive remeshing technique generates small elements around crack tips and large elements in the other regions. The resulting stress intensity factors and simulated crack propagation behavior are used to evaluate the effectiveness of the procedure. Three sample problems of a center cracked plate, a single edge cracked plate and a compact tension specimen, are simulated and their results assessed.

DELAUNAY TRIANGULATION METHOD OF CURVED SURFACES BASED ON RIEMANNIAN METRIC

A method for quality mesh generation of parametric curved surfaces isproposed. It is shown that the main difference between the proposed method and previous ones is thatour meshing process is done completely in the parametric domains with the guarantee of meshquality. To obtain this aim, the Delaunay method is extended to anisotropic context of 2D domains,and a Riemannian metric map is introduced to remedy the mapping distortion from object space toparametric domain. Compared with previous algorithms, the approach is much simpler, more robust andspeedy. The algorithm is implemented and examples for several geometries are presented todemonstrate the efficiency and validity of the method.

A new insertion sequence for incremental Delaunay triangulation

Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations （DTs）. However, the point insertion sequence has a great impact on the amount of work needed for the construction of DTs. It affects the time for both point location and structure update, and hence the overall computational time of the triangulation algorithm. In this paper, a simple deterministic insertion sequence is proposed based on the breadth-first-search on a Kd-tree with some minor modifications for better performance. Using parent nodes as search-hints, the proposed insertion sequence proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order （BRIO）, especially for non-uniform point distributions over a wide range of benchmark examples.

ADAPTIVE DELAUNAY TRIANGULATION WITH MULTIDIMENSIONAL DISSIPATION SCHEME FOR HIGH-SPEED COMPRESSIBLE FLOW ANALYSIS

Adaptive Delaunay triangulation is combined with the cell-centered upwinding algorithm to analyze inviscid high-speed compressible flow problems. The multidimensional dissipation scheme was developed and included in the upwinding algorithm for unstructured triangular meshes to improve the computed shock wave resolution. The solution accuracy is further improved by coupling an error estimation procedure to a remeshing algorithm that generates small elements in regions with large change of solution gradients, and at the same time, larger elements in other regions. The proposed scheme is further extended to achieve higher-order spatial and temporal solution accuracy. Efficiency of the combined procedure is evaluated by analyzing supersonic shocks and shock propagation behaviors for both the steady and unsteady high-speed compressible flows.

DELAUNAY TRIANGULATION AND IMAGE DENSE MATCHING IN VIEW SYNTHESIS

A new method of view synthesis is proposed based on Delaunay triangulation. The first step of this method is making the Delaunay triangulation of 2 reference images. Secondly, matching the image points using the epipolar geometry constraint. Finally, constructing the third view according to pixel transferring under the trilinear constraint. The method gets rid of the classic time consuming dense matching technique and takes advantage of Delaunay triangulation. So it can not only save the computation time but also enhance the quality of the synthesized view. The significance of this method is that it can be used directly in the fields of video coding, image compressing and virtual reality.

Density-controlled Delaunay triangulation for 2D sea area

Triangulation is widely used in scientific research, such as finite element mesh generation, surface reconstruction and the reconstruction of the density field data. This paper proposes a new method combining image processing and density-controlled Centroidal Voronoi tessellations to quickly generate a density-controlled constrained Delaunay triangulation lbr 2D sea area. Firstly, preprocess digital images of the sea area and extract the boundary of seawater region by eight-neighbor searching algorithm. Then, 1 use Odd-Even Testing＂ method to check if one random vertex is inside the boundary and insert random vertices into the boundary. Finally, we get the CDT of random vertices by density-controlled CVT-Lloyd method. We also give some comparisons with existing methods, and our method performs better in final restllt of triangulation.

DELAUNAY-BASED SURFACE RECONSTRUCTION ALGORITHM IN REVERSE ENGINEERING

Triangulation of scattered points is the first important section duringreverse engineering. New concepts of dynamic circle and closed point are put forward based oncurrent basic method. These new concepts can narrow the extent which triangulation process shouldseek through and optimize the triangles during producing them. Updating the searching edgesdynamically controls progress of triangulation. Intersection judgment between new triangle andproduced triangles is changed into intersection judgment between new triangle and searching edges.Examples illustrate superiorities of this new algorithm.

Accurate surface normal representation to facilitate gradient coil optimization on curved surface

The design methods for gradient coils are mostly based on discrete extrinsic methods(e.g.,the BioteSavart integration calculation),for which the surface normal vector strongly influences any numerical calculation of the discretized surface.Previous studies are mostly based on regular or analytical surfaces,which allow normal vectors to be expressed analytically.For certain applications,design methods for extending currentcarrying surfaces from developable or analytic geometries to arbitrary surfaces generated from a scanned point cloud are required.The key task is to correctly express the discretized normal vectors to ensure geometrical accuracy of the designed coils.Mathematically,it has been proven that applying a Delaunay triangulation to approximate a smooth surface can result in the discrete elemental normal vectors converging to those of the original surface.Accordingly,this article uses Delaunay triangulation to expand upon previous design methods so that they encompass arbitrary piecewise continuous surfaces.Two design methods,the stream function and the so-called solid isotropic material with penalization(SIMP)method,are used to design circumvolute and noncircumvolute gradient coils on general surfaces.

METHOD FOR ADAPTIVE MESH GENERATION BASED ON GEOMETRICAL FEATURES OF 3D SOLID

In order to provide a guidance to specify the element size dynamically during adaptive finite element mesh generation, adaptive criteria are firstly defined according to the relationships between the geometrical features and the elements of 3D solid. Various modes based on different datum geometrical elements, such as vertex, curve, surface, and so on, are then designed for generating local refined mesh. With the guidance of the defmed criteria, different modes are automatically selected to apply on the appropriate datum objects to program the element size in the local special areas. As a result, the control information of element size is successfully programmed covering the entire domain based on the geometrical features of 3D solid. A new algorithm based on Delatmay triangulation is then developed for generating 3D adaptive finite element mesh, in which the element size is dynamically specified to catch the geometrical features and suitable tetrahedron facets are selected to locate interior nodes continuously. As a result, adaptive mesh with good-quality elements is generated. Examples show that the proposed method can be successfully applied to adaptive finite element mesh automatic generation based on the geometrical features of 3D solid.

A digital assistant for shading paper sketches

We present a mixed reality-based assistive system for shading paper sketches.Given a paper sketch made by an artist,our interface helps inexperienced users to shade it appropriately.Initially,using a simple Delaunaytriangulation based inflation algorithm,an approximate depth map is computed.The system then highlights areas(to assist shading)based on a rendering of the 2.5-dimensional inflated model of the input contour.With the help of a mixed reality system,we project the highlighted areas back to aid users.The hints given by the system are used for shading and are smudged appropriately to apply an artistic shading to the sketch.The user is given flexibility at various levels to simulate conditions such as height and light position.Experiments show that the proposed system aids novice users in creating sketches with impressive shading.

THREE

How to automatically generate three-dimensional finite element Delaunay mesh by a peifected node connection method is introduced, where nodes are generated based on existing elements, instead of independence of node creation and elements generation in traditional node connection method. Therefore, Ihe the difficulty about how to automatically create nodes in the traditional method is overcome.

Discrete Maximum Principle and a Delaunay-Type Mesh Condition for Linear Finite Element Approximations of Two-Dimensional Anisotropic Diffusion Problems

A Delaunay-type mesh condition is developed for a linear finite element approximation of two-dimensional anisotropic diffusion problems to satisfy a discrete maximum principle.The condition is weaker than the existing anisotropic non-obtuse angle condition and reduces to the well known Delaunay condition for the special case with the identity diffusion matrix.Numerical results are presented to verify the theoretical findings.

Double Barrier Coverage in Dense Sensor Networks

When a sensor network is deployed to detect objects penetrating a protected region, it is not necessary to have every point in the deployment region covered by a sensor. It is enough if the penetrating objects are detected at some point in their trajectory. If a sensor network guarantees that every penetrating object will be detected by two distinct sensors at the same time somewhere in this area, we say that the network provides double barrier coverage （DBC）. In this paper, we propose a new planar structure of Sparse Delaunay Triangulation （SparseDT）, and prove some elaborate attributes of it. We develop theoretical foundations for double barrier coverage, and propose efficient algorithms with NS2 simulator using which one can activate the necessary sensors to guarantee double barrier coverage while the other sensors go to sleep. The upper and lower bounds of number of active nodes are determined, and we show that high-speed target will be detected efficiently with this configuration.

Coverability of Wireless Sensor Networks

The coverability of Wireless Sensor Networks （WSNs） is essentially a Quality of Service （QoS） problem that measures how well the monitored area is covered by one or more sensor nodes. The coverability of WSNs was examined by combining existing computational geometry techniques such as the Voronoi diagram and Delaunay triangulation with graph theoretical algorithmic techniques. Three new evaluation algorithms, known as CRM （Comprehensive Risk Minimization）, TWS （Threshold Weight Shortest path） and CSM （Comprehensive Support Maximization）, were introduced to better measure the coverability. The experimental results show that the CRM and CSM algorithms perform better than the MAM （MAximize Minimum weight） and MIM （Minimize Maximum weight） algorithms, respectively. In addition, the TWS algorithm can provide a lower bound detection possibility that accurately reflects the coverability of the wireless sensor nodes. Both theoretical and experimental analyses show that the proposed CRM, TWS, and CSM algorithms have O（n2） complexity.

Optimization of Triangulations Based on Serial Fault Data

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.

Rigidity of the Hexagonal Delaunay Triangulated Plane

We show the rigidity of the hexagonal Delaunay triangulated plane under Luo’s PL conformality.As a consequence,we obtain a rigidity theorem for a particular type of locally finite convex ideal hyperbolic polyhedra.

Acceleration Strategies Based on an Improved Bubble Packing Method

The bubble packing method can generate high-quality node sets in simple and complex domains.However,its efficiency remains to be improved.This study is a part of an ongoing effort to introduce several acceleration schemes to reduce the cost of simulation.Firstly,allow the viscosity coefficient c in the bubble governing equations to change according the coordinate of the bubble which are defined separately as odd and normal bubbles,and meanwhile with the saw-shape relationship with time or iterations.Then,in order to relieve the over crowded initial bubble placement,two coefficients w1 and w2 are introduced to modify the insertion criterion.The range of those two coefficients are discussed to be w1=1,w2∈[0.5,0.8].Finally,a self-adaptive termination condition is logically set when the stable system equilibrium is achieved.Numerical examples illustrate that the computing cost can significantly decrease by roughly 80%via adopting various combination of proper schemes(except the uniform placement example),and the average qualities of corresponding Delaunay triangulation substantially exceed 0.9.It shows that those strategies are efficient and can generate a node set with high quality.

NUMERICAL SOLUTION OF DIFFERENTIAL EQUATIONS IN IRREGULAR PLANE REGIONS USING QUALITY STRUCTURED CONVEX GRIDS

The variational grid generation method is a powerful tool for generating structured convex grids on irregular simply connected domains whose boundary is a polygonal Jordan curve.Several examples that show the accuracy of a finite difference approximation to the solution of a Poisson equation using this kind of structured grids have been recently reported.In this paper,we compare the accuracy of the numerical solution calculated using those structured grids and finite differences against the solution obtained with Delaunay-like triangulations on irregular regions.