Showing cs.CGShow all
3 papers · 1 filter
cs.CG2019
A Universality Theorem for Nested Polytopes
Michael G. Dobbins, Andreas Holmsen, Tillmann Miltzow
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops and a number , the Nest…
cs.CG2018
Smoothed Analysis of the Art Gallery Problem
Michael Gene Dobbins, Andreas Holmsen, Tillmann Miltzow
In the Art Gallery Problem we are given a polygon on vertices and a number . We want to find a guard set of size , such that each point in is s…
cs.CG2015
The Shadows of a Cycle Cannot All Be Paths
Prosenjit Bose, Jean-Lou De Carufel, Michael G. Dobbins +2
A "shadow" of a subset of Euclidean space is an orthogonal projection of into one of the coordinate hyperplanes. In this paper we show that it is not possible for all three…