Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Information and Computation
A convex hull algorithm for discs, and applications
Computational Geometry: Theory and Applications
Algorithms for weak and wide separation of sets
Discrete Applied Mathematics
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
Information Processing Letters
Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
SIAM Journal on Computing
Separating objects in the plane by wedges and strips
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms (TALG)
Kinetic red-blue minimum separating circle
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
| Hi-index | 0.00 |
In this paper, we study the separability in the plane by two criteria: double-wedge separability and Θ-separability. We give an O(N log N)-time optimal algorithm for computing all the vertices of separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and an O((N/Θ0)log N)-time algorithm for computing a nearly straight minimal Θ-polygonal chain separating two sets of points, where Θ0 is a value which depends on the position of the points.