Results 21 to 30 of about 456 (184)
Improved Routing on the Delaunay Triangulation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Bonichon +5 more
openaire +4 more sources
Constrained Construction of Planar Delaunay Triangulations without Flipping
The construction of Voronoi diagrams and Delaunay triangulations finds wide application in many branches of science. Delaunay triangulations have properties which make them more desirable than other triangulations for the same node set.
Vera V Galishnikova, Peter Jan Pahl
doaj +1 more source
Problems, methods and technologies of combined 3D model construction for underwater and above-water relief [PDF]
In the article we describe the methods for construction of underwater 3D relief (bathymetry) and combining it with the corresponding ground relief (terrain) when the bathymetry information is of much lower quality than that of terrain.
Gachenko Andrey, Hmelnov Alexei
doaj +1 more source
Implementing Data-Dependent Triangulations with Higher Order Delaunay Triangulations
The Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ignoring their elevation ...
Natalia Rodríguez, Rodrigo I. Silveira
doaj +1 more source
Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological ...
John R. Jungck +3 more
doaj +1 more source
Excitable Delaunay Triangulations [PDF]
PurposeDelaunay triangulations provide a good alternative to existing approaches of modelling unstructured unconventional computers. Experimental research in novel and emerging computing paradigms and materials shows a great progress in designing laboratory prototypes of spatially extended computing devices. In these devices, computation is implemented
openaire +3 more sources
A Toroidal Maxwell–Cremona–Delaunay Correspondence
We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: • A toroidal graph embedding Γ is positive equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors incident to each ...
Jeff Erickson, Patrick Lin
doaj +1 more source
Quasi-Dense Matching Algorithm for Close-Range Image Combined With Feature Line Constraint
Point-based sparse or dense matching can typically obtain satisfactory 3D point clouds of general contour features, but the deformation problem at the edges of artificial objects is prominent.
Jingxue Wang, Xuetao Zheng, Zhenghui Xu
doaj +1 more source
Minimum-error triangulations for sea surface reconstruction
We apply state-of-the-art computational geometry methods to the problem of reconstructing a time-varying sea surface from tide gauge records. Our work builds on a recent article by Nitzke et al.
Anna Arutyunova +8 more
doaj +1 more source
Toughness and Delaunay triangulations [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

