نتایج جستجو برای: delaunay

تعداد نتایج: 2549  

Journal: :International Journal of Computational Geometry & Applications 2017

Journal: :Mathematical Proceedings of the Cambridge Philosophical Society 2016

Journal: :CoRR 2015
Nicolas Bonichon Prosenjit Bose Jean-Lou De Carufel Ljubomir Perkovic André van Renssen

Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints. A routing algorithm on G has a competitive ratio of c if the length of the path produced by the algorithm from any vertex s to any vertex t is at most c times the length of the shortest path from s to t in G. If the length o...

2002
Xiang-Yang Li Gruia Calinescu Peng-Jun Wan

Several localized routing protocols [1] guarantee the delivery of the packets when the underlying network topology is the Delaunay triangulation of all wireless nodes. However, it is expensive to construct the Delaunay triangulation in a distributed manner. Given a set of wireless nodes, we often model the network as a unit-disk graphUDG . In this paper, we present a novel localized networking ...

2011
Pedro Machado Manhães de Castro Olivier Devillers

We analyze, implement, and evaluate a distributionsensitive point location algorithm based on the classical Jump & Walk, called Keep, Jump, & Walk. For a batch of query points, the main idea is to use previous queries to improve the current one. In practice, Keep, Jump, & Walk is actually a very competitive method to locate points in a triangulation. Regarding point location in a Delaunay trian...

2017
Jean-Daniel Boissonnat Mael Rouxel-Labbé Mathijs Wintraecken

The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This struc...

1997
Jonathan Richard Shewchuk Thomas R. Gross Omar Ghattas

Delaunay refinement is a technique for generating unstructured meshes of triangles or tetrahedra suitable for use in the finite element method or other numerical methods for solving partial differential equations. Popularized by the engineering community in the mid-1980s, Delaunay refinement operates by maintaining a Delaunay triangulation or Delaunay tetrahedralization, which is refined by the...

2008
F. Stimpfl S. Selberherr

Modeling, generation, and adaptation of unstructured meshes based on e.g. simplicies is of utmost importance for scientific computing, especially in the area of Technology Computer Aided Design (TCAD). Not only does the quality of the results depend on the quality of the mesh, a solution is even impossible, if a mesh cannot be successfully generated. The simulation of microelectronic devices su...

2008
Yuanxin Liu Wenjie He Dinesh Manocha Jack Snoeyink

Yuanxin Liu: Computations of Delaunay and higher order triangulations, with applications to splines. (Under the direction of Jack Snoeyink.) Digital data that consist of discrete points are frequently captured and processed by scientific and engineering applications. Due to the rapid advance of new data gathering technologies, data set sizes are increasing, and the data distributions are becomi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید