Pointed and colored binary encompassing trees

Authors:
Michael Hoffmann;Csaba D. Tóth
Affiliations:
ETH Zürich, Switzerland;Massachusetts Institute of Technology, Cambridge, MA
Venue:
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Year:
2005

Citing 11
Cited 5

Simple alternating path problem

Discrete Mathematics
Growing a tree from its branches

Journal of Algorithms
On circumscribing polygons for line segments

Computational Geometry: Theory and Applications
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons

Proceedings of the eighteenth annual symposium on Computational geometry
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
On Paths in a Complete Bipartite Geometric Graph

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Tight degree bounds for pseudo-triangulations of points

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
A combinatorial approach to planar non-colliding robot arm motion planning

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Segment endpoint visibility graphs are Hamiltonian

Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Alternating paths through disjoint line segments

Information Processing Letters
Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations

Discrete & Computational Geometry

Augmenting the connectivity of geometric graphs

Computational Geometry: Theory and Applications
A vertex-face assignment for plane graphs

Computational Geometry: Theory and Applications
Compatible geometric matchings

Computational Geometry: Theory and Applications
Pointed binary encompassing trees: Simple and optimal

Computational Geometry: Theory and Applications
Planar bichromatic minimum spanning trees

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

For n disjoint line segments in the plane we construct in optimal O(n log n) time an encompassing tree of maximum degree three such that at every vertex all incident edges lie in a halfplane defined by the incident input segment. In particular, this implies that each vertex is pointed. Furthermore, we show that any set of colored disjoint line segments (for each segment one endpoint is colored red and the other endpoint is colored blue) has an encompassing tree of maximum degree three in which no edge is monochromatic.