Minimum Star Partitions of Simple Polygons in Polynomial Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abrahamsen, Mikkel, Blikstad, Joakim, Nusser, André, Zhang, Hanwen
Format:	Preprint
Published:	2023
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

Ten Problems in Geobotics
by: Abrahamsen, Mikkel, et al.
Published: (2024)

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

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

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

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

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

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

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

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)

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

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

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

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

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

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

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

Simple Grid Polygon Online Exploration Revisited
by: Brock, Maximilian, et al.
Published: (2024)

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

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

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)

Faster Fréchet Distance under Transformations
by: Buchin, Kevin, et al.
Published: (2025)

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

Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
by: Aronov, Boris, et al.
Published: (2019)

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

Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
by: Blank, Lotte, et al.
Published: (2025)

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

Convex Polygon Containment: Improving Quadratic to Near Linear Time
by: Chan, Timothy M., et al.
Published: (2024)

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

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

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

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

Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
by: Krivošija, Amer, et al.
Published: (2025)