English
Related papers

Related papers: Visibility Extension via Reflective Edges to an Ex…

200 papers

Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…

Computational Geometry · Computer Science 2014-05-06 Paul Accisano , Alper Üngör

We devise an algorithm for maintaining the visibility polygon of any query point in a dynamic polygonal domain, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, we update the data structures…

Computational Geometry · Computer Science 2020-11-20 Sanjana Agrwal , R. Inkulu

Circuits and extended formulations are classical concepts in linear programming theory. The circuits of a polyhedron are the elementary difference vectors between feasible points and include all edge directions. We study the connection…

Optimization and Control · Mathematics 2023-08-04 Steffen Borgwardt , Matthias Brugger

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

Combinatorics · Mathematics 2013-04-30 David Avis , Hans Raj Tiwary

One of the attractions of homological mirror symmetry is that it not only implies the previous predictions of mirror symmetry (e.g., curve counts on the quintic), but it should in some sense be `less of a coincidence' than they are and…

Symplectic Geometry · Mathematics 2020-11-03 Nick Sheridan

We propose an extrapolation technique that allows accuracy improvement of the discrete dipole approximation computations. The performance of this technique was studied empirically based on extensive simulations for 5 test cases using many…

Optics · Physics 2008-07-29 Maxim A. Yurkin , Valeri P. Maltsev , Alfons G. Hoekstra

The general quintic hypersurface in ${\mathbb P}^4$ is the most famous example of a Calabi--Yau threefold for which mirror symmetry has been investigated in detail. There is a description of the mirror as a hypersurface in a certain…

Algebraic Geometry · Mathematics 2007-05-23 Christian Meyer

This paper has several goals. The first idea is to study the geometric PDEs of connection-flatness, curvature-flatness, Ricci-flatness, scalar curvature-flatness in a modern and rigorous way. Although the idea is not new, our main Theorems…

Differential Geometry · Mathematics 2019-11-11 Iulia Hirica , Constantin Udriste , Gabriel Pripoae , Ionel Tevy

In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\'emila showed that for simply connected regions by two rectangles, the…

Combinatorics · Mathematics 2013-05-14 Igor Pak , Jed Yang

I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…

Logic · Mathematics 2017-02-10 Jan Krajicek

It has been shown that a slab of materials with refractive index = -1 behaves like a perfect lens focussing all light to an exact electromagnetic copy of an object. The original lens is limited to producing images the same size as the…

Condensed Matter · Physics 2009-11-07 J. B. Pendry , S. Anantha Ramakrishna

We study the problem of folding a polyomino $P$ into a polycube $Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of $P$ or can…

The enhanced light transmission through an array of subwavelength holes surrounded by Bragg mirrors is studied, showing that the mirrors act to confine the surface plasmons associated with the Extraordinary Optical Transmission effect,…

Optics · Physics 2007-10-11 Nathan C. Lindquist , Antoine Lesuffleur , Sang-Hyun Oh

Plane mirror can make one object into two for observers on the object's side. Yet, there seems no way to achieve the same effect for observers from all directions. In this letter, we will design a new class of gradient index lenses from…

Optics · Physics 2011-08-18 Huanyang Chen , Yadong Xu , Hui Li

This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which…

Computational Geometry · Computer Science 2013-10-01 Mojtaba Nouri Bygi , Mohammad Ghodsi

We have developed a general method for finding apparent horizons in 3D numerical relativity. Instead of solving for the partial differential equation describing the location of the apparent horizons, we expand the closed 2D surfaces in…

General Relativity and Quantum Cosmology · Physics 2016-08-15 P. Anninos , K. Camarda , J. Libson , J. Massó , E. Seidel , W. -M. Suen

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

Combinatorics · Mathematics 2024-01-09 Martin Winter

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…

Geometric Topology · Mathematics 2022-09-08 Jean Raimbault

We describe a simple geometrical derivation of the formula for reflection of light from a uniformly moving plane mirror directly from the postulates of special relativity.

General Physics · Physics 2009-04-06 Aleksandar Gjurchinovski , Aleksandar Skeparovski

Accurate monocular depth estimation is crucial for 3D scene understanding, but existing methods often blur depth at object boundaries, introducing spurious intermediate 3D points. While achieving sharp edges usually requires very…

Computer Vision and Pattern Recognition · Computer Science 2025-11-19 Aurélien Cecille , Stefan Duffner , Franck Davoine , Rémi Agier , Thibault Neveu