The Contiguous Art Gallery Problem is Solvable in Polynomial Time
Fuente:
arXiv
Saved in:
| Main Authors: | Merrild, Magnus Christian Ring, Rysgaard, Casper Moldrup, Schou, Jens Kristian Refsgaard, Svenning, Rolf |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Trajectory Minimum Touching Ball
by: Phillips, Jeff M., et al.
Published: (2025)
by: Phillips, Jeff M., et al.
Published: (2025)
Simpler and Faster Contiguous Art Gallery
by: de Berg, Sarita, et al.
Published: (2025)
by: de Berg, Sarita, et al.
Published: (2025)
The Contiguous Art Gallery Problem is in Θ(n log n)
by: de Berg, Sarita, et al.
Published: (2025)
by: de Berg, Sarita, et al.
Published: (2025)
Buffered Partially-Persistent External-Memory Search Trees
by: Brodal, Gerth Stølting, et al.
Published: (2025)
by: Brodal, Gerth Stølting, et al.
Published: (2025)
The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
by: Robson, Eliot W., et al.
Published: (2024)
by: Robson, Eliot W., et al.
Published: (2024)
The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard
by: Stade, Jack
Published: (2022)
by: Stade, Jack
Published: (2022)
Fast Area-Weighted Peeling of Convex Hulls for Outlier Detection
by: Sridhar, Vinesh, et al.
Published: (2024)
by: Sridhar, Vinesh, et al.
Published: (2024)
Towards Lazy B-Trees
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
by: Hengeveld, Simon, et al.
Published: (2020)
by: Hengeveld, Simon, et al.
Published: (2020)
VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization
by: Xiong, Biao, et al.
Published: (2025)
by: Xiong, Biao, et al.
Published: (2025)
A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)
by: Elbassioni, Khaled
Published: (2025)
Super Guarding and Dark Rays in Art Galleries
by: MIT CompGeom Group, et al.
Published: (2024)
by: MIT CompGeom Group, et al.
Published: (2024)
Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Fast Time-Varying Contiguous Cartograms Using Integral Images
by: Molchanov, Vladimir, et al.
Published: (2026)
by: Molchanov, Vladimir, et al.
Published: (2026)
Topology-Preserving Line Densification for Creating Contiguous Cartograms
by: Miaji, Nihal Z., et al.
Published: (2025)
by: Miaji, Nihal Z., et al.
Published: (2025)
Effectiveness of Area-to-Value Legends and Grid Lines in Contiguous Area Cartograms
by: Fung, Kelvin L. T., et al.
Published: (2022)
by: Fung, Kelvin L. T., et al.
Published: (2022)
Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)
by: Abrahamsen, Mikkel, et al.
Published: (2023)
Kaleidoscope Gallery: Exploring Ethics and Generative AI Through Art
by: Issak, Alayt, et al.
Published: (2025)
by: Issak, Alayt, et al.
Published: (2025)
Partition-based Simple Heaps
by: Brodal, Gerth Stølting, et al.
Published: (2026)
by: Brodal, Gerth Stølting, et al.
Published: (2026)
Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
by: Gibor, Daniel
Published: (2025)
by: Gibor, Daniel
Published: (2025)
Universal Solvability for Robot Motion Planning on Graphs
by: Dhar, Anubhav, et al.
Published: (2025)
by: Dhar, Anubhav, et al.
Published: (2025)
A Polynomial-Time Algorithm for Computing the Exact Convex Hull in High-Dimensional Spaces
by: Zhuang, Qianwei
Published: (2025)
by: Zhuang, Qianwei
Published: (2025)
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
by: Galby, Esther, et al.
Published: (2023)
by: Galby, Esther, et al.
Published: (2023)
2-Layer Fan-Planarity in Polynomial Time
by: Kobayashi, Yasuaki, et al.
Published: (2025)
by: Kobayashi, Yasuaki, et al.
Published: (2025)
An Algebraic Geometry Approach to Viewing Graph Solvability
by: Arrigoni, Federica, et al.
Published: (2025)
by: Arrigoni, Federica, et al.
Published: (2025)
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)
by: Eppstein, David
Published: (2023)
Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
by: Vu, Thi Xuan
Published: (2025)
by: Vu, Thi Xuan
Published: (2025)
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)
by: Har-Peled, Sariel, et al.
Published: (2014)
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
by: S, Ajaykrishnan E, et al.
Published: (2025)
by: S, Ajaykrishnan E, et al.
Published: (2025)
How Many Slopes Does Polynomial Area Cost?
by: Bekos, Michael A., et al.
Published: (2026)
by: Bekos, Michael A., et al.
Published: (2026)
Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)
by: Chung, Chaeyoon, et al.
Published: (2026)
Polynomial 2D Green Coordinates for High-order Cages
by: Liu, Shibo, et al.
Published: (2024)
by: Liu, Shibo, et al.
Published: (2024)
A simple linear time algorithm for smallest enclosing circles on the (hemi)sphere
by: Flemming, Jens
Published: (2024)
by: Flemming, Jens
Published: (2024)
Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
by: Aronov, Boris, et al.
Published: (2019)
by: Aronov, Boris, et al.
Published: (2019)
Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
by: Bui, Hong Duc
Published: (2025)
by: Bui, Hong Duc
Published: (2025)
Subset Selection Problems in Planar Point Sets
by: Balogh, József, et al.
Published: (2024)
by: Balogh, József, et al.
Published: (2024)
Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
by: Davies, James, et al.
Published: (2024)
by: Davies, James, et al.
Published: (2024)
On Saxe's theorems about the complexity of the Distance Geometry Problem
by: Kupperschmitt, Maël, et al.
Published: (2025)
by: Kupperschmitt, Maël, et al.
Published: (2025)
Polynomial Bounds in Koldobsky's Discrete Slicing Problem
by: Freyer, Ansgar, et al.
Published: (2023)
by: Freyer, Ansgar, et al.
Published: (2023)
$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
by: Greenhut, Daniel, et al.
Published: (2025)
by: Greenhut, Daniel, et al.
Published: (2025)
Similar Items
-
Trajectory Minimum Touching Ball
by: Phillips, Jeff M., et al.
Published: (2025) -
Simpler and Faster Contiguous Art Gallery
by: de Berg, Sarita, et al.
Published: (2025) -
The Contiguous Art Gallery Problem is in Θ(n log n)
by: de Berg, Sarita, et al.
Published: (2025) -
Buffered Partially-Persistent External-Memory Search Trees
by: Brodal, Gerth Stølting, et al.
Published: (2025) -
The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
by: Robson, Eliot W., et al.
Published: (2024)