Kinetic red-blue minimum separating circle

Authors:
Yam Ki Cheung;Ovidiu Daescu;Marko Zivanic
Affiliations:
Department of Computer Science, The University of Texas at Dallas, Richardson, TX;Department of Computer Science, The University of Texas at Dallas, Richardson, TX;Department of Computer Science, The University of Texas at Dallas, Richardson, TX
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 9
Cited 0

A simple algorithm for computing the smallest enclosing circle

Information Processing Letters
Voronoi diagrams over dynamic scenes

Discrete Applied Mathematics
A practical evaluation of kinetic data structures

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Kinetic data structures: a state of the art report

WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Data structures for mobile data

Journal of Algorithms
Separating objects in the plane by wedges and strips

Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Separability by two lines and by nearly straight polygonal chains

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Dynamic computational geometry

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Minimum Separating Circle for Bichromatic Points in the Plane

ISVD '10 Proceedings of the 2010 International Symposium on Voronoi Diagrams in Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a kinetic version of the red-blue minimum separating circle problem, in which some points move with constant speed along straight line trajectories. We want to find the locus of the minimum separating circle over a period of time. We first consider two degenerate cases of this problem. In the first one (P1), we study the minimum separating circle problem with only one mobile blue point, and in the second one (P2), we study the minimum separating circle problem with only one mobile red point. Then, we give a solution for the general case (P3), in which multiple points are mobile.