Imagen de Portada

Sometimes Two Irrational Guards are Needed

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Meijer, Lucas, Miltzow, Tillmann
Formato:	Preprint
Publicado:	2022
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Beyond Bits: An Introduction to Computation over the Reals
por: Miltzow, Tillmann
Publicado: (2026)

Devil's Games and $\text{Q}\mathbb{R}$: Continuous Games complete for the First-Order Theory of the Reals
por: Meijer, Lucas, et al.
Publicado: (2025)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
por: Abrahamsen, Mikkel, et al.
Publicado: (2020)

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

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

On Classifying Continuous Constraint Satisfaction Problems
por: Miltzow, Tillmann, et al.
Publicado: (2021)

The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
por: Meijer, Lucas, et al.
Publicado: (2026)

Recognition of Unit Segment and Polyline Graphs is $\exists\mathbb{R}$-Complete
por: Hoffmann, Michael, et al.
Publicado: (2024)

The Existential Theory of the Reals as a Complexity Class: A Compendium
por: Schaefer, Marcus, et al.
Publicado: (2024)

Oracle Separations for RPH
por: Hamm, Thekla, et al.
Publicado: (2025)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
por: Förster, Henry, et al.
Publicado: (2023)

On Equivalent Characterizations of NP in Abstract Models of Computation
por: Kirn, Jeremy C., et al.
Publicado: (2025)

Guarding Terrains with Guards on a Line
por: Kang, Byeonguk, et al.
Publicado: (2025)

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

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

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

The Very General Verra Fourfold is Irrational
por: Fay, Aideen
Publicado: (2026)

Unfolding Polycubes with Orthogonally Convex Layers
por: Damian, Mirela, et al.
Publicado: (2024)

Representing Matroids over the Reals is $\exists \mathbb R$-complete
por: Kim, Eun Jung, et al.
Publicado: (2023)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
por: Fekete, Sándor P., et al.
Publicado: (2024)

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

Irrationality of the general smooth quartic $3$-fold using intermediate Jacobians
por: Farb, Benson
Publicado: (2024)

Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard
por: Abel, Zachary, et al.
Publicado: (2025)

Clustering with Few Disks to Minimize the Sum of Radii
por: Abrahamsen, Mikkel, et al.
Publicado: (2023)

Guarding Offices with Maximum Dispersion
por: Fekete, Sándor P., et al.
Publicado: (2025)

Two Tiling is Undecidable
por: Stade, Jack
Publicado: (2025)

Guarding Polyominoes Under $k$-Hop Visibility
por: Filtser, Omrit, et al.
Publicado: (2023)

Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
por: Bertschinger, Daniel, et al.
Publicado: (2022)

Irrational components of the Hilbert scheme of points
por: Farkas, Gavril, et al.
Publicado: (2024)

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
por: Bui, Hong Duc
Publicado: (2025)

Two-Disk Compound Symmetry Groups
por: Hearn, Robert A., et al.
Publicado: (2023)

Constrained Two-Line Center Problems
por: Ahn, Taehoon, et al.
Publicado: (2024)

Simultaneous Embedding of Two Paths on the Grid
por: Kobourov, Stephen, et al.
Publicado: (2026)

Optimal Algorithm for the Planar Two-Center Problem
por: Cho, Kyungjin, et al.
Publicado: (2020)

Maximum-Weight Two Boxes Symmetric Difference Problem
por: Goycoolea, José Fernández, et al.
Publicado: (2026)

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

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
por: Abrahamsen, Mikkel, et al.
Publicado: (2025)

Cayley Configuration Spaces of a Common Class of Mechanisms in Two Dimensions
por: Sitharam, Meera, et al.
Publicado: (2011)

Optimal Motion Planning for Two Square Robots in a Rectilinear Environment
por: Agarwal, Pankaj K., et al.
Publicado: (2026)

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