Pointed and colored binary encompassing trees

DOI10.1145/1064092.1064107zbMath1387.68262OpenAlexW1993000250MaRDI QIDQ5370599

No author found.

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

zbMATH Keywords

spanning treeline segmentsbounded degreepseudo-triangulation

Mathematics Subject Classification ID

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

Related Items (4)

Augmenting the connectivity of geometric graphs ⋮ Pointed binary encompassing trees: simple and optimal ⋮ A vertex-face assignment for plane graphs ⋮ Planar bichromatic minimum spanning trees

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