EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS

1999 ◽  
Vol 09 (01) ◽  
pp. 63-79
Author(s):  
XUEHOU TAN
Keyword(s):  
Lower Bounds ◽  
Simple Polygon ◽  
Upper Bounds ◽  
The Other ◽  
Art Gallery ◽  
Art Gallery Problem ◽  
Monotone Polygons ◽  
Polygonal Chains ◽  
The Given

We study the art gallery problem restricted to edge guards and straight walkable polygons. An edge guard is the guard that patrols individual edges of the polygon. A simple polygon P is called straight walkable if there are two vertices s and t in P and we can move two points montonically on two polygonal chains of P from s to t, one clockwise and the other counterclockwise, such that two points are always mutually visible. For instance, monotone polygons and spiral polygons are straight walkable. We show that ⌊(n+2)/5⌋ edge guards are always sufficient to watch and n-vertex gallery of this type. Furthermore, we also show that if the given polygon is straight walkable and rectilinear, then ⌊(n+3)/6⌋ edge guards are sufficient. Both of our upper bounds match the known lower bounds.

LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS

2010 ◽  
Vol 20 (05) ◽  
pp. 601-630 ◽  
Author(s):  
YOAV AMIT ◽  
JOSEPH S. B. MITCHELL ◽  
ELI PACKER
Keyword(s):  
Experimental Evidence ◽  
Lower Bounds ◽  
Input Data ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Approximation Methods ◽  
Optimal Result ◽  
Coverage Problem ◽  
Art Gallery ◽  
Art Gallery Problem

We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the "art gallery problem", is known to be NP-hard, so most recent research has focused on heuristics and approximation methods. We evaluate our heuristics through experimentation, comparing the upper bounds on the optimal guard number given by our methods with computed lower bounds based on heuristics for placing a large number of visibility-independent "witness points". We give experimental evidence that our heuristics perform well in practice, on a large suite of input data; often the heuristics give a provably optimal result, while in other cases there is only a small gap between the computed upper and lower bounds on the optimal guard number.

Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints

2019 ◽  
Vol 29 (02) ◽  
pp. 95-120 ◽  
Author(s):  
Prosenjit Bose ◽  
André van Renssen
Keyword(s):  
Line Segment ◽  
Large Family ◽  
Upper Bounds ◽  
The Other ◽  
Additional Property ◽  
Graph Partitions ◽  
Set Of Points ◽  
The Given

We present improved upper bounds on the spanning ratio of constrained [Formula: see text]-graphs with at least 6 cones and constrained Yao-graphs with 5 or at least 7 cones. Given a set of points in the plane, a Yao-graph partitions the plane around each vertex into [Formula: see text] disjoint cones, each having aperture [Formula: see text], and adds an edge to the closest vertex in each cone. Constrained Yao-graphs have the additional property that no edge properly intersects any of the given line segment constraints. Constrained [Formula: see text]-graphs are similar to constrained Yao-graphs, but use a different method to determine the closest vertex. We present tight bounds on the spanning ratio of a large family of constrained [Formula: see text]-graphs. We show that constrained [Formula: see text]-graphs with [Formula: see text] ([Formula: see text] and integer) cones have a tight spanning ratio of [Formula: see text], where [Formula: see text] is [Formula: see text]. We also present improved upper bounds on the spanning ratio of the other families of constrained [Formula: see text]-graphs. These bounds match the current upper bounds in the unconstrained setting. We also show that constrained Yao-graphs with an even number of cones ([Formula: see text]) have spanning ratio at most [Formula: see text] and constrained Yao-graphs with an odd number of cones ([Formula: see text]) have spanning ratio at most [Formula: see text]. As is the case with constrained [Formula: see text]-graphs, these bounds match the current upper bounds in the unconstrained setting, which implies that like in the unconstrained setting using more cones can make the spanning ratio worse.

The Art Gallery Problem is ∃ℝ-complete

2022 ◽  
Vol 69 (1) ◽  
pp. 1-70
Author(s):  
Mikkel Abrahamsen ◽  
Anna Adamaszek ◽  
Tillmann Miltzow
Keyword(s):  
Simple Polygon ◽  
Art Gallery ◽  
Arbitrary Degree ◽  
Minimum Cardinality ◽  
Art Gallery Problem ◽  
Algebraic Set ◽  
Classic Problem ◽  
Finite Set ◽  
Roots Of Polynomials ◽  
System Of Polynomial Equations

