Rectangular partitions of a rectilinear polygon
From MaRDI portal
Publication:2678268
DOI10.1016/j.comgeo.2022.101965OpenAlexW4309633142MaRDI QIDQ2678268
Hee-Kap Ahn, Jaegun Lee, Hwi Kim
Publication date: 9 January 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.01970
Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)
Cites Work
- Unnamed Item
- Unnamed Item
- The structure of optimal partitions of orthogonal polygons into fat rectangles
- How to draw a planar graph on a grid
- Triangulating a simple polygon in linear time
- Approximation algorithms for partitioning a rectangle with interior points
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Minimal rectangular partitions of digitized blobs
- Planar Formulae and Their Uses
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Maximizing dominance in the plane and its applications
This page was built for publication: Rectangular partitions of a rectilinear polygon