Results 11 to 20 of about 5,659 (189)
Approximate Guarding of Monotone and Rectilinear Polygons [PDF]
Algorithmica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Krohn, Erik A., Nilsson, Bengt J.
openaire +6 more sources
Convexifying Monotone Polygons [PDF]
, 1999 This paper considers reconfigurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can reconfigure any monotone polygon into a convex polygon; a polygon is monotone if any vertical line intersects the interior at a (possibly empty) interval.
Biedl, Therese C. +4 more
openaire +2 more sources
Altitude terrain guarding and guarding uni-monotone polygons [PDF]
Computational Geometry, 2019 We present an optimal, linear-time algorithm for the following version of terrain guarding: given a 1.5D terrain and a horizontal line, place the minimum number of guards on the line to see all of the terrain. We prove that the cardinality of the minimum guard set coincides with the cardinality of a maximum number of ``witnesses'', i.e., terrain points,
Daescu, Ovidiu +4 more
openaire +5 more sources
Visibility-monotonic polygon deflation
Contributions to Discrete Mathematics, 2015 A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show that the least n for which there exists such an n-gon is seven.
Bose, Prosenjit +3 more
openaire +2 more sources
Rotationally monotone polygons
Computational Geometry, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bose, Prosenjit +3 more
openaire +2 more sources
Modem illumination of monotone polygons
Computational Geometry, 2018 We study a generalization of the classical problem of the illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number $k$ of walls. We call these objects $k$-modems and study the minimum number of $k$-modems sufficient and sometimes necessary to illuminate monotone and monotone
Aichholzer, Oswin +5 more
openaire +2 more sources
Lion and Man with Visibility in Monotone Polygons [PDF]
The International Journal of Robotics Research, 2013 In the original version of the lion and man game, a lion tries to capture a man who is trying to escape in a circular arena. The players have equal speeds. They can observe each other at all times. We study a new variant of the game in which the lion has only line-of-sight visibility.
Narges Noori, Volkan Isler
openaire +1 more source
Covering a Simple Polygon by Monotone Directions
Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahn, HK +4 more
openaire +4 more sources
Drawing Planar Graphs with a Prescribed Inner Face [PDF]
, 2013 Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan +7 more
core +2 more sources
On $r$-Guarding Thin Orthogonal Polygons [PDF]
, 2016 Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a point $q$ if ...
Biedl, Therese, Mehrabi, Saeed
core +2 more sources