:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Alsaedi, Rusul J., Gudmundsson, Joachim, van Renssen, André
Format:	Preprint
Published:	2022
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2206.14423
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Shortest Paths of Mutually Visible Robots
by: Alsaedi, Rusul J., et al.
Published: (2023)

Pattern Formation for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2023)

Pattern Formation for Fat Robots with Memory
by: Alsaedi, Rusul J., et al.
Published: (2023)

Spanner for the $0/1/\infty$ weighted region problem
by: Gudmundsson, Joachim, et al.
Published: (2024)

A WSPD, Separator and Small Tree Cover for c-packed Graphs
by: Deryckere, Lindsey, et al.
Published: (2025)

Oriented Spanners
by: Buchin, Kevin, et al.
Published: (2023)

Generalized Sweeping Line Spanners
by: Lee, Keenan, et al.
Published: (2021)

Local Routing on Ordered $Θ$-graphs
by: van Renssen, André, et al.
Published: (2025)

A well-separated pair decomposition for low density graphs
by: Gudmundsson, Joachim, et al.
Published: (2024)

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

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

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

Map matching queries on realistic input graphs under the Fréchet distance
by: Gudmundsson, Joachim, et al.
Published: (2022)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
by: Stojanović, Vanja, et al.
Published: (2025)

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

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
by: Gudmundsson, Joachim, et al.
Published: (2021)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
by: Gudmundsson, Joachim, et al.
Published: (2022)

Minimum Exposure Motion Planning
by: de Berg, Sarita, et al.
Published: (2026)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)

Theoretical analysis of beaconless geocast protocols in 1D
by: Gudmundsson, Joachim, et al.
Published: (2025)

Witness Set: A Visibility Problem in $NP\cap XP$
by: Jana, Satyabrata, et al.
Published: (2026)

The Zarankiewicz Problem for Polygon Visibility Graphs
by: Ackerman, Eyal, et al.
Published: (2025)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)

A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects
by: Chagas, Vítor Gomes, et al.
Published: (2024)

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
by: Di Luna, Giuseppe A., et al.
Published: (2020)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
by: Werner, Peter, et al.
Published: (2023)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
by: Acharya, Pritam, et al.
Published: (2024)

VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization
by: Xiong, Biao, et al.
Published: (2025)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
by: Boomari, Hossein, et al.
Published: (2018)

M-Guarding in K-Visibility
by: Bahoo, Yeganeh, et al.
Published: (2025)

Optimizing Symbol Visibility through Displacement
by: Gärtner, Bernd, et al.
Published: (2023)

An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
by: Ibrahim, Ibrahim, et al.
Published: (2024)

Minimal Submanifolds of The Complex and Quaternionic Projective and Hyperbolic Spaces $\cn P^{2n-1}$, $\hn P^{n-1}$, $\cn H^{2n-1}$, $\hn H^{n-1}$ via Harmonic Morphisms
by: Gudmundsson, Sigmundur
Published: (2026)

Generalized k-Cell Decomposition for Visibility Planning in Polygons
by: Bahoo, Yeganeh, et al.
Published: (2025)

Computing $k$-Crossing Visibility through $k$-levels
by: Duque, Frank
Published: (2023)

On Saxe's theorems about the complexity of the Distance Geometry Problem
by: Kupperschmitt, Maël, et al.
Published: (2025)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
by: Mikula, Jan, et al.
Published: (2025)