Pointed binary encompassing trees: simple and optimal

DOI10.1016/J.COMGEO.2006.12.005MaRDI QIDQ733553zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

line segmentsgeometric graphspseudo-triangulations

Mathematics Subject Classification ID

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

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

Cites work

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