Image de couverture de livre

Orthogonal dissection into few rectangles

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Eppstein, David
Format:	Preprint
Publié:	2022
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Non-Euclidean Erdős-Anning Theorems
par: Eppstein, David
Publié: (2024)

Stabbing Faces By a Convex Curve
par: Eppstein, David
Publié: (2025)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
par: Eppstein, David
Publié: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
par: Eppstein, David
Publié: (2023)

Computational Complexities of Folding
par: Eppstein, David
Publié: (2024)

Computational Geometry with Probabilistically Noisy Primitive Operations
par: Eppstein, David, et autres
Publié: (2025)

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

On the complexity of embedding in graph products
par: Biedl, Therese, et autres
Publié: (2023)

Matching random colored points with rectangles (Corrigendum)
par: Corujo, Josué, et autres
Publié: (2025)

Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
par: Eppstein, David, et autres
Publié: (2025)

A fast algorithm for computing a planar support for non-piercing rectangles
par: Pal, Ambar, et autres
Publié: (2024)

Better Late than Never: the Complexity of Arrangements of Polyhedra
par: Aronov, Boris, et autres
Publié: (2025)

Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
par: Eppstein, David, et autres
Publié: (2024)

Visualizing Treewidth
par: Chiu, Alvin, et autres
Publié: (2025)

Random covering by rectangles on self-similar carpets
par: Daviaud, E
Publié: (2025)

Bicriteria Polygon Aggregation with Arbitrary Shapes
par: Blank, Lotte, et autres
Publié: (2025)

Parameterized Approaches to Orthogonal Compaction
par: Didimo, Walter, et autres
Publié: (2022)

Online Packing of Orthogonal Polygons
par: Gerlach, Tim, et autres
Publié: (2026)

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
par: Yang, Chao, et autres
Publié: (2025)

Covering Simple Orthogonal Polygons with Rectangles
par: Roy, Aniket Basu
Publié: (2024)

Orthogonal Emptiness Queries for Random Points
par: Dullerud, Jonathan E., et autres
Publié: (2025)

Noncrossing Longest Paths and Cycles
par: Aloupis, Greg, et autres
Publié: (2024)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
par: Dhar, Anubhav, et autres
Publié: (2024)

Morphing Planar Graph Drawings via Orthogonal Box Drawings
par: Biedl, Therese, et autres
Publié: (2024)

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
par: Chung, Jaehoon
Publié: (2026)

Jordan curves inscribe a positive measure of rectangles
par: Greene, Joshua Evan, et autres
Publié: (2026)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
par: Werner, Peter, et autres
Publié: (2023)

A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings
par: Andreola, Giordano, et autres
Publié: (2025)

Canonical Ramsey: triangles, rectangles and beyond
par: Fang, Yijia, et autres
Publié: (2025)

Optimal Orthogonal Drawings in Linear Time
par: Didimo, Walter, et autres
Publié: (2025)

Unfolding Polycubes with Orthogonally Convex Layers
par: Damian, Mirela, et autres
Publié: (2024)

Touring a Sequence of Orthogonal Polygons
par: Casel, Katrin, et autres
Publié: (2026)

Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area
par: Bui, Hong Duc
Publié: (2025)

Larger Nearly Orthogonal Sets over Finite Fields
par: Haviv, Ishay, et autres
Publié: (2024)

Nearly Orthogonal Sets over Finite Fields
par: Chawin, Dror, et autres
Publié: (2024)

Quasimetric spaces with few lines
par: Quintero, Guillermo Gamboa, et autres
Publié: (2024)

Floer-type bipersistence modules and rectangle barcodes
par: Koeda, Kanta, et autres
Publié: (2023)

The Complexity of Iterated Reversible Computation
par: Eppstein, David
Publié: (2021)

Unbent Collections of Orthogonal Drawings
par: Antić, Todor, et autres
Publié: (2025)

Constructively describing orbit spaces of finite groups by few inequalities
par: Moustrou, Philippe, et autres
Publié: (2024)