Saved in:
| Main Authors: | Pal, Ambar, Raman, Rajiv, Ray, Saurabh, Singh, Karamjeet |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.02449 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Sweeping Arrangements of Non-Piercing Curves in Plane
by: Dalal, Suryendu, et al.
Published: (2024)
by: Dalal, Suryendu, et al.
Published: (2024)
Supports for Outerplanar and Bounded Treewidth Graphs
by: Raman, Rajiv, et al.
Published: (2025)
by: Raman, Rajiv, et al.
Published: (2025)
On Hypergraph Supports
by: Raman, Rajiv, et al.
Published: (2023)
by: Raman, Rajiv, et al.
Published: (2023)
Orthogonal dissection into few rectangles
by: Eppstein, David
Published: (2022)
by: Eppstein, David
Published: (2022)
Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
by: Ágoston, Péter, et al.
Published: (2024)
by: Ágoston, Péter, et al.
Published: (2024)
Hitting Axis-Parallel Segments with Weighted Points
by: Raman, Rajiv, et al.
Published: (2026)
by: Raman, Rajiv, et al.
Published: (2026)
Matching random colored points with rectangles (Corrigendum)
by: Corujo, Josué, et al.
Published: (2025)
by: Corujo, Josué, et al.
Published: (2025)
Largest dyadic dual VC-dimension of non-piercing families
by: Huang, Xinqi, et al.
Published: (2025)
by: Huang, Xinqi, et al.
Published: (2025)
Colorful two-piercing theorem for boxes
by: Chakraborty, Sourav, et al.
Published: (2022)
by: Chakraborty, Sourav, et al.
Published: (2022)
Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
by: Ágoston, Péter, et al.
Published: (2025)
by: Ágoston, Péter, et al.
Published: (2025)
A note on piercing discrete rectangles
by: Rao, Wei
Published: (2026)
by: Rao, Wei
Published: (2026)
A geometric proof of the infinite $(p, q)$-theorem for hyperplane piercing
by: Chakraborty, Sutanoya, et al.
Published: (2024)
by: Chakraborty, Sutanoya, et al.
Published: (2024)
A fast algorithm for the Hecke representation of the braid group, and applications to the computation of the HOMFLY-PT polynomial and the search for interesting braids
by: Maria, Clément, et al.
Published: (2025)
by: Maria, Clément, et al.
Published: (2025)
Random covering by rectangles on self-similar carpets
by: Daviaud, E
Published: (2025)
by: Daviaud, E
Published: (2025)
Modeling of non-planar slicer for improved surface quality in material extrusion 3D printing
by: Shahid, Shadman Tajwar
Published: (2024)
by: Shahid, Shadman Tajwar
Published: (2024)
A gradient descent algorithm for computing circle patterns
by: Ba, Te, et al.
Published: (2025)
by: Ba, Te, et al.
Published: (2025)
Some fast algorithms for curves in surfaces
by: Lackenby, Marc
Published: (2024)
by: Lackenby, Marc
Published: (2024)
Symplectic structure on the character varieties of Sasakian threefolds
by: Biswas, Indranil, et al.
Published: (2026)
by: Biswas, Indranil, et al.
Published: (2026)
Jordan curves inscribe a positive measure of rectangles
by: Greene, Joshua Evan, et al.
Published: (2026)
by: Greene, Joshua Evan, et al.
Published: (2026)
Min-$k$-planar Drawings of Graphs
by: Binucci, Carla, et al.
Published: (2023)
by: Binucci, Carla, et al.
Published: (2023)
Canonical Ramsey: triangles, rectangles and beyond
by: Fang, Yijia, et al.
Published: (2025)
by: Fang, Yijia, et al.
Published: (2025)
A (Hilbert) geometric algorithm for approximating the halfspace depth of a point in a convex body
by: Gupta, Purvi, et al.
Published: (2024)
by: Gupta, Purvi, et al.
Published: (2024)
On Quad Mesh Extraction From Messy Grid Preserving Maps
by: Ray, Nicolas
Published: (2025)
by: Ray, Nicolas
Published: (2025)
Non-planar 3D Printing of Double Shells
by: Mitropoulou, Ioanna, et al.
Published: (2025)
by: Mitropoulou, Ioanna, et al.
Published: (2025)
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
by: Gnewuch, Michael
Published: (2024)
by: Gnewuch, Michael
Published: (2024)
A greedy maximal sweepline algorithm for a Jordan curve
by: Mudgal, Apurva
Published: (2026)
by: Mudgal, Apurva
Published: (2026)
Delaunay-Rips filtration: a study and an algorithm
by: Clémot, Mattéo, et al.
Published: (2025)
by: Clémot, Mattéo, et al.
Published: (2025)
Low-distortion planar embedding of rod-based structures
by: Yip, Mark Yan Lok, et al.
Published: (2026)
by: Yip, Mark Yan Lok, et al.
Published: (2026)
Time complexity of the Analyst's Traveling Salesman algorithm
by: Ramirez, Anthony, et al.
Published: (2022)
by: Ramirez, Anthony, et al.
Published: (2022)
On the number of iterations of the DBA algorithm
by: Brüning, Frederik, et al.
Published: (2024)
by: Brüning, Frederik, et al.
Published: (2024)
A simple linear time algorithm for smallest enclosing circles on the (hemi)sphere
by: Flemming, Jens
Published: (2024)
by: Flemming, Jens
Published: (2024)
Witness Set: A Visibility Problem in $NP\cap XP$
by: Jana, Satyabrata, et al.
Published: (2026)
by: Jana, Satyabrata, et al.
Published: (2026)
A face cover perspective to $\ell_1$ embeddings of planar graphs
by: Filtser, Arnold
Published: (2019)
by: Filtser, Arnold
Published: (2019)
A Fast Unsupervised Scheme for Polygonal Approximation
by: Ray, Bimal Kumar
Published: (2025)
by: Ray, Bimal Kumar
Published: (2025)
A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon
by: Mudgal, Apurva
Published: (2026)
by: Mudgal, Apurva
Published: (2026)
Well-quasi-orders on embedded planar graphs
by: Lunel, Corentin, et al.
Published: (2025)
by: Lunel, Corentin, et al.
Published: (2025)
Efficient computation of topological integral transforms
by: Lebovici, Vadim, et al.
Published: (2024)
by: Lebovici, Vadim, et al.
Published: (2024)
A faster algorithm for the Fréchet distance in 1D for the imbalanced case
by: Blank, Lotte, et al.
Published: (2024)
by: Blank, Lotte, et al.
Published: (2024)
Automated proving in planar geometry based on the complex number identity method and elimination
by: Kovács, Zoltán, et al.
Published: (2025)
by: Kovács, Zoltán, et al.
Published: (2025)
Relative position of a parabola or a hyperbola and an ellipse without computing intersection points
by: Caravantes, Jorge, et al.
Published: (2025)
by: Caravantes, Jorge, et al.
Published: (2025)
Similar Items
-
Sweeping Arrangements of Non-Piercing Curves in Plane
by: Dalal, Suryendu, et al.
Published: (2024) -
Supports for Outerplanar and Bounded Treewidth Graphs
by: Raman, Rajiv, et al.
Published: (2025) -
On Hypergraph Supports
by: Raman, Rajiv, et al.
Published: (2023) -
Orthogonal dissection into few rectangles
by: Eppstein, David
Published: (2022) -
Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
by: Ágoston, Péter, et al.
Published: (2024)