:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Brüning, Frederik, Driemel, Anne, Ergür, Alperen, Röglin, Heiko
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2401.05841
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reinforcement Learning for Power-Flow Network Analysis
by: Ergur, Alperen, et al.
Published: (2026)

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

On the complexity of Chow and Hurwitz forms
by: Doğan, Mahmut Levent, et al.
Published: (2022)

Plantinga-Vegter algorithm takes average polynomial time
by: Cucker, Felipe, et al.
Published: (2019)

Optimal Preconditioning is a Geodesically Convex Optimization Problem
by: Doğan, M. Levent, et al.
Published: (2025)

Range Reporting for Time Series via Rectangle Stabbing
by: Blank, Lotte, et al.
Published: (2024)

Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms
by: Ergür, Alperen A., et al.
Published: (2025)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
by: Conradi, Jacobus, et al.
Published: (2025)

The Geometry of Rank Drop in a Class of Face-Splitting Matrix Products
by: Connelly, Erin, et al.
Published: (2023)

On the Discrete Fréchet Distance in a Graph
by: Driemel, Anne, et al.
Published: (2022)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)

Revisiting the Fréchet distance between piecewise smooth curves
by: Conradi, Jacobus, et al.
Published: (2024)

Learning Fast Monomial Orders for Gröbner Basis Computations
by: Bunch, R. Caleb, et al.
Published: (2026)

Property Testing of Curve Similarity
by: Afshani, Peyman, et al.
Published: (2025)

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
by: Conradi, Jacobus, et al.
Published: (2023)

Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
by: Blank, Lotte, et al.
Published: (2025)

Range Counting Oracles for Geometric Problems
by: Driemel, Anne, 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)

New Algorithms and Hardness Results for Connected Clustering
by: Eube, Jan, et al.
Published: (2025)

An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number
by: Delaney, Colleen, et al.
Published: (2023)

GEORCE: A Fast New Control Algorithm for Computing Geodesics
by: Rygaard, Frederik Möbius, et al.
Published: (2025)

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

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

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

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

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

Improved estimates on the number of unit perimeter triangles
by: Goenka, Ritesh, et al.
Published: (2023)

A greedy maximal sweepline algorithm for a Jordan curve
by: Mudgal, Apurva
Published: (2026)

The Borsuk number of a graph
by: Cáceres, José, et al.
Published: (2026)

Garment numbers of bi-colored point sets in the plane
by: Aichholzer, Oswin, et al.
Published: (2026)

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

The number of regular simplices in higher dimensions
by: Clemen, Felix Christian, et al.
Published: (2025)

Large chirotopes with computable numbers of triangulations
by: Bouvel, Mathilde, et al.
Published: (2026)

Bounding and computing obstacle numbers of graphs
by: Balko, Martin, et al.
Published: (2022)

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

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

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

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

On the number of digons in arrangements of pairwise intersecting circles
by: Ackerman, Eyal, et al.
Published: (2024)

Degenerate crossing number and signed reversal distance
by: Fuladi, Niloufar, et al.
Published: (2023)