Separating bichromatic point sets in the plane by restricted orientation convex hulls
From MaRDI portal
Publication:2694525
DOI10.1007/S10898-022-01238-9OpenAlexW4303982821MaRDI QIDQ2694525
Carlos Seara, Jorge Urrutia, Carlos Alegría, David Orden
Publication date: 3 April 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.04258
optimizationlower boundsinclusion detectionbichromatic separabilityrestricted orientation convex hulls
Related Items (2)
The rectilinear convex hull of line segments ⋮ Rectilinear convex hull of points in 3D and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the error of linear separators on linearly inseparable data
- Fitting a two-joint orthogonal chain to a point set
- Reconstructing orthogonal polyhedra from putative vertex sets
- Algorithms for weak and wide separation of sets
- On the definition and computation of rectilinear convex hulls
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- Separating bichromatic point sets by L-shapes
- Computing \(D\)-convex hulls in the plane
- On the X-Y convex hull of a set of X-Y polygons
- Computing circular separability
- Minimum polygonal separation
- Misclassification minimization
- Pattern classification by linear goal programming and its extensions
- Restricted-orientation convexity.
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Separability by two lines and by nearly straight polygonal chains
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- Optimizing generalized kernels of polygons
- Variations of largest rectangle recognition amidst a bichromatic point set
- Separability of imprecise points
- Construction of 3D Orthogonal Convex Hull of a Digital Object
- Efficient algorithms for bichromatic separability
- Bichromatic separability with two boxes: A general approach
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
- Illumination of Orthogonal Polygons with Orthogonal Floodlights
- Preprocessing Steiner problems from VLSI layout
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
- RED-BLUE SEPARABILITY PROBLEMS IN 3D
- Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle
- Separating objects in the plane by wedges and strips
- Circular separability of polygons
This page was built for publication: Separating bichromatic point sets in the plane by restricted orientation convex hulls
