Search results for "Delaunay triangulation"
showing 8 items of 18 documents
Anisotropic potential of velocity fields in real fluids: Application to the MAST solution of shallow water equations
2013
In the present paper it is first shown that, due to their structure, the general governing equations of uncompressible real fluids can be regarded as an "anisotropic" potential flow problem and closed streamlines cannot occur at any time. For a discretized velocity field, a fast iterative procedure is proposed to order the computational elements at the beginning of each time level, allowing a sequential solution element by element of the advection problem. Some closed circuits could appear due to the discretization error and the elements involved in these circuits could not be ordered. We prove in the paper that the total flux of these not ordered elements goes to zero by refining the compu…
Ising Spins on 3D Random Lattices
1999
We perform single-cluster Monte Carlo simulations of the Ising model on three-dimensional Poissonian random lattices of Voronoi/Delaunay type with up to 128 000 sites. For each lattice size quenched averages are computed over 96 realizations. From a finite-size scaling analysis we obtain strong evidence that the critical exponents coincide with those on regular cubic lattices.
Ising model universality for two-dimensional lattices
1993
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices of Delaunay type with up to 80\,000 sites. By applying reweighting techniques and finite-size scaling analyses to time-series data near criticality, we obtain unambiguous support that the critical exponents for the random lattice agree with the exactly known exponents for regular lattices, i.e., that (lattice) universality holds for the two-dimensional Ising model.
Remark on integrable Hamiltonian systems
1980
An extension ton degrees of freedom of the fact is established that forn=1 the time and the energy constant are canonically conjugate variables. This extension is useful in some cases to get action-angle variables from the general solution of a given integrable Hamiltonian system. As an example the Delaunay variables are proved to be canonical.
Magnetic resonance image segmentation and heart motion tracking with an active mesh based system
2002
International audience; Abstract: The work presented here relates to a method fir motion tracking in sequences of medical images. The purpose is to. quantify the general motions and the local deformations of a beating heart during a cardiac cycle. In order to achieve this goal, we first tessellate the,first image of the sequence into triangular patches. A Delaunay triangulation is applied to find the optimal set of triangles describing this image, giving a mesh covering the organs. One imposes the contours of the organs to correspond to edges of triangles so that each part of the heart (left ventricle, right ventricle, myocardium) can he described as a different set of triai izles, each set…
Copy–Move Forgery Detection by Matching Triangles of Keypoints
2015
Copy-move forgery is one of the most common types of tampering for digital images. Detection methods generally use block-matching approaches, which first divide the image into overlapping blocks and then extract and compare features to find similar ones, or point-based approaches, in which relevant keypoints are extracted and matched to each other to find similar areas. In this paper, we present a very novel hybrid approach, which compares triangles rather than blocks, or single points. Interest points are extracted from the image, and objects are modeled as a set of connected triangles built onto these points. Triangles are matched according to their shapes (inner angles), their content (c…
Mesh connectivity compression using convection reconstruction
2007
International audience; During a highly productive period running from 1995 to about 2002, the research in lossless compression of 3D meshes mainly consisted in a hard battle for the best bitrates. But for a few years, compression rates seem stabilized around 1.5 bit per vertex for the connectivity coding of usual meshes, and more and more work is dedicated to remeshing, lossy compression, or gigantic mesh compression, where memory and CPU optimizations are the new priority. However, the size of 3D models keeps growing, and many application fields keep requiring lossless compression. In this paper, we present a new contribution for single-rate lossless connectivity compression, which first …
Annealed Invariance Principle for Random Walks on Random Graphs Generated by Point Processes in R-d
2016
International audience; We consider simple random walks on random graphs embedded in R-d and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we show an annealed invariance principle for these random walks. These results hold for a large variety of point processes including Poisson point processes, Matern cluster and Matern hardcore processes which have respectively clustering and repulsiveness properties. The proof relies on the use the process of the environment seen from the particle. It allows to reconstruct the original process as an additive functional of a Markovian process und…