How to Cover Most of a Point Set with a V-Shape of Minimum Width
نویسندگان
چکیده
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two vertices (see Figure 1). We describe a randomized algorithm that, given n points and an integer k ≥ 0, finds the minimum-width V-shape enclosing all but k of the points with probability 1− 1/n for any c > 0, with expected running time O(cn(k + 1) log n(log n log log n + k)).
منابع مشابه
How to Cover a Point Set with a V-Shape of Minimum Width
A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are mirror-symmetric with respect to the line xy. The width of a balanced V-shape is the width of the strips. We first present an O(n logn) time algorithm to co...
متن کاملEcomorphology of Kura Berbel (Barbus cyri, De Filippi, 1865) in Sefidrud River Basine
This study was conducted to investigate the relationship between body shape and environmental factors related to a rivarian ecosystem in Kura barbel (Barbus cyri) of the Sefidrud River basin. For this purpose, a number of 285 specimens were sampled from three rivers with different habitat properties including the Taleghan, Totkabon and Kloraz Rivers. The relationship between body shape (extract...
متن کاملNational Minimum Data Set for Antimicrobial Resistance Management: Toward Global Surveillance System
Background: Success of infection treatment depends on the availability of accurate, reliable, and comprehensive data, information, and knowledge at the point of therapeutic decision-making. The identification of a national minimum data set will support the development and implementation of an effective surveillance system. The goal of this study was to develop a national antimicrobial resistanc...
متن کاملTOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملMixed Roman domination and 2-independence in trees
Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacentor incident to at least one element $yin Vcup E$ for which $f(y)=2$. The weight of anMRDF $f$ is $sum _{xin Vcup E} f(x)$. The mi...
متن کامل