Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles

In this paper we study two geometric data structure problems in the special case when input objects or queries are fat rectangles. We show that in this case a significant improvement compared to the general case can be achieved. We describe data structures that answer two- and three-dimensional orthogonal range reporting queries in the case when the query range is a \emph{fat} rectangle. Our two-dimensional data structure uses $O(n)$ words and supports queries in $O(\log\log U +k)$ time, where $n$ is the number of points in the data structure, $U$ is the size of the universe and $k$ is the number of points in the query range. Our three-dimensional data structure needs $O(n\log^{\varepsilon}U)$ words of space and answers queries in $O(\log \log U + k)$ time. We also consider the rectangle stabbing problem on a set of three-dimensional fat rectangles. Our data structure uses $O(n)$ space and answers stabbing queries in $O(\log U\log\log U +k)$ time.Comment: extended version of a WADS'19 pape

Approximating the Maximum Overlap of Polygons under Translation

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which maximizes its area of overlap with $P$. Our algorithm runs in $O(c n)$ time, where $c$ is a constant that depends only on $k$ and $\varepsilon$. This suggest that for polygons that are "close" to being convex, the problem can be solved (approximately), in near linear time

Bregman Voronoi Diagrams: Properties, Algorithms and Applications

The Voronoi diagram of a finite set of objects is a fundamental geometric structure that 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. In this paper, we investigate a framework for defining and building Voronoi diagrams for a broad class of distance functions called Bregman divergences. Bregman divergences include not only the traditional (squared) Euclidean distance but also various divergence measures based on entropic functions. Accordingly, Bregman Voronoi diagrams allow to define information-theoretic Voronoi diagrams in statistical parametric spaces based on the relative entropy of distributions. We define several types of Bregman diagrams, establish correspondences between those diagrams (using the Legendre transformation), and show how to compute them efficiently. We also introduce extensions of these diagrams, e.g. k-order and k-bag Bregman Voronoi diagrams, and introduce Bregman triangulations of a set of points and their connexion with Bregman Voronoi diagrams. We show that these triangulations capture many of the properties of the celebrated Delaunay triangulation. Finally, we give some applications of Bregman Voronoi diagrams which are of interest in the context of computational geometry and machine learning.Comment: Extend the proceedings abstract of SODA 2007 (46 pages, 15 figures

Minimizing the stabbing number of matchings, trees, and triangulations

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or triangulations of minimum stabbing number for a given set of points. The complexity of these problems has been a long-standing open question; in fact, it is one of the original 30 outstanding open problems in computational geometry on the list by Demaine, Mitchell, and O'Rourke. The answer we provide is negative for a number of minimum stabbing problems by showing them NP-hard by means of a general proof technique. It implies non-trivial lower bounds on the approximability. On the positive side we propose a cut-based integer programming formulation for minimizing the stabbing number of matchings and spanning trees. We obtain lower bounds (in polynomial time) from the corresponding linear programming relaxations, and show that an optimal fractional solution always contains an edge of at least constant weight. This result constitutes a crucial step towards a constant-factor approximation via an iterated rounding scheme. In computational experiments we demonstrate that our approach allows for actually solving problems with up to several hundred points optimally or near-optimally.Comment: 25 pages, 12 figures, Latex. To appear in "Discrete and Computational Geometry". Previous version (extended abstract) appears in SODA 2004, pp. 430-43

Search for supersymmetry with a dominant R-parity violating LQDbar couplings in e+e- collisions at centre-of-mass energies of 130GeV to 172 GeV

A search for pair-production of supersymmetric particles under the assumption that R-parity is violated via a dominant LQDbar coupling has been performed using the data collected by ALEPH at centre-of-mass energies of 130-172 GeV. The observed candidate events in the data are in agreement with the Standard Model expectation. This result is translated into lower limits on the masses of charginos, neutralinos, sleptons, sneutrinos and squarks. For instance, for m_0=500 GeV/c^2 and tan(beta)=sqrt(2) charginos with masses smaller than 81 GeV/c^2 and neutralinos with masses smaller than 29 GeV/c^2 are excluded at the 95% confidence level for any generation structure of the LQDbar coupling.Comment: 32 pages, 30 figure

Search for the glueball candidates f0(1500) and fJ(1710) in gamma gamma collisions

Data taken with the ALEPH detector at LEP1 have been used to search for gamma gamma production of the glueball candidates f0(1500) and fJ(1710) via their decay to pi+pi-. No signal is observed and upper limits to the product of gamma gamma width and pi+pi- branching ratio of the f0(1500) and the fJ(1710) have been measured to be Gamma_(gamma gamma -> f0(1500)). BR(f0(1500)->pi+pi-) < 0.31 keV and Gamma_(gamma gamma -> fJ(1710)). BR(fJ(1710)->pi+pi-) < 0.55 keV at 95% confidence level.Comment: 10 pages, 3 figure

Motion Planning via Manifold Samples

We present a general and modular algorithmic framework for path planning of robots. Our framework combines geometric methods for exact and complete analysis of low-dimensional configuration spaces, together with practical, considerably simpler sampling-based approaches that are appropriate for higher dimensions. In order to facilitate the transfer of advanced geometric algorithms into practical use, we suggest taking samples that are entire low-dimensional manifolds of the configuration space that capture the connectivity of the configuration space much better than isolated point samples. Geometric algorithms for analysis of low-dimensional manifolds then provide powerful primitive operations. The modular design of the framework enables independent optimization of each modular component. Indeed, we have developed, implemented and optimized a primitive operation for complete and exact combinatorial analysis of a certain set of manifolds, using arrangements of curves of rational functions and concepts of generic programming. This in turn enabled us to implement our framework for the concrete case of a polygonal robot translating and rotating amidst polygonal obstacles. We demonstrate that the integration of several carefully engineered components leads to significant speedup over the popular PRM sampling-based algorithm, which represents the more simplistic approach that is prevalent in practice. We foresee possible extensions of our framework to solving high-dimensional problems beyond motion planning.Comment: 18 page

A large multi-country outbreak of monkeypox across 41 countries in the WHO European Region, 7 March to 23 August 2022

Following the report of a non-travel-associated cluster of monkeypox cases by the United Kingdom in May 2022, 41 countries across the WHO European Region have reported 21,098 cases and two deaths by 23 August 2022. Nowcasting suggests a plateauing in case notifications. Most cases (97%) are MSM, with atypical rash-illness presentation. Spread is mainly through close contact during sexual activities. Few cases are reported among women and children. Targeted interventions of at-risk groups are needed to stop further transmission. © 2022 European Centre for Disease Prevention and Control (ECDC). All rights reserved.The authors affiliated with the World Health Organization (WHO) are alone responsible for the views expressed in this publication and they do not necessarily represent the decisions or policies of the WHO. The co-author is a fellow of the ECDC Fellowship Programme, supported financially by the European Centre for Disease Prevention and Control (ECDC). The views and opinions expressed herein do not state or reflect those of ECDC. ECDC is not responsible for the data and information collation and analysis and cannot be held liable for conclusions or opinions drawn

Search for R-Parity Violating Decays of Supersymmetric Particles in e+e−e^{+}e^{-} Collisions at Centre-of-Mass Energies near 183 GeV

Searches for pair-production of supersymmetric particles under the assumption that R-parity is violated via a single dominant $LL{\bar E}$, $LQ{\bar D}$ or ${\bar U} {\bar D} {\bar D}$ coupling are performed using the data collected by the \ALEPH\ collaboration at centre-of-mass energies of 181--184~\gev. The observed candidate events in the data are in agreement with the Standard Model expectations. Upper limits on the production cross-sections and lower limits on the masses of charginos, sleptons, squarks and sneutrinos are de rived

Measurement of W-pair production in e+e−e^+ e^- collisions at 189 GeV

The production of W-pairs is analysed in a data samplecollected by ALEPH at a mean centre-of-mass energy of 188.6 GeV,corresponding to an integrated luminosity of 174.2 pb^-1. Crosssections are given for different topologies of W decays intoleptons or hadrons. Combining all final states and assumingStandard Model branching fractions, the total W-pair cross sectionis measured to be 15.71 +- 0.34 (stat) +- 0.18 (syst) pb.Using also the W-pair data samples collected by ALEPH at lowercentre-of-mass energies, the decay branching fraction of the W bosoninto hadrons is measured to be BR (W hadrons) = 66.97+- 0.65 (stat) +- 0.32 (syst) %, allowing a determination of theCKM matrix element |V(cs)|= 0.951 +- 0.030 (stat) +- 0.015 (syst)