Spanning trees crossing few barriers

DOI10.1007/S00454-003-2853-5MaRDI QIDQ1422228zbMATH OpenOpenAlexWikidataFDO

Authors Tetsuo Asano, Leonidas Guibas, Hisao Tamaki, Mark de Berg, Otfried Cheong, Jack Snoeyink

Publication date 5 February 2004

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-003-2853-5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• Tight bounds for connecting sites across barriers
• Tight bounds for connecting sites across barriers
• Spanning trees with low crossing number
• Low degree spanning trees of small weight
• Growing a Tree from Its Branches

Cites work

• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• Efficient binary space partitions for hidden-surface removal and solid modeling
• Illumination of convex discs
• Linear size binary space partitions for uncluttered scenes
• Linear-time reconstruction of Delaunay triangulations with applications
• On the optimal binary plane partition for sets of isothetic rectangles
• Optimal Point Location in a Monotone Subdivision
• Quasi-optimal range searching in spaces of finite VC-dimension
• Ray shooting, depth orders and hidden surface removal
• Realistic input models for geometric algorithms

Cited in

(6)

• Tight bounds for connecting sites across barriers
• Binary plane partitions for disjoint line segments
• Cuttings for disks and axis-aligned rectangles in three-space
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
• Tight bounds for connecting sites across barriers
• Spanning trees with low crossing number

This page was built for publication: Spanning trees crossing few barriers

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