Pages that link to "Item:Q674178"
From MaRDI portal
The following pages link to Separating collections of points in Euclidean spaces (Q674178):
Displaying 23 items.
- Separating and shattering long line segments (Q293158) (← links)
- Separating families of convex sets (Q364852) (← links)
- Separating pairs of points of standard boxes (Q1075327) (← links)
- On the complexity of polyhedral separability (Q1119020) (← links)
- Separation of points by families of intervals (Q1174602) (← links)
- Separable partitions (Q1283783) (← links)
- Separating sets in interpolation and geometry (Q1291165) (← links)
- Separation of a finite set in \(\mathbb{R}^ d\) by spanned hyperplanes (Q1311015) (← links)
- Separation of convex sets (Q1329792) (← links)
- Identification of points using disks (Q1618247) (← links)
- On separating points by lines (Q1985301) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Separation of two bounded point sets on the plane by a second order curve (Q2703336) (← links)
- On separating convex points with lines (Q2869414) (← links)
- Computing Plurality Points and Condorcet Points in Euclidean Space (Q2872133) (← links)
- Hyperplane separability and convexity of probabilistic point sets (Q2970475) (← links)
- Hyperplane separability and convexity of probabilistic point sets (Q3132872) (← links)
- HALVING BALLS BY A HYPERPLANE IN DETERMINISTIC LINEAR TIME (Q3387273) (← links)
- (Q4607941) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
