Related papers: Visibility Extension via Reflection
We address the problem of covering a target segment $\overline{uv}$ using a finite set of guards $\mathcal{S}$ placed on a source segment $\overline{xy}$ within a simple polygon $\mathcal{P}$, assuming weak visibility between the target and…
In the art gallery problem, we are given a closed polygon $P$, with rational coordinates and an integer $k$. We are asked whether it is possible to find a set (of guards) $G$ of size $k$ such that any point $p\in P$ is seen by a point in…
The purpose of the current study is to investigate a special case of art gallery problem, namely Sculpture Garden Problem. In the said problem, for a given polygon $P$, the ultimate goal is to place the minimum number of guards to define…
We motivate then formulate a novel variant of the near-field reflector problem and call it the near-field reflector problem with spatial restrictions. Let $O$ be an anisotropic point source of light and assume that we are given a bounded…
We introduce the notion of a normal gallery, a gallery in which any configuration of guards that visually covers the walls covers the entire gallery. We show that any star gallery is normal and any gallery with at most two reflex corners is…
Orthogonal weight matrices are used in many areas of deep learning. Much previous work attempt to alleviate the additional computational resources it requires to constrain weight matrices to be orthogonal. One popular approach utilizes…
Summary. A modified version of the two-slit experiment is proposed in which the moveable detector/counter used to obtain the fringe distribution by counting single photons at different positions on the screen plane is replaced with a mirror…
This thesis focuses on two concepts which are widely studied in the field of computational geometry. Namely, visibility and unit disk graphs. In the field of visibility, we have studied the conflict-free chromatic guarding of polygons, for…
We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also known as the conflict-free chromatic guarding problem with…
Reflection is common in images capturing scenes behind a glass window, which is not only a disturbance visually but also influence the performance of other computer vision algorithms. Single image reflection removal is an ill-posed problem…
This paper addresses reflection removal, which is the task of separating reflection components from a captured image and deriving the image with only transmission components. Considering that the existence of the reflection changes the…
The law of reflection states that smooth surfaces reflect waves specularly, thereby acting as a mirror. This law is insensitive to disorder as long as its length scale is smaller than the wavelength. Monolayer graphene exhibits a linear…
We study the problem of placing a set $T$ of broadcast towers in a simple polygon $P$ in order for any point to locate itself in the interior of $P$. Let $V(p)$ denote the visibility polygon of a point $p$, as the set of all points $q \in…
Removing reflection artefacts from a single image is a problem of both theoretical and practical interest, which still presents challenges because of the massively ill-posed nature of the problem. In this work, we propose a technique based…
We study the classical Art Gallery Problem first proposed by Klee in 1973 from a mobile multi-agents perspective. Specifically, we require an optimally small number of agents (also called guards) to navigate and position themselves in the…
Consider a reflected diffusion on the positive half-line. We approximate it by solutions of stochastic differential equations using the penalty method: We emulate the "hard barrier" of reflection by a "soft barrier" of a large drift…
The imaging problem of a specular reflector is revisited. Retaining terms through second order in the reflector surface expansion, we derive the form of the aberration-limiting aperture for arbitrary magnification assuming no bandwidth…
Non-line-of-sight (NLOS) imaging methods are capable of reconstructing complex scenes that are not visible to an observer using indirect illumination. However, they assume only third-bounce illumination, so they are currently limited to…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
Diffusion models have become central to various image editing tasks, yet they often fail to fully adhere to physical laws, particularly with effects like shadows, reflections, and occlusions. In this work, we address the challenge of…