相关论文: Topological Universality of the Art Gallery Proble…

Let $P$ be a simple polygon, then the art gallery problem is looking for a minimum set of points (guards) that can see every point in $P$. We say two points $a,b\in P$ can see each other if the line segment $seg(a,b)$ is contained in $P$.…

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classical problem in computational…

We resolve the complexity of the point-boundary variant of the art gallery problem, showing that it is $\exists\mathbb{R}$-complete, meaning that it is equivalent under polynomial time reductions to deciding whether a system of polynomial…

A natural topology on the space of left orderings of an arbitrary semi-group is introduced. It is proved that this space is compact and that for free abelian groups it is homeomorphic to the Cantor set. An application of this result is a…

Art Gallery is a fundamental visibility problem in Computational Geometry. The input consists of a simple polygon P, (possibly infinite) sets G and C of points within P, and an integer k; the task is to decide if at most k guards can be…

Recently, a natural variant of the Art Gallery problem, known as the \emph{Contiguous Art Gallery problem} was proposed. Given a simple polygon $P$, the goal is to partition its boundary $\partial P$ into the smallest number of contiguous…

The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…

We study universal groups for right-angled buildings. Inspired by Simon Smith's work on universal groups for trees, we explicitly allow local groups that are not necessarily finite nor transitive. We discuss various topological and…

We examine the Art Gallery Problem with Edge Guards. We present a heuristic algorithm to arrange edge guards to guard only the inward side of the walls of any N-vertex simple polygonal gallery using at most roof (N/4) edge guards - a…

In this paper, we construct cw-expansive homeomorphisms on compact surfaces of genus greater than or equal to zero with a fixed point whose local stable set is connected but not locally connected. This provides an affirmative answer to…

We prove a uniform bound on the topological Tur\'an number of an arbitrary two-dimensional simplicial complex $S$: any $n$-vertex two-dimensional complex with at least $C_S n^{3-1/5}$ facets contains a homeomorphic copy of $S$, where $C_S >…

Given a simple polygon $\cal P$, in the Art Gallery problem, the goal is to find the minimum number of guards needed to cover the entire $\cal P$, where a guard is a point and can see another point $q$ when $\overline{pq}$ does not cross…

The contiguous art gallery problem was introduced at SoCG'25 in a merged paper that combined three simultaneous results, each achieving a polynomial-time algorithm for the problem. This problem is a variant of the classical art gallery…

We show the following problems are in $\textsf{P}$: 1. The contiguous art gallery problem -- a variation of the art gallery problem where each guard can protect a contiguous interval along the boundary of a simple polygon. This was posed at…

We consider projection and lifting of labelled galleries to and from roots subsystems. Our constructions allow us to construct some topological embeddings of Bott-Samelson varieties skew equivariant with respect to the compact torus and…

In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…

We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is \emph{universal} for a class…

Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…

One of the earliest and most well known problems in computational geometry is the so-called art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they…

In this paper we focus on the set-open topologies on the group $\mathcal{H}(X)$ of all self-homeomorphisms of a topological space $X$ which yield continuity of both the group operations, product and inverse function. As a consequence, we…