The Floodlight Problem

1997 ◽  
Vol 07 (01n02) ◽  
pp. 153-163 ◽  
Author(s):  
Prosenjit Bose ◽  
Leonidas Guibas ◽  
Anna Lubiw ◽  
Mark Overmars ◽  
Diane Souvaine ◽  
...  

Given three angles summing to 2π, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the i-th wedge contains ki of the points. This new result on dissecting point sets is used to prove that lights of specified angles not exceeding π can be placed at n fixed points in the plane to illuminate the entire plane if and only if the angles sum to at least 2π. We give O(n log n) algorithms for both these problems.

2020 ◽  
Vol 21 (1) ◽  
pp. 87 ◽  
Author(s):  
Laurence Boxer ◽  
P. Christopher Staecker

<p>In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results that often differ greatly from standard results in classical topology.</p><p>We introduce several measures related to fixed points for continuous self-maps on digital images, and study their properties. Perhaps the most important of these is the fixed point spectrum F(X) of a digital image: that is, the set of all numbers that can appear as the number of fixed points for some continuous self-map. We give a complete computation of F(C<sub>n</sub>) where C<sub>n</sub> is the digital cycle of n points. For other digital images, we show that, if X has at least 4 points, then F(X) always contains the numbers 0, 1, 2, 3, and the cardinality of X. We give several examples, including C<sub>n</sub>, in which F(X) does not equal {0, 1, . . . , #X}.</p><p>We examine how fixed point sets are affected by rigidity, retraction, deformation retraction, and the formation of wedges and Cartesian products. We also study how fixed point sets in digital images can be arranged; e.g., for some digital images the fixed point set is always connected.</p>


1959 ◽  
Vol 26 (4) ◽  
pp. 503-509
Author(s):  
Eli Sternberg ◽  
J. G. Chakravorty

Abstract This paper is concerned with the dynamic treatment of a transient thermoelastic problem for a semi-infinite medium which is constrained against transverse displacements and is exposed to a uniform time-dependent heating (or cooling) of its entire plane boundary. The stress distribution appropriate to this problem, in the event that the surface temperature is a step-function of time, was previously established by Danilovskaya [1] and by Mura [2]. In the present investigation the accompanying displacements are determined in closed form. In addition, an exact closed solution, in terms of error functions, is obtained for the case in which the time-dependence of the given surface temperature is of the ramp-type. The ensuing field of thermal stress is compared with the corresponding quasi-static stress distribution, with a view toward a quantitative assessment of the accompanying inertia effects as influenced by the rate at which the temperature of the boundary is altered. The results indicate that the conclusions reached in [1] and [2] are in need of essential modification once the assumption of an instantaneous change of the surface temperature is abandoned.


Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 132
Author(s):  
Youssef Errai ◽  
El Miloudi Marhrani ◽  
Mohamed Aamri

We use interpolation to obtain a common fixed point result for a new type of Ćirić–Reich–Rus-type contraction mappings in metric space. We also introduce a new concept of g-interpolative Ćirić–Reich–Rus-type contractions in b-metric spaces, and we prove some fixed point results for such mappings. Our results extend and improve some results on the fixed point theory in the literature. We also give some examples to illustrate the given results.


2019 ◽  
Vol 7 (3) ◽  
pp. 60-69 ◽  
Author(s):  
В. Юрков ◽  
V. Yurkov

A few general lines in the ordinary Euclidean plane are said to be line generators of a plane linear set. To be able to say that every line of the set belongs to one-parametrical line set we have to find their envelope. We thus create a pencil of lines. In this article it will be shown that there are a finite number of pencils in one linear set. To find a pencil of lines the linear parametrical approximation is applied. Almost all of problems concerning the parametrical approximation of figure sets are well known and deeply developed for any point sets. The problem of approximation for non-point sets is an actual one. The aim of this paper is to give a path to parametrical approximation of linear sets defined in plane. The sets are discrete and consist of finite number of lines without any order. Each line of the set is given as y = ax + b. Parametrical approximation means a transformation the discrete set of lines into completely continuous family of lines. There are some problems. 1. The problem of order. It is necessary to represent the chaotic set of lines as well-ordered one. The problem is solved by means of directed circuits. Any of chaotic sets has a finite number of directed circuits. To create an order means to find all directed circuits in the given set. 2. The problem of choice. In order to find the best approximation, for example, the simplest one it is necessary to choose the simplest circuit. Some criteria of the choice are discussed in the paper. 3. Interpolation the set of line factors. A direct approach would simply construct an interpolation for all line factors. But this can lead to undesirable oscillations of the line family. To eliminate the oscillations the special factor interpolation are suggested. There are linear sets having one or several multiple points, one or several multiple lines and various combinations of multiple points and lines. Some theorems applied to these cases are formulated in the paper.


2017 ◽  
Vol 27 (03) ◽  
pp. 177-185 ◽  
Author(s):  
Juyoung Yon ◽  
Siu-Wing Cheng ◽  
Otfried Cheong ◽  
Antoine Vigneron

Let [Formula: see text] and [Formula: see text] be two discrete point sets in [Formula: see text] of sizes [Formula: see text] and [Formula: see text], respectively, and let [Formula: see text] be a given input threshold. The largest common point set problem (LCP) seeks the largest subsets [Formula: see text] and [Formula: see text] such that [Formula: see text] and there exists a transformation [Formula: see text] that makes the bottleneck distance between [Formula: see text] and [Formula: see text] at most [Formula: see text]. We present two algorithms that solve a relaxed version of this problem under translations in [Formula: see text] and under rigid motions in the plane, and that takes an additional input parameter [Formula: see text]. Let [Formula: see text] be the largest subset size achievable for the given [Formula: see text]. Our algorithm finds subsets [Formula: see text] and [Formula: see text] of size [Formula: see text] and a transformation [Formula: see text] such that the bottleneck distance between [Formula: see text] and [Formula: see text] is at most [Formula: see text]. For rigid motions in the plane, the running time is [Formula: see text]. For translations in [Formula: see text], the running time is [Formula: see text], where [Formula: see text] for [Formula: see text] and [Formula: see text] for [Formula: see text].


2009 ◽  
Vol 30 (2) ◽  
pp. 565-594 ◽  
Author(s):  
JOSÉ ALISTE-PRIETO

AbstractIn this paper, we study translation sets for non-decreasing maps of the real line with a pattern-equivariant displacement with respect to a quasicrystal. First, we establish a correspondence between these maps and self maps of the continuous hull associated with the quasicrystal that are homotopic to the identity and preserve orientation. Then, by using first-return times and induced maps, we provide a partial description for the translation set of the latter maps in the case where they have fixed points and obtain the existence of a unique translation number in the case where they do not have fixed points. Finally, we investigate the existence of a semiconjugacy from a fixed-point-free map homotopic to the identity on the hull to the translation given by its translation number. We concentrate on semiconjugacies that are also homotopic to the identity and, under a boundedness condition, we prove a generalization of Poincaré’s theorem, finding a sufficient condition for such a semiconjugacy to exist depending on the translation number of the given map.


2019 ◽  
Vol 2019 ◽  
pp. 1-6
Author(s):  
Tawseef Rashid ◽  
Qamrul Haq Khan ◽  
Nabil Mlaiki ◽  
Hassen Aydi

In this article, we discuss a new version of metric fixed point theory. The application of this newly introduced concept is to find some fixed point results where many well-known results in literature cannot be applied. We give some examples to illustrate the given concepts and obtained results.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Muhammad Nazam ◽  
Hüseyin Işik ◽  
Khalil Javed ◽  
Muhammad Naeem ◽  
Muhammad Arshad

The aim of this study is to present fixed point results in the setting of partial b -metric spaces. A different type of contractions is used to prove fixed point results in the given space, which are real generalization of many well-known results. The readers are also provided with some very interesting examples to illustrate the feasibility of the proposed work.


1978 ◽  
Vol 21 (2) ◽  
pp. 207-211 ◽  
Author(s):  
Helga Schirmer

AbstractThe concept of a firm fixed point of a selfmap of a metric space is introduced. Loosely speaking a fixed point is firm if it cannot be moved to a point nearby with the help of a map which is arbitrarily close to the given map. It is shown that a continuum always admits a selfmap with a firm fixed point if the continuum contains a triod and if the vertex of the triod has a neighbourhood which is a dendrite. This condition holds in particular for local dendrites. Hence a local dendrite is an arc or a simple closed curve if and only if it does not admit a selfmap which has a firm fixed point.


2020 ◽  
Vol 8 (1) ◽  
pp. 3-14
Author(s):  
V. Yurkov

In this paper are considered planar point sets generated by linear conditions, which are realized in rectangular or Manhattan metric. Linear conditions are those expressed by the finite sum of the products of distances by numerical coefficients. Finite sets of points and lines are considered as figures defining linear conditions. It has been shown that linear conditions can be defined relative to other planar figures: lines, polygons, etc. The design solutions of the following general geometric problem are considered: for a finite set of figures (points, line segments, polygons...) specified on a plane with a rectangular metric, which are in a common position, it is necessary to construct sets that satisfy any linear condition. The problems in which the given sets are point and segment ones have been considered in detail, and linear conditions are represented as a sum or as relations of distances. It is proved that solution result can be isolated points, broken lines, and areas on the plane. Sets of broken lines satisfying the given conditions form families of isolines for the given condition. An algorithm for building isoline families is presented. The algorithm is based on the Hanan lattice construction and the isolines behavior in each node and each sub-region of the lattice. For isoline families defined by conditions for relation of distances, some of their properties allowing accelerate their construction process are proved. As an example for application of the described theory, the problem of plane partition into regions corresponding to a given set of points, lines and other figures is considered. The problem is generalized problem of Voronoi diagram construction, and considered in general formulation. It means the next: 1) the problem is considered in rectangular metric; 2) all given points may be integrated in various figures – separate points, line segments, triangles, quadrangles etc.; 3) the Voronoi diagram’s property of proximity is changed for property of proportionality. Have been represented examples for plane partition into regions, determined by two-point sets.


Sign in / Sign up

Export Citation Format

Share Document