Pointed binary encompassing trees: simple and optimal

DOI10.1016/J.COMGEO.2006.12.005zbMATH Open1200.05147OpenAlexW1972830235WikidataQ59782321 ScholiaQ59782321MaRDI QIDQ733553FDOQ733553

Authors: D. Kharzeev 

Publication date: 16 October 2009

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

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

Recommendations

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

zbMATH Keywords

line segmentsgeometric graphspseudo-triangulations

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Triangulations without pointed spanning trees
• Acute triangulations of polygons
• Generalized Delaunay triangulation for planar graphs
• Topologically sweeping visibility complexes via pseudotriangulations
• Ray shooting in polygons using geodesic triangulations
• Tight degree bounds for pseudo-triangulations of points
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Segment endpoint visibility graphs are Hamiltonian
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• Computing simple circuits from a set of line segments
• Minimal tangent visibility graphs
• Encompassing colored planar straight line graphs
• A vertex-face assignment for plane graphs
• Every set of disjoint line segments admits a binary tree
• Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
• Growing a Tree from Its Branches
• Pointed and colored binary encompassing trees

Cited In (9)

• Bichromatic compatible matchings
• Compatible spanning trees
• Growing a Tree from Its Branches
• Pointed and colored binary encompassing trees
• Vertex-colored encompassing graphs
• Disjoint compatible geometric matchings
• Algorithm Theory - SWAT 2004
• Title not available (Why is that?)
• Discrete geometry on colored point sets in the plane -- a survey

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

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