Results 11 to 20 of about 5,704 (200)
Rotationally monotone polygons [PDF]
Computational Geometry, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose +3 more
openaire +2 more sources
Visibility-monotonic polygon deflation [PDF]
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.
Prosenjit Bose +3 more
openaire +2 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
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
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
Oswin Aichholzer +5 more
openaire +2 more sources
Line-of-Sight Pursuit in Monotone and Scallop Polygons [PDF]
International Journal of Computational Geometry & Applications, 2019 We study a turn-based game in a simply connected polygonal environment [Formula: see text] between a pursuer [Formula: see text] and an adversarial evader [Formula: see text]. Both players can move in a straight line to any point within unit distance during their turn.
Lindsay Berry +6 more
openaire +2 more sources
On the Complexity of Half-Guarding Monotone Polygons
, 2022 15 pages, 19 figures, preliminary version appeared in EuroCG ...
Hannah Miller Hillberg +2 more
openaire +2 more sources
Minkowski Sums of Monotone and General Simple Polygons [PDF]
Discrete & Computational Geometry, 2005 Let P be a simple polygon with m edges, which is the disjoint union of k simple polygons, all monotone in a common direction u, and let Q be another simple polygon with n edges, which is the disjoint union of l simple polygons, all monotone in a common direction v. We show that the combinatorial complexity of the Minkowski sum P ź Q is O(klmnź(min{m,n})
Eduard Oks, Micha Sharir
openaire +1 more source
Any Monotone Function Is Realized by Interlocked Polygons [PDF]
Algorithms, 2012 Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that makes the set of interlocked polygons free (not interlocked).
Erik D. Demaine +2 more
openaire +4 more sources
An Algorithm for Finding Convex Hulls of Planar Point Sets
, 2012 This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group ofquadrilaterals (e-
Mei, Gang +2 more
core +1 more source