The following pages link to Network farthest-point diagrams (Q2968103):
Displaying 6 items.
- Linear time algorithm for optimal feed-link placement (Q482338) (← links)
- Shortcut sets for plane Euclidean networks (extended abstract) (Q510569) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)