Results 181 to 190 of about 7,016 (227)

A Terrain-Constrained TIN Approach for High-Precision DEM Reconstruction Using UAV Point Clouds. [PDF]

J Imaging
He Z, Gan S, Yuan X.
europepmc   +1 more source

Formation Dynamics of Honeycomb-Like Capsules and Sponge-Like Biofilms in <i>Micrococcus</i> Reveal a Novel Heavy Metal Avoidance Strategy. [PDF]

Glob Chall
Kawamura T, Naito Y, Onishi Y, Sivakumaran RA, Yanagihara Y, Matsui E.   +5 more
europepmc   +1 more source

Simulation and experimental verification of the precision finishing method for optical free-form surface segmentation. [PDF]

PLoS One
Jiang C, Zhang E, Zhang W, Hu J, Guo J, Li X.   +5 more
europepmc   +1 more source

Excavating trajectory planning of electric shovel based on dynamic excavating volume prediction. [PDF]

Sci Rep
Wu J, Liu R, Lin B.
europepmc   +1 more source

Structural tolerance and Delaunay triangulation

Information Processing Letters, 1999
In this paper we consider the tolerance of a geometric or combinatorial structure associated to a set of points as a measure of how much the set of points can be perturbed while leaving the (topological or combinatorial) structure essentially unchanged ...
Manuel Abellanas, FERRÁN Hurtado, Pedro Ramos   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Realizability of delaunay triangulations

Information Processing Letters, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Constrained delaunay triangulations

Algorithmica, 1987
Given a set of n vertices in the plane together with a set of noncrossing, straight-line edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the Delaunay triangulation.
openaire   +1 more source

Hexagonal Delaunay Triangulation

2009
We present a novel and robust algorithm for triangulating point clouds in ℝ2. It is based on a highly adaptive hexagonal subdivision scheme of the input domain. That hexagon mesh has a dual triangular mesh with the following properties: any angle of any triangle lies in the range between 43.9° and 90°, the aspect ratio of triangles is bound ...
Gerd Sußner, Günther Greiner
openaire   +1 more source

Parallel constrained Delaunay triangulation on the GPU

International Journal of Geographical Information Science, 2017
In this paper, we propose a new graphics processing unit (GPU) method able to compute the 2D constrained Delaunay triangulation (CDT) of a planar straight-line graph consisting of points and segments.
Narcis Coll
exaly   +2 more sources

The Delaunay constrained triangulation: the Delaunay stable algorithms

1999 IEEE International Conference on Information Visualization (Cat. No. PR00210), 2003
Delaunay triangulation is well known for its use in geometric design. A derived version of this structure, the Delaunay constrained triangulation, takes into account the triangular mesh problem in presence of rectilinear constraints. The Delaunay constrained triangulation is very useful for CAD, topography and mapping and in finite element analysis ...
L. Rognant, Jean-Marc Chassery, S. Goze, J. G. Planès   +3 more
openaire   +1 more source