Image de couverture de livre

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Boomari, Hossein, Ostovari, Mojtaba, Zarei, Alireza
Format:	Preprint
Publié:	2018
Sujets:	Computational Geometry Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

Recognizing 2-Layer and Outer $k$-Planar Graphs
par: Kobayashi, Yasuaki, et autres
Publié: (2024)

Generalized k-Cell Decomposition for Visibility Planning in Polygons
par: Bahoo, Yeganeh, et autres
Publié: (2025)

Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
par: Manna, Bubai
Publié: (2025)

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

Optimizing Visibility-based Search in Polygonal Domains
par: Huynh, Kien C., et autres
Publié: (2024)

Minimum Selective Subset on Some Graph Classes
par: Manna, Bubai
Publié: (2025)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

The Complexity of Drawing Graphs on Few Lines and Few Planes
par: Chaplick, Steven, et autres
Publié: (2016)

VisDiff: SDF-Guided Polygon Generation for Visibility Reconstruction and Recognition
par: Moorthy, Rahul, et autres
Publié: (2024)

GPU-Accelerated 3D Polygon Visibility Volumes for Synergistic Perception and Navigation
par: Willis, Andrew, et autres
Publié: (2024)

TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments
par: Mikula, Jan, et autres
Publié: (2024)

PolygonGNN: Representation Learning for Polygonal Geometries with Heterogeneous Visibility Graph
par: Yu, Dazhou, et autres
Publié: (2024)

Recognizing and Realizing Temporal Reachability Graphs
par: Erlebach, Thomas, et autres
Publié: (2025)

Subcoloring of (Unit) Disk Graphs
par: Marin, Malory, et autres
Publié: (2025)

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

Universal Solvability for Robot Motion Planning on Graphs
par: Dhar, Anubhav, et autres
Publié: (2025)

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

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

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

Compatible Triangulations of Simple Polygons
par: Afshani, Peyman, et autres
Publié: (2026)

Online Packing of Orthogonal Polygons
par: Gerlach, Tim, et autres
Publié: (2026)

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

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

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

On Saxe's theorems about the complexity of the Distance Geometry Problem
par: Kupperschmitt, Maël, et autres
Publié: (2025)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
par: Chan, Timothy M.
Publié: (2026)

On the complexity of embedding in graph products
par: Biedl, Therese, et autres
Publié: (2023)

Geometric Bipartite Matching is in NC
par: Bhore, Sujoy, et autres
Publié: (2024)

Complexity of 2D Snake Cube Puzzles
par: MIT Hardness Group, et autres
Publié: (2024)

Counting Triangulations of Fixed Cardinal Degrees
par: Chambers, Erin, et autres
Publié: (2025)

The Parameterized Complexity of Geometric 1-Planarity
par: Firbas, Alexander
Publié: (2026)

Push-1 is PSPACE-complete, and the automated verification of motion planning gadgets
par: DeStefano, Zachary, et autres
Publié: (2025)

Query-Efficient Fixpoints of $\ell_p$-Contractions
par: Haslebacher, Sebastian, et autres
Publié: (2025)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
par: Gibor, Daniel
Publié: (2025)

Constrained Boundary Labeling
par: Depian, Thomas, et autres
Publié: (2024)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
par: Silva, Lucas de Oliveira, et autres
Publié: (2025)

On the hardness of finding normal surfaces
par: Burton, Benjamin A., et autres
Publié: (2019)

Realizing Metric Spaces with Convex Obstacles
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2025)