The Art Gallery Problem (AGP) is a classic problem in computational geometry, introduced in 1973 by Victor Klee. Given a simple polygon 풫 and an integer k , the goal is to decide if there exists a set G of k guards within 풫 such that every point p ∈ 풫 is seen by at least one guard g ∈ G . Each guard corresponds to a point in the polygon 풫, and we say that a guard g sees a point p if the line segment pg is contained in 풫. We prove that the AGP is ∃ ℝ-complete, implying that (1) any system of polynomial equations over the real numbers can be encoded as an instance of the AGP, and (2) the AGP is not in the complexity class NP unless NP = ∃ ℝ. As a corollary of our construction, we prove that for any real algebraic number α, there is an instance of the AGP where one of the coordinates of the guards equals α in any guard set of minimum cardinality. That rules out many natural geometric approaches to the problem, as it shows that any approach based on constructing a finite set of candidate points for placing guards has to include points with coordinates being roots of polynomials with arbitrary degree. As an illustration of our techniques, we show that for every compact semi-algebraic set S ⊆ [0, 1] 2 , there exists a polygon with corners at rational coordinates such that for every p ∈ [0, 1] 2 , there is a set of guards of minimum cardinality containing p if and only if p ∈ S . In the ∃ ℝ-hardness proof for the AGP, we introduce a new ∃ ℝ-complete problem ETR-INV. We believe that this problem is of independent interest, as it has already been used to obtain ∃ ℝ-hardness proofs for other problems.

scholarly journals Lower Estimate of Clique Size via Edge Coloring

2021 ◽  
Vol 27_NS1 (1) ◽  
pp. 8-15
Author(s):  
Balázs Király ◽  
Sándor Szabó
Keyword(s):  
Lower Bounds ◽  
Numerical Experiments ◽  
Lower Estimate ◽  
Edge Coloring ◽  
Clique Number ◽  
Upper Bounds ◽  
Search Algorithms ◽  
The One ◽  
The Given ◽  
Better Than

In many clique search algorithms well coloring of the nodes is employed to find an upper bound of the clique number of the given graph. In an earlier work a non-traditional edge coloring scheme was proposed to get upper bounds that are typically better than the one provided by the well coloring of the nodes. In this paper we will show that the same scheme for well coloring of the edges can be used to find lower bounds for the clique number of the given graph. In order to assess the performance of the procedure we carried out numerical experiments.

The acquisition of Hungarian recursive PPs

2018 ◽  
Vol 4 (1) ◽  
pp. 105-123
Author(s):  
Ágnes Langó-Tóth
Keyword(s):  
Language Acquisition ◽  
Functional Element ◽  
The Other ◽  
Functional Head ◽  
Experiment Subject ◽  
The Given

Abstract In this study an experiment is presented on how Hungarian children interpret two word orders of recursive PPs (subject-PP-verb and PP-subject-verb order). According to the research of Roeper (2011) and Hollebrandse and Roeper (2014), children tend to give conjunctive interpretation to multiple embedded sentences at the beginning of language acquisition. This interpretation later turns into an adult-like, recursive interpretation. Our aim is to discover (i) whether Hungarian children start with conjunction as well, and whether (ii) the apparently more salient functional head lévő appearing in Hungarian recursive PPs can help them to acquire the correct, recursive interpretation early. We also want to find out whether (iii) the word orders in recursive PPs have an influence on the acquisition of children. In this paper two experiments are presented conducted with 6 and 8-year-olds and adults, in which the participants were asked to choose between two pictures. One of the pictures depicted recursive and the other one depicted conjunctive interpretation of the given sentence. In the first experiment subject-PP-verb order was tested, but in the second one sentences were tested with PP-subject-verb order. We will claim that lévő, which is (arguably) a more salient Hungarian functional element than -i, does not help children to acquire the embedded reading of recursive sentences, because both of them are overt functional heads. However, the two types of word orders affect the acquisition of recursive PPs. PP-subject-verb order is easier to compute because the order of the elements in the sentences and the order of the elements in the pictures matches.

Growth Characteristics of Activated Sludges Acclimated to para-Nitrophenol in Batch and Continuous Modes

1994 ◽  
Vol 29 (7) ◽  
pp. 327-333
Author(s):  
Y. Matsui ◽  
F. Yamaguchi ◽  
Y. Suwa ◽  
Y. Urushigawa
Keyword(s):  
Growth Characteristics ◽  
The Other ◽  
Operational Mode ◽  
Continuous Mode ◽  
Relative Resistance ◽  
Batch Mode ◽  
The Given ◽  
Operational Modes ◽  
Very High ◽  
Sensitive Group

