:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Eppstein, David
Format:	Preprint
Published:	2022
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2206.10675
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)

Stabbing Faces By a Convex Curve
by: Eppstein, David
Published: (2025)

Computational Complexities of Folding
by: Eppstein, David
Published: (2024)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
by: Eppstein, David
Published: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)

Maintaining Light Spanners via Minimal Updates
by: Khodabandeh, Hadi, et al.
Published: (2024)

Computational Geometry with Probabilistically Noisy Primitive Operations
by: Eppstein, David, et al.
Published: (2025)

On the complexity of embedding in graph products
by: Biedl, Therese, et al.
Published: (2023)

Matching random colored points with rectangles (Corrigendum)
by: Corujo, Josué, et al.
Published: (2025)

Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
by: Eppstein, David, et al.
Published: (2025)

Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
by: Eppstein, David, et al.
Published: (2024)

Better Late than Never: the Complexity of Arrangements of Polyhedra
by: Aronov, Boris, et al.
Published: (2025)

A fast algorithm for computing a planar support for non-piercing rectangles
by: Pal, Ambar, et al.
Published: (2024)

Visualizing Treewidth
by: Chiu, Alvin, et al.
Published: (2025)

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

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

Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)

Parameterized Approaches to Orthogonal Compaction
by: Didimo, Walter, et al.
Published: (2022)

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
by: Yang, Chao, et al.
Published: (2025)

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

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

Orthogonal Emptiness Queries for Random Points
by: Dullerud, Jonathan E., et al.
Published: (2025)

Jordan curves inscribe a positive measure of rectangles
by: Greene, Joshua Evan, et al.
Published: (2026)

Canonical Ramsey: triangles, rectangles and beyond
by: Fang, Yijia, et al.
Published: (2025)

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

Morphing Planar Graph Drawings via Orthogonal Box Drawings
by: Biedl, Therese, et al.
Published: (2024)

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

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
by: Werner, Peter, et al.
Published: (2023)

A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings
by: Andreola, Giordano, et al.
Published: (2025)

Optimal Orthogonal Drawings in Linear Time
by: Didimo, Walter, et al.
Published: (2025)

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

Touring a Sequence of Orthogonal Polygons
by: Casel, Katrin, et al.
Published: (2026)

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

Larger Nearly Orthogonal Sets over Finite Fields
by: Haviv, Ishay, et al.
Published: (2024)

Floer-type bipersistence modules and rectangle barcodes
by: Koeda, Kanta, et al.
Published: (2023)

Nearly Orthogonal Sets over Finite Fields
by: Chawin, Dror, et al.
Published: (2024)

The Complexity of Iterated Reversible Computation
by: Eppstein, David
Published: (2021)

Quasimetric spaces with few lines
by: Quintero, Guillermo Gamboa, et al.
Published: (2024)

Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)

Constructively describing orbit spaces of finite groups by few inequalities
by: Moustrou, Philippe, et al.
Published: (2024)