On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Information Sciences—Informatics and Computer Science: An International Journal
Randomized algorithms
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
On the area of overlap of translated polygons
Computer Vision and Image Understanding
Proceedings of the eighteenth annual symposium on Computational geometry
Maximizing a Voronoi Region: The Convex Case
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Guarding Galleries and Terrains
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Maximizing the overlap of two planar convex sets under rigid motions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A constant-factor approximation algorithm for optimal terrain guarding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing the overlap of two planar convex sets under rigid motions
Computational Geometry: Theory and Applications
Maximizing the guarded boundary of an Art Gallery is APX-complete
Computational Geometry: Theory and Applications
Shape Matching by Random Sampling
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Shape matching by random sampling
Theoretical Computer Science
| Hi-index | 0.00 |
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and near-linear time algorithm for finding the point that will have approximately the largest Voronoi region when added to an n-point set. We apply the same technique to find the translation that approximately maximizes the area of intersection of two polygonal regions in near-quadratic time.