The following pages link to Characterizing proximity trees (Q1920422):
Displaying 17 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- The strength of weak proximity (Q849629) (← links)
- Empty region graphs (Q1000919) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- On embedding an outer-planar graph in a point set (Q1862133) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Approximate proximity drawings (Q1947972) (← links)
- The approximate rectangle of influence drawability problem (Q2354030) (← links)
- Approximate Proximity Drawings (Q3223952) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Computing proximity drawings of trees in the 3-dimensional space (Q5057437) (← links)
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time (Q5452155) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)
