Hole Problems for Rectangles in the Plane

DOI10.1137/0401010zbMath0638.52001OpenAlexW2081459334MaRDI QIDQ3779343

Gregory J. E. Rawlins, Derick Wood, Peter Widmayer

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401010

zbMATH Keywords

holescountingreportingunion of rectanglesspace- optimal algorithmstime-optimal algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99) Designs and configurations (05B99)

Related Items (1)

A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

This page was built for publication: Hole Problems for Rectangles in the Plane