The following pages link to Separability of imprecise points (Q2362104):
Displaying 5 items.
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Preclustering algorithms for imprecise points (Q2144264) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms (Q6090986) (← links)
