Cover Image

Generalized k-Cell Decomposition for Visibility Planning in Polygons

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bahoo, Yeganeh, Saeedi, Sajad, Sherman, Roni
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

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

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

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

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

Structure from WiFi (SfW): RSSI-based Geometric Mapping of Indoor Environments
by: Kim, Junseo, et al.
Published: (2024)

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

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

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

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

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

Efficient Enumeration of At Most $k$-Out Polygons
by: Akram, Waseem, 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)

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

Tiling with Three Polygons is Undecidable
by: Demaine, Erik D., et al.
Published: (2024)

Near-Optimal Min-Sum Motion Planning in a Planar Polygonal Environment
by: Agarwal, Pankaj K., et al.
Published: (2025)

Escaping a Polygon
by: Abel, Zachary, et al.
Published: (2020)

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

Software for the Thompson and Funk Polygonal Geometry
by: Banerjee, Hridhaan, et al.
Published: (2025)

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

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)

Ipelets for the Convex Polygonal Geometry
by: Parepally, Nithin, et al.
Published: (2024)

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

Bicriteria Polygon Aggregation with Arbitrary Shapes
by: Blank, Lotte, et al.
Published: (2025)

Multiple Watchman Routes in Staircase Polygons
by: Brötzner, Anna, et al.
Published: (2025)

On Approximation Schemes for Stabbing Rectilinear Polygons
by: Khan, Arindam, et al.
Published: (2024)

Realizing Planar Linkages in Polygonal Domains
by: Depian, Thomas, et al.
Published: (2026)

Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)

Shadoks Approach to Knapsack Polygonal Packing
by: da Fonseca, Guilherme D., et al.
Published: (2024)

Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)

On the Reduction of the Spherical Point-in-Polygon Problem for Antipode-Excluding Spherical Polygons
by: Li, Ziqiang, et al.
Published: (2023)

French Onion Soup, Ipelets for Points and Polygons
by: Faber, Klint, et al.
Published: (2025)

Multirobot Watchman Routes in a Simple Polygon
by: Mitchell, Joseph S. B., et al.
Published: (2024)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
by: Deligkas, Argyrios, et al.
Published: (2026)

Bounding a Polygon by a Minimum Number of Vertices
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

Minimum Partition of Polygons under Width and Cut Constraints
by: Chung, Jaehoon, et al.
Published: (2025)

Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
by: Chan, Timothy M.
Published: (2026)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)