Spanning trees crossing few barriers

DOI10.1007/S00454-003-2853-5zbMATH Open1033.68078OpenAlexW2146448055WikidataQ56970639 ScholiaQ56970639MaRDI QIDQ1422228FDOQ1422228

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• 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

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)