Activated sludges were acclimated to p-nitrophenol (PNP) in two operational modes, a batch and a continuous. The operational mode of the PNP acclimation of activated sludges strongly affected the physiological characteristics of predominant microorganisms responsible for PNP degradation. Predominant PNP degraders in the sludge in batch mode (Sludge B) had lower PNP affinity and were relatively insensitive to PNP concentration. Those of the sludge in continuous mode (Sludge C), on the other hand, had very high PNP affinity and were sensitive to PNP. MPN enumeration of PNP degraders in sludge B and C using media with different PNP concentrations (0.05, 0.2,0.5 and 2.0 mM) supported the above results. Medium with 0.2 mM of PNP did not recover PNP degraders in sludge C well, while it recovered PNP degraders in sludge B as well as the medium with 0.05 mM did. When switching from one operational mode to the other, the predominant population in sludge B shifted to the sensitive group, but that of sludge C did not shift at the given loading of PNP, showing relative resistance to inhibitive concentration.

Giving and Promising

2018 ◽  
Author(s):  
Jean-Yves Lacoste ◽  
Oliver O’Donovan
Keyword(s):  
The Other ◽  
Face To Face ◽  
Present Experience ◽  
The World ◽  
The Given

Giving and promise must be thought together. Being-in-the world entails being-with the other, who is both “given” and bearer of a gift promised. But any disclosure may be understood as a gift; it is not anthropomorphic to speak of “self-giving” with a wider reference than person-to-person disclosure. Which implies that no act of giving can exhaust itself in its gift. Present experience never brings closure to self-revealing. Yet giving is crystallized into “the given,” the closure of gift. “The given” is what it is, needing no gift-event to reveal it. But the given, too, is precarious, and can be destabilized when giving brings us face to face with something unfamiliar. Nothing appears without a promise of further appearances, and God himself can never be “given.”

scholarly journals Multilevel Monte Carlo methods and lower–upper bounds in initial margin computations

2020 ◽  
Vol 26 (2) ◽  
pp. 131-161
Author(s):  
Florian Bourgey ◽  
Stefano De Marco ◽  
Emmanuel Gobet ◽  
Alexandre Zhou
Keyword(s):  
Monte Carlo ◽  
Lower Bounds ◽  
Asymptotic Optimality ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Independent Random Variables ◽  
Outer Function ◽  
Control Problems ◽  
Multilevel Monte Carlo ◽  
Primal Dual

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.

Lower Bounds to the Eigenvalues in One-Dimensional Problems by a Shift in the Weight Function

1970 ◽  
Vol 37 (2) ◽  
pp. 267-270 ◽  
Author(s):  
D. Pnueli
Keyword(s):  
Lower Bound ◽  
Weight Function ◽  
Lower Bounds ◽  
Variational Formulation ◽  
Ritz Method ◽  
The Other ◽  
One Dimensional ◽  
Systematic Shift ◽  
The One ◽  
Detailed Computation

A method is presented to obtain both upper and lower bound to eigenvalues when a variational formulation of the problem exists. The method consists of a systematic shift in the weight function. A detailed procedure is offered for one-dimensional problems, which makes improvement of the bounds possible, and which involves the same order of detailed computation as the Rayleigh-Ritz method. The main contribution of this method is that it yields the “other bound;” i.e., the one which cannot be obtained by the Rayleigh-Ritz method.

scholarly journals Bounding the Size and Probability of Epidemics on Networks

2008 ◽  
Vol 45 (2) ◽  
pp. 498-512 ◽  
Author(s):  
Joel C. Miller
Keyword(s):  
Infectious Disease ◽  
Lower Bounds ◽  
Upper Bounds ◽  
Marginal Probability ◽  
Transmission Properties ◽  
Disease Spreading ◽  
Special Case

We consider an infectious disease spreading along the edges of a network which may have significant clustering. The individuals in the population have heterogeneous infectiousness and/or susceptibility. We define the out-transmissibility of a node to be the marginal probability that it would infect a randomly chosen neighbor given its infectiousness and the distribution of susceptibility. For a given distribution of out-transmissibility, we find the conditions which give the upper (or lower) bounds on the size and probability of an epidemic, under weak assumptions on the transmission properties, but very general assumptions on the network. We find similar bounds for a given distribution of in-transmissibility (the marginal probability of being infected by a neighbor). We also find conditions giving global upper bounds on the size and probability. The distributions leading to these bounds are network independent. In the special case of networks with high girth (locally tree-like), we are able to prove stronger results. In general, the probability and size of epidemics are maximal when the population is homogeneous and minimal when the variance of in- or out-transmissibility is maximal.

Sign in / Sign up

Export Citation Format

Share Document