Separating objects in the plane by wedges and strips

DOI10.1016/S0166-218X(00)00230-4zbMath0967.68160MaRDI QIDQ5929324

Marc Noy, Ferran Hurtado, Pedro A. Ramos, Carlos Seara

Publication date: 4 April 2001

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

zbMATH Keywords

strip separabilitywedge separability

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Separability of imprecise points, Separability by two lines and by nearly straight polygonal chains, SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS, Plane bichromatic trees of low degree, RED-BLUE SEPARABILITY PROBLEMS IN 3D, Dynamic minimum bichromatic separating circle, Separating bichromatic point sets by L-shapes, Minimizing the error of linear separators on linearly inseparable data, Separating bichromatic point sets in the plane by restricted orientation convex hulls, SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS, SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES, Stabbers of line segments in the plane, Proximity problems on line segments spanned by points, Polygonal chain approximation: A query based approach, SEPARATING POINTS BY AXIS-PARALLEL LINES, On the shortest separating cycle, Planar bichromatic minimum spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
• Computing circular separability
• Minimum polygonal separation
• A convex hull algorithm for discs, and applications
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• Circular permutation graphs