5 resultados para Generalized Gross Laplacian

em Universitat de Girona, Spain


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The author studies random walk estimators for radiosity with generalized absorption probabilities. That is, a path will either die or survive on a patch according to an arbitrary probability. The estimators studied so far, the infinite path length estimator and finite path length one, can be considered as particular cases. Practical applications of the random walks with generalized probabilities are given. A necessary and sufficient condition for the existence of the variance is given, together with heuristics to be used in practical cases. The optimal probabilities are also found for the case when one is interested in the whole scene, and are equal to the reflectivities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A topological analysis of intracule and extracule densities and their Laplacians computed within the Hartree-Fock approximation is presented. The analysis of the density distributions reveals that among all possible electron-electron interactions in atoms and between atoms in molecules only very few are located rigorously as local maxima. In contrast, they are clearly identified as local minima in the topology of Laplacian maps. The conceptually different interpretation of intracule and extracule maps is also discussed in detail. An application example to the C2H2, C2H4, and C2H6 series of molecules is presented

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the ornamental plant production region of Girona (Spain), which is one of the largest of its kind in southern Europe, most of the surface is irrigated using wide blocked-end furrows. The objectives of this paper were: (1) to evaluate the irrigation scheduling methods used by ornamental plant producers; (2) to analyse different scenarios in order to assess how they affect irrigation performance; (3) to evaluate the risk of deep percolation; and (4) to calculate gross water productivity. A two-year study in a representative commercial field, planted with Prunus cerasifera ‘Nigra’, was carried out. The irrigation dose applied by the farmers was slightly smaller than the required water dose estimated by the use of two different methods: the first based on soil water content, and the second based on evapotranspiration. Distribution uniformity and application efficiency were high, with mean values above 87%. Soil water content measurements revealed that even at the end of the furrow, where the infiltrated water depth was greatest, more than 90% of the infiltrated water was retained in the shallowest 40 cm of the soil; accordingly, the risk of water loss due to deep percolation was minimal. Gross water productivity for ornamental tree production was € 11.70 m–3, approximately 20 times higher than that obtained with maize in the same region