Maximum-width rainbow-bisecting empty annulus

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 region rainbow if it contains at least one point of each...

Celý popis

Podrobná bibliografia

Vydané v:	Computational geometry : theory and applications Ročník 120; s. 102088
Hlavní autori:	Bae, Sang Won, Banerjee, Sandip, Baral, Arpita, Mahapatra, Priya Ranjan Sinha, Yoon, Sang Duk
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.06.2024
Predmet:	Geometric covering L shaped corridor Polynomial-time algorithms Rainbow-bisecting annulus Rainbow-bisecting annulus Geometric covering L shaped corridor Polynomial-time algorithms
ISSN:	0925-7721
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!