Imagen de Portada

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Robson, Eliot W., Spalding-Jamieson, Jack, Zheng, Da Wei
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Carving Polytopes with Saws in 3D
por: Robson, Eliot W., et al.
Publicado: (2024)

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
por: Spalding-Jamieson, Jack, et al.
Publicado: (2025)

The Contiguous Art Gallery Problem is Solvable in Polynomial Time
por: Merrild, Magnus Christian Ring, et al.
Publicado: (2024)

Simpler and Faster Contiguous Art Gallery
por: de Berg, Sarita, et al.
Publicado: (2025)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
por: Lynch, Jayson, et al.
Publicado: (2025)

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

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
por: Spalding-Jamieson, Jack, et al.
Publicado: (2025)

The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard
por: Stade, Jack
Publicado: (2022)

Morphing Planar Graph Drawings via Orthogonal Box Drawings
por: Biedl, Therese, et al.
Publicado: (2024)

Slant/Gokigen Naname is NP-complete, and Some Variations are in P
por: Lynch, Jayson, et al.
Publicado: (2025)

Well-Separated Pairs Decomposition Revisited
por: Har-Peled, Sariel, et al.
Publicado: (2025)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

Improving the average dilation of a metric graph by adding edges
por: Har-Peled, Sariel, et al.
Publicado: (2025)

No-dimensional Tverberg Partitions Revisited
por: Har-Peled, Sariel, et al.
Publicado: (2023)

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
por: Hengeveld, Simon, et al.
Publicado: (2020)

The Presort Hierarchy for Geometric Problems
por: van der Hoog, Ivor, et al.
Publicado: (2026)

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

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

Super Guarding and Dark Rays in Art Galleries
por: MIT CompGeom Group, et al.
Publicado: (2024)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
por: Har-Peled, Sariel, et al.
Publicado: (2024)

The Road to the Closest Point is Paved by Good Neighbors
por: Har-Peled, Sariel, et al.
Publicado: (2025)

Bicriteria Polygon Aggregation with Arbitrary Shapes
por: Blank, Lotte, et al.
Publicado: (2025)

Covering Simple Orthogonal Polygons with Rectangles
por: Roy, Aniket Basu
Publicado: (2024)

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

Contiguous Boundary Guarding
por: Biniaz, Ahmad, et al.
Publicado: (2024)

On the Reduction of the Spherical Point-in-Polygon Problem for Antipode-Excluding Spherical Polygons
por: Li, Ziqiang, et al.
Publicado: (2023)

Bounding a Polygon by a Minimum Number of Vertices
por: Abrahamsen, Mikkel, et al.
Publicado: (2025)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
por: Dhar, Anubhav, et al.
Publicado: (2024)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
por: Rajabi-Alni, Fatemeh, et al.
Publicado: (2024)

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

Shortest Path Separators in Unit Disk Graphs
por: Harb, Elfarouk, et al.
Publicado: (2024)

Topology-Preserving Line Densification for Creating Contiguous Cartograms
por: Miaji, Nihal Z., et al.
Publicado: (2025)

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

Escaping a Polygon
por: Abel, Zachary, et al.
Publicado: (2020)

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

Robustly Guarding Polygons
por: Das, Rathish, et al.
Publicado: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
por: Kolmogorov, Vladimir, et al.
Publicado: (2026)

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

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