Separability by two lines and by nearly straight polygonal chains

DOI10.1016/J.DAM.2003.11.014zbMath1057.68121OpenAlexW2112823227MaRDI QIDQ1885815

Carlos Seara, Mercè Mora, Pedro A. Ramos, Ferran Hurtado

Publication date: 12 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.014

zbMATH Keywords

algorithmspattern recognitionpolygonal chaindouble wedgegeographic information systemsred-blue separation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Descriptive geometry (51N05)

Related Items (7)

SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS ⋮ RED-BLUE SEPARABILITY PROBLEMS IN 3D ⋮ Dynamic minimum bichromatic separating circle ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES ⋮ SEPARATING POINTS BY AXIS-PARALLEL LINES ⋮ On the Parameterized Complexity of Red-Blue Points Separation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
• Algorithms for weak and wide separation of sets
• Minimum polygonal separation
• A convex hull algorithm for discs, and applications
• Algorithms for Reporting and Counting Geometric Intersections
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
• An optimal algorithm for intersecting line segments in the plane
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• Separating objects in the plane by wedges and strips

This page was built for publication: Separability by two lines and by nearly straight polygonal chains