Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Baral, Arpita"'
Autor:
Bae, Sang Won, Banerjee, Sandip, Baral, Arpita, Mahapatra, Priya Ranjan Sinha, Yoon, Sang Duk
Given a set of $n$ colored points with $k$ colors in the plane, we study the problem of computing a maximum-width rainbow-bisecting empty annulus (of objects specifically axis-parallel square, axis-parallel rectangle and circle) problem. We call a re
Externí odkaz:
http://arxiv.org/abs/2305.09248
Autor:
Bae, Sang Won, Banerjee, Sandip, Baral, Arpita, Mahapatra, Priya Ranjan Sinha, Yoon, Sang Duk
Publikováno v:
In Computational Geometry: Theory and Applications June 2024 120
An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$ points in th
Externí odkaz:
http://arxiv.org/abs/1811.06217
Given a set $P$ of $n$ points on $\mathbb R^{2}$, we address the problem of computing an axis-parallel empty rectangular annulus $A$ of maximum-width such that no point of $P$ lies inside $A$ but all points of $P$ must lie inside, outside and on the
Externí odkaz:
http://arxiv.org/abs/1712.00375
Publikováno v:
In Computational Geometry: Theory and Applications June 2021 96