On piercing sets of axis-parallel rectangles and rings

DOI10.1007/3-540-63397-9_33MaRDI QIDQ826115zbMATH OpenOpenAlexFDO

Authors Michael Segal

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_33

zbMATH Keywords

binary searchlinear-time algorithmhigh-dimensional spaceleft boundaryquery point

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS
• scientific article; zbMATH DE number 1254001
• scientific article; zbMATH DE number 2080276
• 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES
• Simple linear time algorithms for piercing pairwise intersecting disks

Cited in

(10)

• Optimizing squares covering a set of points
• Constrained square-center problems
• Covering a set of points by two axis-parallel boxes
• Piercing quasi-rectangles-on a problem of Danzer and Rogers
• Hitting and Piercing Rectangles Induced by a Point Set
• A simple linear algorithm for computing rectilinear 3-centers
• Simple linear time algorithms for piercing pairwise intersecting disks
• Piercing all translates of a set of axis-parallel rectangles
• scientific article; zbMATH DE number 2080276 (Why is no real title available?)
• Topological stability of kinetic \(k\)-centers

This page was built for publication: On piercing sets of axis-parallel rectangles and rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826115)