Imagen de Portada

Bounding a Polygon by a Minimum Number of Vertices

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abrahamsen, Mikkel, Stade, Jack, Yan, Shuyi, Zhang, Hanwen
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

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

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

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

Online Sorting and Translational Packing of Convex Polygons
por: Aamand, Anders, et al.
Publicado: (2021)

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

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard
por: Stade, Jack
Publicado: (2022)

Ten Problems in Geobotics
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

Covering and Partitioning Complex Objects with Small Pieces
por: Aamand, Anders, et al.
Publicado: (2026)

NP-membership for the boundary-boundary art-gallery problem
por: Stade, Jack
Publicado: (2025)

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

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

Computing Non-Obtuse Triangulations with Few Steiner Points
por: Abrahamsen, Mikkel, et al.
Publicado: (2025)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
por: Dhar, Anubhav, et al.
Publicado: (2024)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
por: Grandoni, Fabrizio, et al.
Publicado: (2024)

Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
por: Biedl, Therese, et al.
Publicado: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
por: Biniaz, Ahmad, et al.
Publicado: (2025)

Escaping a Polygon
por: Abel, Zachary, et al.
Publicado: (2020)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
por: Chung, Jaehoon
Publicado: (2026)

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

The Complexity of Extending Storylines with Minimum Local Crossing Number
por: Dobler, Alexander, et al.
Publicado: (2026)

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

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)

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

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
por: van der Horst, Thijs, et al.
Publicado: (2025)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
por: Barequet, Gill, et al.
Publicado: (2025)

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

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
por: Robson, Eliot W., et al.
Publicado: (2024)

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

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

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

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

Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds
por: Markuš, Nenad, et al.
Publicado: (2021)

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

Compatible Triangulations of Simple Polygons
por: Afshani, Peyman, et al.
Publicado: (2026)

Online Packing of Orthogonal Polygons
por: Gerlach, Tim, et al.
Publicado: (2026)

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

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
por: van der Laan, Joost, et al.
Publicado: (2026)