Bicriteria Polygon Aggregation with Arbitrary Shapes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blank, Lotte, Eppstein, David, Haunert, Jan-Henrik, Haverkort, Herman, Kolbe, Benedikt, Mayer, Philip, Mutzel, Petra, Naumann, Alexander, Sauer, Jonas
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
by: Eppstein, David
Published: (2025)

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

Fréchet Distance in the Imbalanced Case
by: Blank, Lotte
Published: (2026)

Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)

Fine-Grained Complexity of Continuous Euclidean k-Center
by: Blank, Lotte, et al.
Published: (2026)

Stabbing Faces By a Convex Curve
by: Eppstein, David
Published: (2025)

Orthogonal dissection into few rectangles
by: Eppstein, David
Published: (2022)

Range Reporting for Time Series via Rectangle Stabbing
by: Blank, Lotte, 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)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
by: Beines, Arne, et al.
Published: (2024)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)

Bicriteria approximation for minimum dilation graph augmentation
by: Buchin, Kevin, et al.
Published: (2024)

Computational Complexities of Folding
by: Eppstein, David
Published: (2024)

Fast Approximations and Coresets for (k, l)-Median under Dynamic Time Warping
by: Conradi, Jacobus, et al.
Published: (2023)

Maintaining Light Spanners via Minimal Updates
by: Khodabandeh, Hadi, et al.
Published: (2024)

Computational Geometry with Probabilistically Noisy Primitive Operations
by: Eppstein, David, et al.
Published: (2025)

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

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

Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs
by: Heeg, Franziska, et al.
Published: (2025)

Computing Non-Obtuse Triangulations with Few Steiner Points
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024)

On the complexity of embedding in graph products
by: Biedl, Therese, et al.
Published: (2023)

Theorem Discovery Amongst Cyclic Polygons
by: Todd, Philip
Published: (2024)

Commutative Properties of Schubert Puzzles with Convex Polygonal Boundary Shapes
by: Anderson, Portia
Published: (2024)

Software for the Thompson and Funk Polygonal Geometry
by: Banerjee, Hridhaan, et al.
Published: (2025)

Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
by: Eppstein, David, et al.
Published: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)

Tiling with Three Polygons is Undecidable
by: Demaine, Erik D., et al.
Published: (2024)

Moduli of polarised manifolds via canonical Kähler metrics
by: Dervan, Ruadhaí, et al.
Published: (2018)

Ipelets for the Convex Polygonal Geometry
by: Parepally, Nithin, et al.
Published: (2024)

Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
by: Eppstein, David, et al.
Published: (2024)

Escaping a Polygon
by: Abel, Zachary, et al.
Published: (2020)

Better Late than Never: the Complexity of Arrangements of Polyhedra
by: Aronov, Boris, et al.
Published: (2025)

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
by: Robson, Eliot W., et al.
Published: (2024)

Robustly Guarding Polygons
by: Das, Rathish, et al.
Published: (2024)

French Onion Soup, Ipelets for Points and Polygons
by: Faber, Klint, et al.
Published: (2025)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)

Convex Sequence and Convex Polygon
by: Goswami, Angshuman Robin, et al.
Published: (2024)

Visualizing Treewidth
by: Chiu, Alvin, et al.
Published: (2025)