Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Proximal Delaunay Triangulation Regions  [PDF]
J. F. Peters
Mathematics , 2014,
Abstract: A main result in this paper is the proof that proximal Delaunay triangulation regions are convex polygons. In addition, it is proved that every Delaunay triangulation region has a local Leader uniform topology.
Delaunay triangulation of manifolds  [PDF]
Jean-Daniel Boissonnat,Ramsay Dyer,Arijit Ghosh
Computer Science , 2013,
Abstract: We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact manifold, a manifold Delaunay complex is produced provided the transition functions are bi-Lipschitz with a constant close to 1, and the sample points meet a local density requirement; no smoothness assumptions are required. If the transition functions are smooth, the output is a triangulation of the manifold. The output complex is naturally endowed with a piecewise flat metric which, when the original manifold is Riemannian, is a close approximation of the original Riemannian metric. In this case the ouput complex is also a Delaunay triangulation of its vertices with respect to this piecewise flat metric.
Study on Delaunay Triangulation with the Islets Constraints  [PDF]
Dong Wei, Xinghua Liu
Intelligent Information Management (IIM) , 2010, DOI: 10.4236/iim.2010.26045
Abstract: Aiming at Delaunay triangulation with islets constrains in terrain simulation. A general Delaunay triangulation algorithm for constrained data set with islets is proposed. The algorithm firstly constructs Constrained Delaunay Triangulation with constraint polygons which are inner boundary of islets, then according to topological relations within edge, surface, arc segment, applies bidirectional search to find the triangle in islet, lastly it carries on certain corresponding processing to complete the Delaunay triangulation algorithm with islets. The analyses show the algorithm simple, fast speed. The algorithm can be used in 3-D terrain vision.
Properties of the Delaunay Triangulation  [PDF]
Oleg R. Musin
Mathematics , 2003,
Abstract: We defined several functionals on the set of all triangulations of the finite system of points in d-space achieving global minimum on the Delaunay triangulation (DT). We consider a so called "parabolic" functional and prove it attains its minimum on DT in all dimensions. As the second example we treat "mean radius" functional (mean of circumcircle radii of triangles) for planar triangulations. As the third example we treat a so called "harmonic" functional. For a triangle this functional equals the sum of squares of sides over area. Finally, we consider a discrete analog of the Dirichlet functional. DT is optimal for these functionals only in dimension two.
A weak definition of Delaunay triangulation  [PDF]
Vin de Silva
Computer Science , 2003,
Abstract: We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it applies to hyperbolic and hemispherical geometries and to Edelsbrunner's weighted Delaunay triangulation. In spherical geometry, we establish a similar theorem under a genericity condition. The weak definition finds natural application in the problem of approximating a point-cloud data set with a simplical complex.
Research on Algorithm of the Point Set in the Plane Based on Delaunay Triangulation  [PDF]
Bin Yang, Shuyuan Shang
American Journal of Computational Mathematics (AJCM) , 2012, DOI: 10.4236/ajcm.2012.24046

In the paper, an improved algorithm is presented for Delaunay triangulation of the point-set in the plain. Based on the original algorithm, we propose the notion of removing circle. During the process of triangulation, and the circle dynamically moves, the algorithm which is simple and practical, therefore evidently accelerates the process of searching a new point, while generating a new triangle. Then it shows the effect of the algorithm in the finite element mesh.

Formal study of plane Delaunay triangulation  [PDF]
Jean-Fran?ois Dufourd,Yves Bertot
Computer Science , 2010,
Abstract: This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe triangulations, we rely on a combinatorial hypermap specification framework we have been developing for years. We embed hypermaps in the plane by attaching coordinates to elements in a consistent way. We then describe what are legal and illegal Delaunay edges and a flipping operation which we show preserves hypermap, triangulation, and embedding invariants. To prove the termination of the algorithm, we use a generic approach expressing that any non-cyclic relation is well-founded when working on a finite set.
Improved Incremental Randomized Delaunay Triangulation  [PDF]
Olivier Devillers
Computer Science , 1999,
Abstract: We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the levels below. Point location is done by marching in a triangulation to determine the nearest neighbor of the query at that level, then the march restarts from that neighbor at the level below. Using a small sample (3%) allows a small memory occupation; the march and the use of the nearest neighbor to change levels quickly locate the query.
On Deletion in Delaunay Triangulation  [PDF]
Olivier Devillers
Computer Science , 1999,
Abstract: This paper presents how the space of spheres and shelling may be used to delete a point from a $d$-dimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear number of times. This algorithm may be viewed as a variation of Heller's algorithm, which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper.
Constrained Delaunay Triangulation for Ad Hoc Networks
D. Satyanarayana,S. V. Rao
Journal of Computer Networks and Communications , 2008, DOI: 10.1155/2008/160453
Abstract: Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper, we propose a new spanner called constrained Delaunay triangulation (CDT) which considers both geometric properties and network requirements. The CDT is formed by introducing a small set of constraint edges into local Delaunay triangulation (LDel) to reduce the number of hops between nodes in the network graph. We have simulated the CDT using network simulator (ns-2.28) and compared with Gabriel graph (GG), relative neighborhood graph (RNG), local Delaunay triangulation (LDel), and planarized local Delaunay triangulation (PLDel). The simulation results show that the minimum number of hops from source to destination is less than other spanners. We also observed the decrease in delay, jitter, and improvement in throughput.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.