Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane

DOI10.1007/11589440_6zbMATH Open1136.68556OpenAlexW1603241523MaRDI QIDQ5449754FDOQ5449754

Hervé Brönnimann

Publication date: 18 March 2008

Published in: Discrete and Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11589440_6

Recommendations

• Small-size \(\varepsilon\)-nets for axis-parallel rectangles and boxes
• Small-size ε-nets for axis-parallel rectangles and boxes
• A simple linear time algorithm for proper box rectangular drawings of plane graphs
• scientific article; zbMATH DE number 1830737
• A fast implementation for the 2D/3D box placement problem
• Faster algorithms for largest empty rectangles and boxes
• Linear-size planar Manhattan network for convex point sets
• Efficient and small representation of line arrangements with applications
• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays

Mathematics Subject Classification ID

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

Cited In (3)

• A fast implementation for the 2D/3D box placement problem
• Small-size ε-nets for axis-parallel rectangles and boxes
• A Danzer set for axis parallel boxes

This page was built for publication: Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane

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