Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Robson, Eliot W., Spalding-Jamieson, Jack, Zheng, Da Wei
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Carving Polytopes with Saws in 3D
par: Robson, Eliot W., et autres
Publié: (2024)

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
par: Spalding-Jamieson, Jack, et autres
Publié: (2025)

The Contiguous Art Gallery Problem is Solvable in Polynomial Time
par: Merrild, Magnus Christian Ring, et autres
Publié: (2024)

Simpler and Faster Contiguous Art Gallery
par: de Berg, Sarita, et autres
Publié: (2025)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
par: Lynch, Jayson, et autres
Publié: (2025)

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

The Contiguous Art Gallery Problem is in Θ(n log n)
par: de Berg, Sarita, et autres
Publié: (2025)

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
par: Spalding-Jamieson, Jack, et autres
Publié: (2025)

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

Morphing Planar Graph Drawings via Orthogonal Box Drawings
par: Biedl, Therese, et autres
Publié: (2024)

Slant/Gokigen Naname is NP-complete, and Some Variations are in P
par: Lynch, Jayson, et autres
Publié: (2025)

Well-Separated Pairs Decomposition Revisited
par: Har-Peled, Sariel, et autres
Publié: (2025)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

Improving the average dilation of a metric graph by adding edges
par: Har-Peled, Sariel, et autres
Publié: (2025)

No-dimensional Tverberg Partitions Revisited
par: Har-Peled, Sariel, et autres
Publié: (2023)

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
par: Hengeveld, Simon, et autres
Publié: (2020)

The Presort Hierarchy for Geometric Problems
par: van der Hoog, Ivor, et autres
Publié: (2026)

VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization
par: Xiong, Biao, et autres
Publié: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Super Guarding and Dark Rays in Art Galleries
par: MIT CompGeom Group, et autres
Publié: (2024)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
par: Har-Peled, Sariel, et autres
Publié: (2024)

The Road to the Closest Point is Paved by Good Neighbors
par: Har-Peled, Sariel, et autres
Publié: (2025)

Bicriteria Polygon Aggregation with Arbitrary Shapes
par: Blank, Lotte, et autres
Publié: (2025)

Covering Simple Orthogonal Polygons with Rectangles
par: Roy, Aniket Basu
Publié: (2024)

Convex Covering Using Collections of Convex Polygons and Set Cover
par: da Fonseca, Guilherme D.
Publié: (2023)

Contiguous Boundary Guarding
par: Biniaz, Ahmad, et autres
Publié: (2024)

On the Reduction of the Spherical Point-in-Polygon Problem for Antipode-Excluding Spherical Polygons
par: Li, Ziqiang, et autres
Publié: (2023)

Bounding a Polygon by a Minimum Number of Vertices
par: Abrahamsen, Mikkel, et autres
Publié: (2025)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
par: Dhar, Anubhav, et autres
Publié: (2024)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
par: Rajabi-Alni, Fatemeh, et autres
Publié: (2024)

The Zarankiewicz Problem for Polygon Visibility Graphs
par: Ackerman, Eyal, et autres
Publié: (2025)

Shortest Path Separators in Unit Disk Graphs
par: Harb, Elfarouk, et autres
Publié: (2024)

Topology-Preserving Line Densification for Creating Contiguous Cartograms
par: Miaji, Nihal Z., et autres
Publié: (2025)

Tiling with Three Polygons is Undecidable
par: Demaine, Erik D., et autres
Publié: (2024)

Escaping a Polygon
par: Abel, Zachary, et autres
Publié: (2020)

Software for the Thompson and Funk Polygonal Geometry
par: Banerjee, Hridhaan, et autres
Publié: (2025)

Robustly Guarding Polygons
par: Das, Rathish, et autres
Publié: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
par: Kolmogorov, Vladimir, et autres
Publié: (2026)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
par: Boomari, Hossein, et autres
Publié: (2018)

Ipelets for the Convex Polygonal Geometry
par: Parepally, Nithin, et autres
Publié: (2024)