Related papers: Visibility-Monotonic Polygon Deflation
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most other art gallery problems, existence is the primary question:…
The output of molecular dynamics simulations is high-dimensional, and the degrees of freedom among the atoms are related in intricate ways. Therefore, a variety of analysis frameworks have been introduced in order to distill complex motions…
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two…
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…
The Helmholtz decomposition splits a sufficiently smooth vector field into a gradient field and a divergence-free rotation field. Existing decomposition methods impose constraints on the behavior of vector fields at infinity and require…
In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a set of five necessary conditions based off our identified…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
As is well-known, the Witten deformation of the De Rham complex computes the De Rham cohomology. In this paper we study the Witten deformation on a noncompact manifold and restrict it to differential forms which behave polynomially near…
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…
In this paper, we define the recurrence and "non-wandering" for decompositions. The following inclusion relations hold for codimension one foliations on closed $3$-manifolds: $\{$minimal$\} \sqcup \{$compact$\}$ $\subsetneq$ $\{$pointwise…
Here we are concerned with a special issue of billiard invisibility, where a bounded set with a piecewise smooth boundary in Euclidean space is identified with a body with mirror surface, and the billiard in the complement of the set is…
It is proposed that the mathematical formalism that is most appropriate for the study of spatially non-integrable cosmological models is the transverse geometry of a one-dimensional foliation (congruence) defined by a physical observer. By…
A simple $n$-gon is a polygon with $n$ edges with each vertex belonging to exactly two edges and every other point belonging to at most one edge. Brass asked the following question: For $n \geq 5$ odd, what is the maximum perimeter of a…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the…
A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices;…
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
Given a convex polyhedral surface P, we define a tailoring as excising from P a simple polygonal domain that contains one vertex v, and whose boundary can be sutured closed to a new convex polyhedron via Alexandrov's Gluing Theorem. In…
For two points in the closure of a simple polygon $P$, we say that they see each other in $P$ if the line segment uniting them does not intersect the exterior of $P$. The visibility graph of $P$ is the graph whose vertex set is the vertex…
We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…
A $3$-Prismatoid is the convex hull of two convex polygons $A$ and $B$ which lie in parallel planes $H_A, H_B\subset\mathbb{R}^3$. Let $A'$ be the orthogonal projection of $A$ onto $H_B$. A prismatoid is called nested if $A'$ is properly…