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...

Full description

Bibliographic Details

Published in:	Computational geometry : theory and applications Vol. 120; p. 102088
Main Authors:	Bae, Sang Won, Banerjee, Sandip, Baral, Arpita, Mahapatra, Priya Ranjan Sinha, Yoon, Sang Duk
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2024
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!