The following pages link to Minimal tangent visibility graphs (Q1924714):
Displaying 12 items.
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- On the minimum size of visibility graphs (Q1603508) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK (Q3016229) (← links)
