Computational geometry: an introduction
Computational geometry: an introduction
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
On k-hulls and related problems
SIAM Journal on Computing
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Arrangements of curves in the plane—topology, combinatorics, and algorithms
Theoretical Computer Science
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Computational geometry in C
On the complexity of the union of fat objects in the plane
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
SIAM Journal on Computing
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
ICCSA '08 Proceedings of the 2008 International Conference on Computational Sciences and Its Applications
Some problems related to good illumination
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
On the shape of a set of points in the plane
IEEE Transactions on Information Theory
On the convex layers of a planar set
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We are given a finite set of n points (guards) G in the plane R^2 and an angle 0==@p2. In case @Q is bounded from below by a positive constant, we prove an almost linear bound O(n^1^+^@e) for any @e0 on the complexity. Moreover, we show that there is a sequence of inputs such that the asymptotic bound on the complexity of their @Q-region is @W(n^2).