:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Mudgal, Apurva
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry
Acceso en línea:	https://arxiv.org/abs/2605.01861
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Hardness and Approximation Schemes for Discrete Packing and Domination
por: Madireddy, Raghunath Reddy, et al.
Publicado: (2025)

A genetic algorithm to generate maximally orthogonal frames in complex space
por: Roca-Jerat, Sebastián, et al.
Publicado: (2025)

On maximizing curves of degree $7$
por: Czarnota, Izabela
Publicado: (2024)

Some fast algorithms for curves in surfaces
por: Lackenby, Marc
Publicado: (2024)

Jordan curves inscribe a positive measure of rectangles
por: Greene, Joshua Evan, et al.
Publicado: (2026)

A (Hilbert) geometric algorithm for approximating the halfspace depth of a point in a convex body
por: Gupta, Purvi, et al.
Publicado: (2024)

CM theory, maximal hyperelliptic curves, and Chebyshev polynomials
por: Tafazolia, Saeed, et al.
Publicado: (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
por: van der Horst, Thijs, et al.
Publicado: (2025)

Algebraic curves, rich points, and doubly-ruled surfaces
por: Guth, Larry, et al.
Publicado: (2015)

Delaunay-Rips filtration: a study and an algorithm
por: Clémot, Mattéo, et al.
Publicado: (2025)

Time complexity of the Analyst's Traveling Salesman algorithm
por: Ramirez, Anthony, et al.
Publicado: (2022)

A fast algorithm for computing a planar support for non-piercing rectangles
por: Pal, Ambar, et al.
Publicado: (2024)

An inexact matching approach for the comparison of plane curves with general elastic metrics
por: Sukurdeep, Yashil, et al.
Publicado: (2020)

On the number of iterations of the DBA algorithm
por: Brüning, Frederik, et al.
Publicado: (2024)

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

Piecewise geodesic Jordan curves II: Loewner energy, projective structures, and accessory parameters
por: Bonk, Mario, et al.
Publicado: (2024)

Locally recoverable codes with multiple recovering sets from maximal curves
por: Tafazolian, Saeed, et al.
Publicado: (2025)

A faster algorithm for the Fréchet distance in 1D for the imbalanced case
por: Blank, Lotte, et al.
Publicado: (2024)

On the existence of maximizing curves of odd degrees
por: Janasz, Marek, et al.
Publicado: (2024)

The moment polytope of matrix multiplication is not maximal
por: Berg, Maxim van den, et al.
Publicado: (2025)

Inscriptions of Isosceles Trapezoids in Jordan Curves
por: Barber, Adam
Publicado: (2026)

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

On maximal curves of $n$-correct sets
por: Hakopian, H., et al.
Publicado: (2025)

Self-orthogonal and self-dual codes from maximal curves
por: Wang, Puyin, et al.
Publicado: (2025)

Closed cap condition under the cap construction algorithm
por: Sandu, Mercedes, et al.
Publicado: (2022)

Approximating the Fréchet distance when only one curve is $c$-packed
por: Gudmundsson, Joachim, et al.
Publicado: (2024)

A census of graph-drawing algorithms based on generalized transversal structures
por: Bernardi, Olivier, et al.
Publicado: (2024)

Quantum algorithms for Hopcroft's problem
por: Andrejevs, Vladimirs, et al.
Publicado: (2024)

Point containment algorithms for constructive solid geometry with unbounded primitives
por: Romano, Paul K., et al.
Publicado: (2024)

On the number of tangencies among $1$-intersecting $x$-monotone curves
por: Ackerman, Eyal, et al.
Publicado: (2023)

Computing the connected components of real algebraic curves
por: Rocchi, Elisabetta, et al.
Publicado: (2026)

Linear time single-source shortest path algorithms in Euclidean graph classes
por: Gudmundsson, Joachim, et al.
Publicado: (2026)

The strong maximal rank conjecture and moduli spaces of curves
por: Liu, Fu, et al.
Publicado: (2018)

An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation
por: Yi, Zeping, et al.
Publicado: (2026)

Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms
por: Mohammad-Taheri, Sina, et al.
Publicado: (2025)

Passage-traversing optimal path planning with sampling-based algorithms
por: Huang, Jing, et al.
Publicado: (2025)

Crossing number inequalities for curves on surfaces
por: Hubard, Alfredo, et al.
Publicado: (2025)

Families of cyclic curve coverings with maximal monodromy
por: Spelta, Irene, et al.
Publicado: (2025)