Pages that link to "Item:Q975487"
From MaRDI portal
The following pages link to Fast computation of smallest enclosing circle with center on a query line segment (Q975487):
Displaying 7 items.
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Constrained minimum enclosing circle with center on a query line segment (Q924081) (← links)
- Largest empty circle centered on a query line (Q972354) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- Constrained Minimum Enclosing Circle with Center on a Query Line Segment (Q5756677) (← links)