Pages that link to "Item:Q4682203"
From MaRDI portal
The following pages link to COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203):
Displaying 8 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT (Q2875646) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- Separating objects in the plane by wedges and strips (Q5929324) (← links)
