Maximizing maximal angles for plane straight-line graphs

DOI10.1016/j.comgeo.2012.03.002zbMath1251.05148OpenAlexW2112393314WikidataQ59782271 ScholiaQ59782271MaRDI QIDQ714898

D. Kharzeev

Publication date: 12 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.03.002

zbMATH Keywords

triangulationpathmaximal angleplane geometric graphpointed plane graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

A 4-approximation of the \(\frac{2\pi }{3} \)-MST ⋮ Bounded-angle spanning tree: modeling networks with angular constraints ⋮ Bounded-angle minimum spanning trees ⋮ A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST

This page was built for publication: Maximizing maximal angles for plane straight-line graphs