Results 211 to 220 of about 26,216 (246)
Some of the next articles are maybe not open access.

Incremental Delaunay Triangulation

1994
Dani Lischinski 580 ETC Building Cornell University Ithaca, NY 14850, USA danix@graphics.cornell.edu } Introduction } This gem gives a simple algorithm for the incremental construction of the Delaunay triangulation (DT) and the Voronoi diagram (VD) of a set of points in the plane. A triangulation is called Delaunay if it satis es the empty circumcircle
openaire   +1 more source

Fast Localized Delaunay Triangulation

2005
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost imposed by control information is limited and it supports geographical routing algorithms that offer guaranteed convergence. This paper presents a localized algorithm that builds a
Filipe Araújo, Luís Rodrigues
openaire   +1 more source

The Delaunay tetrahedralization from Delaunay triangulated surfaces

Proceedings of the eighteenth annual symposium on Computational geometry, 2002
Given a surface mesh F in R 3 with vertex set S and consisting of Delaunay triangles, we want to construct the Delaunay tetrahedralization of S.We present an algorithm which constructs the Delaunay tetrahedralization of S given a bounded degree spanning subgraph T of F.
openaire   +1 more source

Delaunay Triangulation

2020
Simena Dinas, Hector J. Martínez
openaire   +1 more source

3D Conforming Delaunay Triangulation

2014
A three-dimensional domain with piecewise linear boundary elements can be represented as a piecewise linear complex (PLC) of linear cells – vertices, edges, polygons, and polyhedra – that satisfy the following properties [4]. First, no vertex lies in the interior of an edge and every two edges are interior-disjoint. Second, the boundary of a polygon or
openaire   +3 more sources

Delaunay triangulation

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

Delaunay Triangulation

2008
Shashi Shekhar, Hui Xiong
openaire   +1 more source

Decremental Delaunay triangulation

ACM SIGGRAPH 99 Conference abstracts and applications, 1999
Richard Hammersley, Hong-Qian (Karen) Lu
openaire   +1 more source

Delaunay Triangulations

1997
Mark de Berg   +3 more
openaire   +1 more source

An adaptive spatial clustering algorithm based on delaunay triangulation

Computers, Environment and Urban Systems, 2011
Min Deng, Qiliang Liu, Tao Cheng
exaly  

Home - About - Disclaimer - Privacy