Image de couverture de livre

A greedy maximal sweepline algorithm for a Jordan curve

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Mudgal, Apurva
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon
par: Mudgal, Apurva
Publié: (2026)

Convexity of near-optimal orthogonal-pair-free sets on the unit sphere
par: Mudgal, Apurva
Publié: (2024)

Hardness and Approximation Schemes for Discrete Packing and Domination
par: Madireddy, Raghunath Reddy, et autres
Publié: (2025)

A genetic algorithm to generate maximally orthogonal frames in complex space
par: Roca-Jerat, Sebastián, et autres
Publié: (2025)

On maximizing curves of degree $7$
par: Czarnota, Izabela
Publié: (2024)

Some fast algorithms for curves in surfaces
par: Lackenby, Marc
Publié: (2024)

Jordan curves inscribe a positive measure of rectangles
par: Greene, Joshua Evan, et autres
Publié: (2026)

A (Hilbert) geometric algorithm for approximating the halfspace depth of a point in a convex body
par: Gupta, Purvi, et autres
Publié: (2024)

Algebraic curves, rich points, and doubly-ruled surfaces
par: Guth, Larry, et autres
Publié: (2015)

CM theory, maximal hyperelliptic curves, and Chebyshev polynomials
par: Tafazolia, Saeed, et autres
Publié: (2025)

Delaunay-Rips filtration: a study and an algorithm
par: Clémot, Mattéo, et autres
Publié: (2025)

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
par: van der Horst, Thijs, et autres
Publié: (2025)

A fast algorithm for computing a planar support for non-piercing rectangles
par: Pal, Ambar, et autres
Publié: (2024)

On the number of iterations of the DBA algorithm
par: Brüning, Frederik, et autres
Publié: (2024)

An inexact matching approach for the comparison of plane curves with general elastic metrics
par: Sukurdeep, Yashil, et autres
Publié: (2020)

A simple linear time algorithm for smallest enclosing circles on the (hemi)sphere
par: Flemming, Jens
Publié: (2024)

Time complexity of the Analyst's Traveling Salesman algorithm
par: Ramirez, Anthony, et autres
Publié: (2022)

A faster algorithm for the Fréchet distance in 1D for the imbalanced case
par: Blank, Lotte, et autres
Publié: (2024)

Locally recoverable codes with multiple recovering sets from maximal curves
par: Tafazolian, Saeed, et autres
Publié: (2025)

Closed cap condition under the cap construction algorithm
par: Sandu, Mercedes, et autres
Publié: (2022)

Approximating the Fréchet distance when only one curve is $c$-packed
par: Gudmundsson, Joachim, et autres
Publié: (2024)

Mend the gap: A smart repair algorithm for noisy polygonal tilings
par: Clelland, Jeanne N.
Publié: (2023)

Piecewise geodesic Jordan curves II: Loewner energy, projective structures, and accessory parameters
par: Bonk, Mario, et autres
Publié: (2024)

A census of graph-drawing algorithms based on generalized transversal structures
par: Bernardi, Olivier, et autres
Publié: (2024)

Linear time single-source shortest path algorithms in Euclidean graph classes
par: Gudmundsson, Joachim, et autres
Publié: (2026)

On the number of tangencies among $1$-intersecting $x$-monotone curves
par: Ackerman, Eyal, et autres
Publié: (2023)

Point containment algorithms for constructive solid geometry with unbounded primitives
par: Romano, Paul K., et autres
Publié: (2024)

Quantum algorithms for Hopcroft's problem
par: Andrejevs, Vladimirs, et autres
Publié: (2024)

Self-orthogonal and self-dual codes from maximal curves
par: Wang, Puyin, et autres
Publié: (2025)

An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation
par: Yi, Zeping, et autres
Publié: (2026)

On the existence of maximizing curves of odd degrees
par: Janasz, Marek, et autres
Publié: (2024)

The moment polytope of matrix multiplication is not maximal
par: Berg, Maxim van den, et autres
Publié: (2025)

Inscriptions of Isosceles Trapezoids in Jordan Curves
par: Barber, Adam
Publié: (2026)

Computing the connected components of real algebraic curves
par: Rocchi, Elisabetta, et autres
Publié: (2026)

Passage-traversing optimal path planning with sampling-based algorithms
par: Huang, Jing, et autres
Publié: (2025)

3D POLYLLA: Polyhedral meshing algorithm based on terminal-edge regions and terminal-face regions
par: Salinas-Fernández, Sergio, et autres
Publié: (2023)

On maximal curves of $n$-correct sets
par: Hakopian, H., et autres
Publié: (2025)

Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms
par: Mohammad-Taheri, Sina, et autres
Publié: (2025)

Efficient algorithms for optimal homology problems and their applications
par: Lyman, Kostiantyn
Publié: (2024)

Crossing number inequalities for curves on surfaces
par: Hubard, Alfredo, et autres
Publié: (2025)