Cover Image

Drainability and Fillability of Polyominoes in Diverse Models of Global Control

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fekete, Sándor P., Kramer, Peter, Reinhardt, Jan-Marc, Rieck, Christian, Scheffer, Christian
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tilt Automata: Gathering Particles With Uniform External Control
by: Fekete, Sándor P., et al.
Published: (2026)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
by: Fekete, Sándor P., et al.
Published: (2022)

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

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
by: Fekete, Sándor P., et al.
Published: (2024)

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

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
by: Becker, Aaron T., et al.
Published: (2025)

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

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

Sliding Squares in Parallel
by: Akitaya, Hugo A., et al.
Published: (2024)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
by: Becker, Aaron T., et al.
Published: (2024)

Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power
by: Loi, Chek-Manh, et al.
Published: (2026)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
by: Aichholzer, Oswin, et al.
Published: (2026)

Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
by: Guitouni, Mariem, et al.
Published: (2025)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
by: Fekete, Sándor P., et al.
Published: (2025)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024)

Flipping odd matchings in geometric and combinatorial settings
by: Aichholzer, Oswin, et al.
Published: (2025)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
by: Picarella, Gianmarco, et al.
Published: (2025)

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025)

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

Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)

Drawing Reeb Graphs
by: Chambers, Erin, et al.
Published: (2025)

Planar Network Diversion
by: Bentert, Matthias, et al.
Published: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2024)

Approximating Euclidean Shallow-Light Trees
by: Le, Hung, et al.
Published: (2025)

Online Competitive Searching for Rays in the Half-plane
by: Langetepe, Elmar, et al.
Published: (2025)

Better Sampling Bounds for Restricted Delaunay Triangulations and a Star-Shaped Property for Restricted Voronoi Cells
by: Shewchuk, Jonathan Richard
Published: (2026)

Unfolding Polycubes with Orthogonally Convex Layers
by: Damian, Mirela, et al.
Published: (2024)

Evolving Distributions Under Local Motion
by: Acharya, Aditya, et al.
Published: (2024)

Faster, Deterministic and Space Efficient Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2024)

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

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)

Distributed Rhombus Formation of Sliding Squares
by: Kostitsyna, Irina, et al.
Published: (2025)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
by: Kirkpatrick, David, et al.
Published: (2025)

Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
by: Feng, Zhidan, et al.
Published: (2024)

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

Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
by: Díaz-Báñez, J. M., et al.
Published: (2022)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)