Related papers: Local Complexity of Polygons
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each…
A strategy is proposed for characterizing the worst-case performance of algorithms for solving nonconvex smooth optimization problems. Contemporary analyses characterize worst-case performance by providing, under certain assumptions on an…
Local search is a powerful heuristic in optimization and computer science, the complexity of which has been studied in the white box and black box models. In the black box model, we are given a graph $G = (V,E)$ and oracle access to a…
The class PLS (Polynomial Local Search) captures the complexity of finding a solution that is locally optimal and has proven to be an important concept in the theory of local search. It has been shown that local search versions of various…
Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth…
The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and…
We show that the simple modules of the Rouquier blocks of symmetric groups, in characteristic $p$ and having $p$-weight $w$ with $w < p$, have a common complexity $w$, and that when $p$ is odd, $D^{(p+1,1^{p-1})}$ has complexity 1, while…
In this paper, we study the complexity of computing locally optimal solutions for weighted versions of standard set problems such as SetCover, SetPacking, and many more. For our investigation, we use the framework of PLS, as defined in…
We consider extending the visibility polygon of a given point $q$, inside a simple polygon $P$ by converting some edges of $P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely $k$…
Given a geometric domain $P$, visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within $P$ in order to be able to see a portion (or all) of $P$, while optimizing objectives, such as the…
With the popularity of drone technologies, aerial photography has become prevalent in many daily scenarios such as environment monitoring, structure inspection, law enforcement etc. A central challenge in this domain is the efficient…
This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…
We prove that, if $W \subset \mathbb{R}^n$ is a locally strongly convex body (not necessarily compact), then for any open set $V \supset \partial W$ and $\varepsilon>0$, and $V \supset \partial W$ is open, then there exists a $C^2$ locally…
Given a simple polygon $P$ with $n$ vertices, we consider the problem of constructing a data structure for visibility queries: for any query point $q \in P$, compute the visibility polygon of $q$ in $P$. To obtain $O(\log n + k)$ query…
Many algorithmic problems can be solved (almost) as efficiently in metric spaces of bounded doubling dimension as in Euclidean space. Unfortunately, the metric space defined by points in a simple polygon equipped with the geodesic distance…
We study two recent conjectures for holographic complexity: the complexity=action conjecture and the complexity=volume conjecture. In particular, we examine the structure of the UV divergences appearing in these quantities, and show that…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We establish that for q>=1, the class of convex combinations of q translates of a smooth probability density has local doubling dimension proportional to q. The key difficulty in the proof is to control the local geometric structure of…
A convex geometry is finite zero-closed closure system that satisfies the anti-exchange property. Complexity results are given for two open problems related to representations of convex geometries using implication bases. In particular, the…