Pointed and colored binary encompassing trees

DOI10.1145/1064092.1064107zbMATH Open1387.68262OpenAlexW1993000250MaRDI QIDQ5370599FDOQ5370599

Author name not available (Why is that?)

Publication date: 20 October 2017

Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1064092.1064107

Recommendations

• Pointed binary encompassing trees: simple and optimal
• Algorithm Theory - SWAT 2004
• Every set of disjoint line segments admits a binary tree
• Growing a Tree from Its Branches
• scientific article; zbMATH DE number 1555917

zbMATH Keywords

line segmentsspanning treebounded degreepseudo-triangulation

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Planar bichromatic minimum spanning trees
• Growing a Tree from Its Branches
• Pointed binary encompassing trees: simple and optimal
• Algorithm Theory - SWAT 2004
• Title not available (Why is that?)
• Augmenting the connectivity of geometric graphs
• Pointed Brauer trees
• A vertex-face assignment for plane graphs

This page was built for publication: Pointed and colored binary encompassing trees

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