Cover Image

M-Guarding in K-Visibility

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bahoo, Yeganeh, Kamaludeen, Ahmad
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized k-Cell Decomposition for Visibility Planning in Polygons
by: Bahoo, Yeganeh, et al.
Published: (2025)

Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)

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

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

DPPE: Dense Pose Estimation in a Plenoxels Environment using Gradient Approximation
by: Kolios, Christopher, et al.
Published: (2024)

Robustly Guarding Polygons
by: Das, Rathish, et al.
Published: (2024)

Sometimes Two Irrational Guards are Needed
by: Meijer, Lucas, et al.
Published: (2022)

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

Optimizing Symbol Visibility through Displacement
by: Gärtner, Bernd, et al.
Published: (2023)

Shortest Paths of Mutually Visible Robots
by: Alsaedi, Rusul J., et al.
Published: (2023)

The Mutual Visibility Problem for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2022)

Computing $k$-Crossing Visibility through $k$-levels
by: Duque, Frank
Published: (2023)

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

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

Witness Set: A Visibility Problem in $NP\cap XP$
by: Jana, Satyabrata, et al.
Published: (2026)

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

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
by: Mikula, Jan, et al.
Published: (2025)

VisACD: Visibility-Based GPU-Accelerated Approximate Convex Decomposition
by: Fokin, Egor, et al.
Published: (2026)

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

TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments
by: Mikula, Jan, et al.
Published: (2024)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
by: Werner, Peter, et al.
Published: (2023)

VisDiff: SDF-Guided Polygon Generation for Visibility Reconstruction and Recognition
by: Moorthy, Rahul, et al.
Published: (2024)

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

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
by: Di Luna, Giuseppe A., et al.
Published: (2020)

GPU-Accelerated 3D Polygon Visibility Volumes for Synergistic Perception and Navigation
by: Willis, Andrew, et al.
Published: (2024)

An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
by: Ibrahim, Ibrahim, et al.
Published: (2024)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
by: Stojanović, Vanja, et al.
Published: (2025)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)

Fusing in 3D: Free-Viewpoint Fusion Rendering with a 3D Infrared-Visible Scene Representation
by: Yang, Chao, et al.
Published: (2026)

Optimizing Visibility-based Search in Polygonal Domains
by: Huynh, Kien C., et al.
Published: (2024)

Inverse k-visibility for RSSI-based Indoor Geometric Mapping
by: Kim, Junseo, et al.
Published: (2024)

Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)

Metricizing the Euclidean Space towards Desired Distance Relations in Point Clouds
by: Rass, Stefan, et al.
Published: (2022)

Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)

An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)

Investigating Simple Drawings of $K_n$ using SAT
by: Bergold, Helena, et al.
Published: (2025)

On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025)