Imagen de Portada

Simple Grid Polygon Online Exploration Revisited

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brock, Maximilian, Brückmann, Martin, Langetepe, Elmar, Wude, Raphael
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
por: Bartlmae, Simon, et al.
Publicado: (2024)

Visibility Queries in Simple Polygons
por: Bhore, Sujoy, et al.
Publicado: (2026)

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

Touring a Sequence of Orthogonal Polygons
por: Casel, Katrin, et al.
Publicado: (2026)

Efficient Enumeration of At Most $k$-Out Polygons
por: Akram, Waseem, et al.
Publicado: (2025)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
por: Eppstein, David
Publicado: (2025)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
por: Deligkas, Argyrios, et al.
Publicado: (2026)

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

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

Dynamic Convex Hulls for Simple Paths
por: Brewer, Bruce, et al.
Publicado: (2024)

Simple Construction of Greedy Trees and Greedy Permutations
por: Chubet, Oliver, et al.
Publicado: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

Online Algorithms for Geometric Independent Set
por: De, Minati, et al.
Publicado: (2026)

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
por: Depian, Thomas, et al.
Publicado: (2026)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
por: Conradi, Jacobus, et al.
Publicado: (2026)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
por: Bhore, Sujoy, et al.
Publicado: (2023)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
por: Fekete, Sándor P., et al.
Publicado: (2024)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
por: Garcia, Javier, et al.
Publicado: (2025)

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

Simple Compact Monotone Tree Drawings
por: Oikonomou, Anargyros, et al.
Publicado: (2017)

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

Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length
por: Lipschütz, Henriette, et al.
Publicado: (2023)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

The Peculiarities of Extending Queue Layouts
por: Depian, Thomas, et al.
Publicado: (2025)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
por: Goodrich, Michael T., et al.
Publicado: (2024)

Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
por: Herold, Martin G., et al.
Publicado: (2025)

Online Facility Assignments on Polygons
por: Malik, Sumaiya, et al.
Publicado: (2025)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
por: Spalding-Jamieson, Jack
Publicado: (2025)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
por: Dorfer, Joseph
Publicado: (2026)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
por: Kakimura, Naonori, et al.
Publicado: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
por: Ebbens, Matthijs, et al.
Publicado: (2024)

Extraction Theorems With Small Extraction Numbers
por: Agarwal, Arjun, et al.
Publicado: (2024)

Fréchet Distance in Subquadratic Time
por: Cheng, Siu-Wing, et al.
Publicado: (2024)

Computing largest minimum color-spanning intervals of imprecise points
por: Acharyya, Ankush, et al.
Publicado: (2024)