Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Sweeping Arrangements of Non-Piercing Curves in Plane (2403.16474v2)

Published 25 Mar 2024 in cs.CG

Abstract: Let $\Gamma$ be a finite set of Jordan curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is a non-piercing family if for any two curves $\alpha , \beta \in \Gamma$, $\tilde{\alpha} \setminus \tilde{\beta}$ is a connected region. A non-piercing family of curves generalizes a family of $2$-intersecting curves in which each pair of curves intersect in at most two points. Snoeyink and Hershberger (``Sweeping Arrangements of Curves'', SoCG '89) proved that if we are given a family $\mathcal{C}$ of $2$-intersecting curves and a fixed curve $C\in\mathcal{C}$, then the arrangement can be \emph{swept} by $C$, i.e., $C$ can be continuously shrunk to any point $p \in \tilde{C}$ in such a way that the we have a family of $2$-intersecting curves throughout the process. In this paper, we generalize the result of Snoeyink and Hershberger to the setting of non-piercing curves. We show that given an arrangement of non-piercing curves $\Gamma$, and a fixed curve $\gamma\in \Gamma$, the arrangement can be swept by $\gamma$ so that the arrangement remains non-piercing throughout the process. We also give a shorter and simpler proof of the result of Snoeyink and Hershberger and cite applications of their result, where our result leads to a generalization.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (24)
  1. Coloring hypergraphs defined by stabbed pseudo-disks and abab-free hypergraphs. SIAM Journal on Discrete Mathematics, 34(4):2250–2269, 2020.
  2. Coloring delaunay-edges and their generalizations. Computational Geometry, 96:101745, 2021.
  3. Lenses in arrangements of pseudo-circles and their applications. Journal of the ACM (JACM), 51(2):139–186, 2004.
  4. Bentley and Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Transactions on computers, 100(9):643–647, 1979.
  5. On s-intersecting curves and related problems. In Proceedings of the twenty-fourth annual Symposium on Computational geometry, pages 79–84, 2008.
  6. Exact algorithms and apx-hardness results for geometric packing and covering problems. Comput. Geom., 47(2):112–124, 2014. URL: https://doi.org/10.1016/j.comgeo.2012.04.001, doi:10.1016/J.COMGEO.2012.04.001.
  7. Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1576–1585. SIAM, 2012. doi:10.1137/1.9781611973099.125.
  8. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM (JACM), 39(1):1–54, 1992.
  9. Coloring circle arrangements: New 4-chromatic planar graphs. European Journal of Combinatorics, page 103839, 2023.
  10. Computational geometry: algorithms and applications, 3rd Edition. Springer, 2008. URL: https://www.worldcat.org/oclc/227584184.
  11. Herbert Edelsbrunner. Algorithms in combinatorial geometry, volume 10. Springer Science & Business Media, 1987.
  12. Topologically sweeping an arrangement. Journal of Computer and System Sciences, 38(1):165–194, 1989. URL: https://www.sciencedirect.com/science/article/pii/002200008990038X, doi:https://doi.org/10.1016/0022-0000(89)90038-X.
  13. Triangles in euclidean arrangements. Discrete & Computational Geometry, 22:429–438, 1999.
  14. Unified hanani-tutte theorem. arXiv preprint arXiv:1612.00688, 2016.
  15. Approximation algorithms for polynomial-expansion and low-density graphs. SIAM J. Comput., 46(6):1712–1744, 2017. doi:10.1137/16M1079336.
  16. On the number of hyperedges in the hypergraph of lines and pseudo-discs. Electron. J. Comb., 29(3), 2022. doi:10.37236/10424.
  17. Rom Pinchasi. A finite family of pseudodiscs must include a "small" pseudodisc. SIAM J. Discret. Math., 28(4):1930–1934, 2014. doi:10.1137/130949750.
  18. Computational geometry: an introduction. Springer Science & Business Media, 2012.
  19. Constructing planar support for non-piercing regions. Discret. Comput. Geom., 64(3):1098–1122, 2020. URL: https://doi.org/10.1007/s00454-020-00216-w, doi:10.1007/S00454-020-00216-W.
  20. On the geometric set multicover problem. Discret. Comput. Geom., 68(2):566–591, 2022. URL: https://doi.org/10.1007/s00454-022-00402-y, doi:10.1007/S00454-022-00402-Y.
  21. Packing and covering with non-piercing regions. Discret. Comput. Geom., 60(2):471–492, 2018. URL: https://doi.org/10.1007/s00454-018-9983-2, doi:10.1007/S00454-018-9983-2.
  22. Manfred Scheucher. Points, lines, and circles:: some contributions to combinatorial geometry. PhD thesis, Dissertation, Berlin, Technische Universität Berlin, 2019, 2020.
  23. Sweeping arrangements of curves. In Kurt Mehlhorn, editor, Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989, pages 354–363. ACM, 1989. doi:10.1145/73833.73872.
  24. Kasturi R. Varadarajan. Weighted geometric set cover via quasi-uniform sampling. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 641–648. ACM, 2010. doi:10.1145/1806689.1806777.

Summary

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

X Twitter Logo Streamline Icon: https://streamlinehq.com