Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Maximum-Width Rainbow-Bisecting Empty Annulus (2305.09248v2)

Published 16 May 2023 in cs.CG

Abstract: 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 color. The maximum-width rainbow-bisecting empty annulus problem asks to find an annulus $A$ of a particular shape with maximum possible width such that $A$ does not contain any input points and it bisects the input point set into two parts, each of which is a rainbow. We compute a maximum-width rainbow-bisecting empty axis-parallel square, axis-parallel rectangular and circular annulus in $O(n3)$ time using $O(n)$ space, in $O(k2n2\log n)$ time using $O(n\log n)$ space and in $O(n3)$ time using $O(n2)$ space respectively.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. The farthest color Voronoi diagram and related problems. In Proc. 17th EuroCG 2001, pages 113–116, 2001.
  2. Smallest color-spanning objects. In Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pages 278–289, 2001.
  3. Minimum width color spanning annulus. Theor. Comput. Sci., 725:16–30, 2018.
  4. Topological sweeping in three dimensions. In Proceedings of the International Symposium on Algorithms, SIGAL, volume 450 of Lecture Notes in Computer Science, pages 310–317, 1990.
  5. Selecting and covering colored points. Discrete Applied Mathematics., 250:75–86, 2020.
  6. Maximum-width empty square and rectangular annulus. Computational Geometry: Theory and Applications, 96:101747, 2021.
  7. Color spanning objects: Algorithms and hardness results. Discrete Applied Mathematics., 280:14–22, 2020.
  8. Siu-Wing Cheng. Widest empty L-shaped corridor. Inform. Proc. Lett., 58(6):277 – 283, 1996.
  9. Smallest color-spanning object revisited. Int. J. Comput. Geometry Appl., 19(5):457–478, 2009.
  10. Computational Geometry: Algorithms and Applications. Springer-Verlag TELOS, Santa Clara, CA, USA, 3rd edition, 2008.
  11. On finding a widest empty 1-corner corridor. Inform. Proc. Lett., 98(5):199 – 205, 2006.
  12. The largest empty annulus problem. Int. J. Comput. Geom. Appl., 13(4):317–325, 2003.
  13. Locating an obnoxious plane. Eur. J. Oper. Res., 173(2):556–564, 2006.
  14. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38(1):165–194, 1989.
  15. Computing the smallest color-spanning equilateral triangle. In Proc. 31st EuroCG 2015, pages 32–35, 2015.
  16. M. Houle and A. Maciel. Finding the widest empty corridor through a set of points. In G.T. Toussaint ed. Snapshots of Computational and Discrete Geometry (SOCS), pages 210–213, 1988.
  17. Computing the smallest color-spanning axis-parallel square. In Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings, pages 634–643, 2013.
  18. Minimum-width rectangular annulus. Theoret. Comput. Sci., 508:74–80, 2013.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets