Visibility of disjoint polygons
Algorithmica
Worst-case optimal algorithms for constructing visibility polygons with holes
SCG '86 Proceedings of the second annual symposium on Computational geometry
Space searching for intersecting objects
Journal of Algorithms
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Computing the full visibility graph of a set of line segments
Information Processing Letters
Good splitters for counting points in triangles
Journal of Algorithms
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
An output sensitive algorithm for computing visibility graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a segment connecting two points of s and t without intersecting edges of the scene. In planar polygonal scenes, this problem is 3SUM-hard and its time complexity is Ω(n2) where n is the complexity of the scene. This problem can be defined in the same manner when s and t are any kind of objects in the plane. In this paper we consider this problem when s and t can be points, segments or convex polygons. We preprocess the scene so that for any given pair of query objects we can solve the problem efficiently. In our presented method, we preprocess the scene in O(n2+(Ɛ) time to build data structures of O(n2) total size by which the queries can be answered in O(n1+Ɛ) time. Our method is based on the extended visibility graph [1] and a range searching data structure presented by Chazelle et al. [2].