Pointed binary encompassing trees: simple and optimal
From MaRDI portal
Publication:733553
DOI10.1016/j.comgeo.2006.12.005zbMath1200.05147OpenAlexW1972830235WikidataQ59782321 ScholiaQ59782321MaRDI QIDQ733553
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Discrete geometry on colored point sets in the plane -- a survey ⋮ Disjoint compatible geometric matchings ⋮ Compatible spanning trees ⋮ Vertex-colored encompassing graphs ⋮ Bichromatic compatible matchings
Cites Work
- Computing simple circuits from a set of line segments
- A vertex-face assignment for plane graphs
- Generalized Delaunay triangulation for planar graphs
- Ray shooting in polygons using geodesic triangulations
- Segment endpoint visibility graphs are Hamiltonian
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- Topologically sweeping visibility complexes via pseudotriangulations
- Tight degree bounds for pseudo-triangulations of points
- Minimal tangent visibility graphs
- Encompassing colored planar straight line graphs
- Triangulations without pointed spanning trees
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- Growing a Tree from Its Branches
- Pointed and colored binary encompassing trees
- Acute triangulations of polygons
- Every set of disjoint line segments admits a binary tree
