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
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
An optimal algorithm for intersecting line segments in the plane
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Lower bounds for algebraic computation trees with integer inputs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.04 |
In this paper, we study the separability in the plane by two criteria: double-wedge separability and @Q-separability. We give an O(NlogN)-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/@Q"0)logN)-time algorithm for computing a nearly straight minimal @Q-polygonal chain separating two sets of points, where @Q"0 is a value which depends on the position of the points.