Results 81 to 90 of about 191,849 (199)
Generalized Delaunay Triangulation for Planar Graphs
We introduce the notion of generalized Delaunay triangulation of a planar straight-line graphG=(V, E) in the Euclidean plane and present some characterizations of the triangulation. It is shown that the generalized Delaunay triangulation has the property
D.T.Lee, A.K.Lin
core +1 more source
Delaunay triangulation based intelligent system for the diagnosis of covid from the low radiation CXR images. [PDF]
Sasikaladevi N.
europepmc +1 more source
Exact Computation of the Color Function for Triangular Element Interfaces
We propose a robust algorithm, the Front2VOF algorithm, to compute the color function for triangular element interfaces in Front‐Tracking methods on a Cartesian mesh. ABSTRACT The calculation of the volume enclosed by curved surfaces discretized into triangular elements and a cube is of great importance in different domains, such as computer graphics ...
Jieyun Pan +8 more
wiley +1 more source
Parallel constrained Delaunay triangulation [PDF]
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight line graph consisting of points and segments. The method is based on an incremental insertion, taking special care to avoid conflicts
Coll Arnau, Narcís +5 more
core +2 more sources
Using Delaunay triangulation to sample whole-specimen color from digital images. [PDF]
Valvo JJ +6 more
europepmc +1 more source
Technology of 3d relief modelling based on Delaunay triangulation algorithms
This paper represents the algorithm of superimposing underwater relief and land relief basing on heterogeneous initial data with the use of Delaunay triangulation. As a result of superimposition a qualitative 3D relief model has been created.
Andrey Gachenko, Alexey Khmelnov
doaj +1 more source
The case for an epiphyte area index
Three distinct ecosystems where epiphytes contribute a substantial vegetative area in the canopy.
Collin Wischmeyer +3 more
wiley +1 more source
Triangulirajmo mnogokotnik [PDF]
This paper considers different approaches how to divide polygons intotriangles what is known as a polygon triangulation. Polygons can be very complex in geodesic applications (they could have a lot of concave vertices, they could contain holes) therefore
Borut Žalik, Marko Lamot
doaj
A Monge–Ellipse Descriptor for Interpretable Quantification of Pore Architecture in Rock Images
A Monge‐inspired geometric descriptor quantifies how neighboring pores are organized in segmented rock images. Each pore is represented by a second‐moment ellipse, and local pore triplets are evaluated through external homothetic centers. Applied to carbonate thin sections, the descriptor separates pore architectures that porosity alone cannot ...
Raphael M. Tromer +7 more
wiley +1 more source
Aiming to the multi-satellite joint ground coverage issue, the geometric characteristics of satellite constellations and their earth coverage is analyzed.
SONG Zhiming +5 more
doaj +1 more source

