Cover Image

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	de Berg, Mark, Bose, Prosenjit, Theocharous, Leonidas
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

Realizing Metric Spaces with Convex Obstacles
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)

Convex Covering Using Collections of Convex Polygons and Set Cover
by: da Fonseca, Guilherme D.
Published: (2023)

Clustering with Few Disks to Minimize the Sum of Radii
by: Abrahamsen, Mikkel, et al.
Published: (2023)

On the Maximal Gaussian Perimeter of Convex Sets, Revisited
by: Nadimpalli, Shivam, et al.
Published: (2025)

An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)

Computational aspects of disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2026)

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

Maximal Distortion of Geodesic Diameters in Polygonal Domains
by: Dumitrescu, Adrian, et al.
Published: (2023)

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)

The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)

Approximating shortest paths in weighted square and hexagonal meshes
by: Bose, Prosenjit, et al.
Published: (2024)

On approximating shortest paths in weighted triangular tessellations
by: Bose, Prosenjit, et al.
Published: (2021)

The Complexity of Geodesic Spanners
by: de Berg, Sarita, et al.
Published: (2023)

Convex Polygon Containment: Improving Quadratic to Near Linear Time
by: Chan, Timothy M., et al.
Published: (2024)

On geodesic disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2025)

Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)

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

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
by: Grandoni, Fabrizio, et al.
Published: (2024)

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

Finite k-Transversals of Infinite Families of Fat Convex Sets
by: Chakraborty, Sutanoya, et al.
Published: (2022)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
by: de Berg, Mark, et al.
Published: (2026)

On some relations between the Perimeter, the Area and the Visual Angle of a Convex Set
by: Bruna, Joaquim, et al.
Published: (2024)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
by: Chan, Timothy M., et al.
Published: (2025)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
by: de Berg, Sarita, et al.
Published: (2023)

The Complexity of Geodesic Spanners using Steiner Points
by: de Berg, Sarita, et al.
Published: (2024)

Witness Set in Monotone Polygons: Exact and Approximate
by: Das, Udvas, et al.
Published: (2025)

Instance-Optimal Imprecise Convex Hull
by: de Berg, Sarita, et al.
Published: (2025)

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

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

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)

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

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

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
by: de Berg, Mark, et al.
Published: (2025)

On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)