Partitioning and separating sets of orthogonal polygons
From MaRDI portal
Publication:1097030
DOI10.1016/0020-0255(87)90014-4zbMath0634.68038OpenAlexW2020088582MaRDI QIDQ1097030
Derick Wood, Thomas Ottmann, Eljas Soisalon-Soininen
Publication date: 1987
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(87)90014-4
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)
Cites Work
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the definition and computation of rectilinear convex hulls
- On the X-Y convex hull of a set of X-Y polygons
- Optimal computation of finitely oriented convex hulls
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- Optimal algorithms to compute the closure of a set of iso-rectangles
- Concurrency Control by Locking
- Minimal rectangular partitions of digitized blobs
- A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
- Plane-sweep algorithms for intersecting geometric figures
- Measuring Concavity on a Rectangular Mosaic
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Partitioning and separating sets of orthogonal polygons
