400 research outputs found
Anisotropic Diagrams: Labelle Shewchuk approach revisited
International audienceF. Labelle and J. Shewchuk have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the metric field, such Voronoi diagrams can be refined so that their dual is a triangulation, with elements shaped according to the specified anisotropic metric field. We propose an alternative view of the construction of these diagrams and a variant of Labelle and Shewchuk's meshing algorithm. This variant computes the Voronoi vertices using a higher dimensional power diagram and refines the diagram as long as dual triangles overlap. We see this variant as a first step toward a 3-dimensional anisotropic meshing algorithm
Curved Voronoi diagrams
Voronoi diagrams are fundamental data structures that have been extensively studied in Computational Geometry. A Voronoi diagram can be defined as the minimization diagram of a finite set of continuous functions. Usually, each of those functions is interpreted as the distance function to an object. The as- sociated Voronoi diagram subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. Affine di- agrams, i.e. diagrams whose cells are convex polytopes, are well understood. Their properties can be deduced from the properties of polytopes and they can be constructed efficiently. The situation is very different for Voronoi dia- grams with curved regions. Curved Voronoi diagrams arise in various contexts where the objects are not punctual or the distance is not the Euclidean dis- tance. We survey the main results on curved Voronoi diagrams. We describe in some detail two general mechanisms to obtain effective algorithms for some classes of curved Voronoi diagrams. The first one consists in linearizing the diagram and applies, in particular, to diagrams whose bisectors are algebraic hypersurfaces. The second one is a randomized incremental paradigm that can construct affine and several planar non-affine diagrams. We finally introduce the concept of Medial Axis which generalizes the concept of Voronoi diagram to infinite sets. Interestingly, it is possible to efficiently construct a certified approximation of the medial axis of a bounded set from the Voronoi diagram of a sample of points on the boundary of the set
Anisotropic Diagrams: Labelle Shewchuk approach revisited
F. Labelle and J. Shewchuk have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the metric field, such Voronoi diagrams can be refined so that their dual is a triangulation, with elements shaped according to the specified anisotropic metric field. We propose an alternative view of the construction of these diagrams and a variant of Labelle and Shewchuk's meshing algorithm. This variant computes the Voronoi vertices using a higher dimensional power diagram and refines the diagram as long as dual triangles overlap. We see this variant as a first step toward a 3-dimensional anisotropic meshing algorithm
Distributed Computation of Virtual Coordinates
International audienceSensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol – one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, we describe how to compute on the network in a distributed and local manner a special geometric embedding of the graph. This embedding supports a geometric routing protocol based on the ”virtual” coordinates of the nodes derived from the embedding
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere
International audienceWe propose two ways to compute the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed for the plane. We use the so-called space of circles as mathematical background for this work. We present a fully robust implementation built upon existing generic algorithms provided by the Cgal library. The efficiency of the implementation is established by benchmarks
Robust and Efficient Delaunay triangulations of points on or close to a sphere
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed for the plane. The space of circles gives the mathematical background for this work. We implemented the two approaches in a fully robust way, building upon existing generic algorithms provided by the cgal library. The effciency and scalability of the method is shown by benchmarks
Multidifferential study of identified charged hadron distributions in -tagged jets in proton-proton collisions at 13 TeV
Jet fragmentation functions are measured for the first time in proton-proton
collisions for charged pions, kaons, and protons within jets recoiling against
a boson. The charged-hadron distributions are studied longitudinally and
transversely to the jet direction for jets with transverse momentum 20 GeV and in the pseudorapidity range . The
data sample was collected with the LHCb experiment at a center-of-mass energy
of 13 TeV, corresponding to an integrated luminosity of 1.64 fb. Triple
differential distributions as a function of the hadron longitudinal momentum
fraction, hadron transverse momentum, and jet transverse momentum are also
measured for the first time. This helps constrain transverse-momentum-dependent
fragmentation functions. Differences in the shapes and magnitudes of the
measured distributions for the different hadron species provide insights into
the hadronization process for jets predominantly initiated by light quarks.Comment: All figures and tables, along with machine-readable versions and any
supplementary material and additional information, are available at
https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2022-013.html (LHCb
public pages
Study of the decay
The decay is studied
in proton-proton collisions at a center-of-mass energy of TeV
using data corresponding to an integrated luminosity of 5
collected by the LHCb experiment. In the system, the
state observed at the BaBar and Belle experiments is
resolved into two narrower states, and ,
whose masses and widths are measured to be where the first uncertainties are statistical and the second
systematic. The results are consistent with a previous LHCb measurement using a
prompt sample. Evidence of a new
state is found with a local significance of , whose mass and width
are measured to be and , respectively. In addition, evidence of a new decay mode
is found with a significance of
. The relative branching fraction of with respect to the
decay is measured to be , where the first
uncertainty is statistical, the second systematic and the third originates from
the branching fractions of charm hadron decays.Comment: All figures and tables, along with any supplementary material and
additional information, are available at
https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2022-028.html (LHCb
public pages
Measurement of the ratios of branching fractions and
The ratios of branching fractions
and are measured, assuming isospin symmetry, using a
sample of proton-proton collision data corresponding to 3.0 fb of
integrated luminosity recorded by the LHCb experiment during 2011 and 2012. The
tau lepton is identified in the decay mode
. The measured values are
and
, where the first uncertainty is
statistical and the second is systematic. The correlation between these
measurements is . Results are consistent with the current average
of these quantities and are at a combined 1.9 standard deviations from the
predictions based on lepton flavor universality in the Standard Model.Comment: All figures and tables, along with any supplementary material and
additional information, are available at
https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2022-039.html (LHCb
public pages
Diagrammes de Voronoi généraux et applications
Voronoi diagrams are fundamental data structures that have been extensively studied in Computational Geometry. A Voronoi diagram can be defined as the minimization diagram of a finite set of continuous functions. Usually, each of those functions is interpreted as the distance function to an object. The associated Voronoi diagram subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space.Affine diagrams, i.e. diagrams whose cells are convex polytopes, are well understood. Their properties can be deduced from the properties of polytopes and they can be constructed efficiently.The first part of this thesis is dedicated to the presentation and classification of Voronoi diagrams. We discuss the most studied varieties of Voronoi diagrams, before putting these diagrams in the context of abstract Voronoi diagrams, a notion inherited from Klein. This allows us to present in a general setting the question of recognizing classical Voronoi diagrams by looking at their bisectors, a point of view initiated by Aurenhammer.In the second part, we focus on the study of anisotropic Voronoi diagrams, and the ways of computing their dual mesh, if it is well defined. If the dual mesh is not well defined, we study some ways of refining the diagram in order to obtain a well-defined dual. We first use the definitions of Labelle and Shewchuk and the linearization procedure, as presented in the previous part. This allows us to define an algorithm which is the natural consequence of Part~I.The third part is then devoted to a different approach to anisotropic meshing. By changing the definition of an anisotropic mesh into the one of a locally uniform anisotropic mesh, we allow the design of simple anisotropic mesh generation algorithms in 2D and 3D.Finally, the fourth part of this thesis is devoted to the application of a different kind of Voronoi diagrams, namely power diagrams, to the question of greedy routing in ad hoc networks. There again, the local properties of triangulations play a crucial role. We prove how some local properties of regular triangulations, which are a generalization of Delaunay triangulations, imply global properties in terms of routing.Les diagrammes de Voronoi sont des structures de données fondamentales qui ont été étudiées en détail dans le domaine de la géométrie algorithmique. Un diagramme de Voronoi peut être défini comme le diagramme de minimisation d'un ensemble fini de fonctions continues. On interprète en général chacune de ces fonctions comme la fonction distance à un objet. Le diagramme de Voronoi correspondant partitionne l'espace de définition en régions, chacune d'entre elle réunissant les points qui sont plus proches d'un object que de tous les autres. On peut définir de nombreuses variantes des diagrammes de Voronoi, selon les classes d'objets, de fonctions distance et d'espace de définition considérés. Les diagrammes affines, c'est-à-dire les diagrammes dont les cellules sont des polytopes convexes, sont bien connus. Leurs propriétés peuvent être déduites de celles des polytopes, et on peut les construire efficacement. La première partie de cette thèse s'attache à présenter et classifier les diagrammes de Voronoi. Nous cataloguons les variétés de diagrammes de Voronoi les plus étudiées, avant de les replacer dans le contexte des diagrammes de Voronoi abstraits, une notion initialement proposée par Klein. Cela nous permet de présenter dans un cadre général la question de la caractérisation des diagrammes de Voronoi classiques en fonction de la forme de leurs bissecteurs, un point de vue développé d'abord par Aurenhammer.Dans une deuxième partie, nous nous concentrons sur l'étude des diagrammes de Voronoi anisotropes, et sur les façons de calculer leur maillage dual, dans les cas où il est bien défini. Si celui-ci ne l'est pas, nous étudions des méthodes de raffinement du diagramme en vue d'obtenir un dual bien défini. Nous utilisons d'abord les définitions de Labelle et Shewchuk et la procédure de linéarisation présentée dans la partie précédente. Cela nous permet ensuite de définir un algorithme qui apparaît comme une conséquence naturelle de la première partie.La troisième partie est consacrée à une approche différente de la génération de maillages anisotropes. En remplaçant la définition de maillage anisotrope par celle de maillage anisotrope localement uniforme, nous parvenons à construire simplement un algorithme prouvé de génération de maillage anisotrope en dimension 2 et 3.Enfin, la quatrième partie de cette thèse considère l'application d'un autre type de diagramme de Voronoi, les diagrammes de puissance, à la question du routage glouton dans les réseaux ad hoc. Ici encore, les propriétés locales des triangulations jouent un rôle crucial. Nous montrons comment l'obtention de certaines propriétés locales des triangulations régulières, qui sont une généralisation des triangulations de Delaunay, permet de garantir des propriétés globales en termes de routage
- …