9 research outputs found

    Minimum Convex Partitions and Maximum Empty Polytopes

    Full text link
    Let SS be a set of nn points in Rd\mathbb{R}^d. A Steiner convex partition is a tiling of conv(S){\rm conv}(S) with empty convex bodies. For every integer dd, we show that SS admits a Steiner convex partition with at most ⌈(n−1)/d⌉\lceil (n-1)/d\rceil tiles. This bound is the best possible for points in general position in the plane, and it is best possible apart from constant factors in every fixed dimension d≄3d\geq 3. We also give the first constant-factor approximation algorithm for computing a minimum Steiner convex partition of a planar point set in general position. Establishing a tight lower bound for the maximum volume of a tile in a Steiner convex partition of any nn points in the unit cube is equivalent to a famous problem of Danzer and Rogers. It is conjectured that the volume of the largest tile is ω(1/n)\omega(1/n). Here we give a (1−Δ)(1-\varepsilon)-approximation algorithm for computing the maximum volume of an empty convex body amidst nn given points in the dd-dimensional unit box [0,1]d[0,1]^d.Comment: 16 pages, 4 figures; revised write-up with some running times improve

    On the Beer index of convexity and its variants

    Get PDF
    Let SS be a subset of Rd\mathbb{R}^d with finite positive Lebesgue measure. The Beer index of convexity b⁥(S)\operatorname{b}(S) of SS is the probability that two points of SS chosen uniformly independently at random see each other in SS. The convexity ratio c⁥(S)\operatorname{c}(S) of SS is the Lebesgue measure of the largest convex subset of SS divided by the Lebesgue measure of SS. We investigate the relationship between these two natural measures of convexity. We show that every set S⊆R2S\subseteq\mathbb{R}^2 with simply connected components satisfies b⁥(S)≀αc⁥(S)\operatorname{b}(S)\leq\alpha\operatorname{c}(S) for an absolute constant α\alpha, provided b⁥(S)\operatorname{b}(S) is defined. This implies an affirmative answer to the conjecture of Cabello et al. that this estimate holds for simple polygons. We also consider higher-order generalizations of b⁥(S)\operatorname{b}(S). For 1≀k≀d1\leq k\leq d, the kk-index of convexity b⁥k(S)\operatorname{b}_k(S) of a set S⊆RdS\subseteq\mathbb{R}^d is the probability that the convex hull of a (k+1)(k+1)-tuple of points chosen uniformly independently at random from SS is contained in SS. We show that for every d≄2d\geq 2 there is a constant ÎČ(d)>0\beta(d)>0 such that every set S⊆RdS\subseteq\mathbb{R}^d satisfies b⁥d(S)≀ÎČc⁥(S)\operatorname{b}_d(S)\leq\beta\operatorname{c}(S), provided b⁥d(S)\operatorname{b}_d(S) exists. We provide an almost matching lower bound by showing that there is a constant Îł(d)>0\gamma(d)>0 such that for every Δ∈(0,1)\varepsilon\in(0,1) there is a set S⊆RdS\subseteq\mathbb{R}^d of Lebesgue measure 11 satisfying c⁥(S)≀Δ\operatorname{c}(S)\leq\varepsilon and b⁥d(S)≄γΔlog⁥21/Δ≄γc⁥(S)log⁥21/c⁥(S)\operatorname{b}_d(S)\geq\gamma\frac{\varepsilon}{\log_2{1/\varepsilon}}\geq\gamma\frac{\operatorname{c}(S)}{\log_2{1/\operatorname{c}(S)}}.Comment: Final version, minor revisio

    29th International Symposium on Algorithms and Computation: ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan

    Get PDF

    27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany

    Get PDF

    Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers

    No full text

    Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers

    No full text
    It is an old problem of Danzer and Rogers to decide whether it is possible arrange O(1/epsilon) points in the unit square so that every rectangle of area epsilon contains at least one of them. We show that the answer to this question is in the negative if we slightly relax the notion of rectangles, as follows. Let delta be a fixed small positive number. A quasi-rectangle is a region swept out by a continuously moving segment s, with no rotation, so that throughout the motion the angle between the trajectory of the center of s and its normal vector remains at most delta. We show that the smallest number of points needed to pierce all quasi-rectangles of area e is Theta (1/epsilon log 1/epsilon)

    Stable Isotopes in Tree Rings

    Get PDF
    This Open Access volume highlights how tree ring stable isotopes have been used to address a range of environmental issues from paleoclimatology to forest management, and anthropogenic impacts on forest growth. It will further evaluate weaknesses and strengths of isotope applications in tree rings. In contrast to older tree ring studies, which predominantly applied a pure statistical approach this book will focus on physiological mechanisms that influence isotopic signals and reflect environmental impacts. Focusing on connections between physiological responses and drivers of isotope variation will also clarify why environmental impacts are not linearly reflected in isotope ratios and tree ring widths. This volume will be of interest to any researcher and educator who uses tree rings (and other organic matter proxies) to reconstruct paleoclimate as well as to understand contemporary functional processes and anthropogenic influences on native ecosystems. The use of stable isotopes in biogeochemical studies has expanded greatly in recent years, making this volume a valuable resource to a growing and vibrant community of researchers
    corecore