Results 101 to 110 of about 681,623 (204)
3D Conforming Delaunay Triangulation
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
Siu-Wing Cheng, Cheng, Siu Wing
core +1 more source
Automated non-destructive phenotyping of Camellia oleifera seedlings based on 3D point clouds
Phenotypic characterization of Camellia oleifera seedlings is crucial for cultivation management, variety breeding, and germplasm conservation. However, existing point clouds segmentation studies on this species are predominantly focused on canopy and ...
Yang Zhou +3 more
doaj +1 more source
Land Use/Land Cover (LULC) mapping plays a pivotal role in understanding the complex interplay between human activities and the natural environment.
Farzane Mohseni +2 more
doaj +1 more source
Integrating kinetic ODEs in neural networks: A physics-informed hybrid approach to reactor modeling
Mechanistic models of catalytic reactors are robust but often fail to generalize across feedstocks and operating conditions due to incomplete kinetic representations and parameter uncertainty, while purely data-driven models lack physical consistency and
Felipe Cortes Jaramillo +5 more
doaj +1 more source
Parallelization of Delaunay triangulation [PDF]
Diplomska naloga je narejena z namenom pohitritve Delaunayeve triangulacije, ki jo uporablja podjetje KobiLabs d.o.o. V prvem delu diplomske naloge smo na kratko predstavili različne tipe Delaunayeve triangulacije in izpostavili prednosti triangulacije ...
ŽAUCER, SIMON
core
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
Abstract The Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution.
École Normale +2 more
core
Research on Tracking and Detecting Algorithm for Road Signs Based on SCMCg. [PDF]
Wang F +5 more
europepmc +1 more source
Heuristics for Dynamic Delaunay Triangulation
An efficient algorithm for heuristic dynamic Delaunay triangulation has been produced. Heuristics have been tested and present a trade off between speed and accuracy.
Fielding, Victor
core
Dataset of integrated seismic and geodetic strain rates in the Kopeh Dagh Belt (NE Iran): Earthquake focal mechanisms (1969-2024) and GNSS-derived deformation parameters. [PDF]
Rashidi A +3 more
europepmc +1 more source

