The following pages link to Minimum polygonal separation (Q1101685):
Displaying 25 items.
- Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
- Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- On the complexity of polyhedral separability (Q1119020) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- Computational aspects of relaxation complexity (Q2061898) (← links)
- Geometric separability using orthogonal objects (Q2122791) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Starshaped sets (Q2216442) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES (Q4650094) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404) (← links)
- RED-BLUE SEPARABILITY PROBLEMS IN 3D (Q5311632) (← links)
- Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle (Q5357503) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- Separating objects in the plane by wedges and strips (Q5929324) (← links)
