Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Graphics in Flatland revisited
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
The visibility diagram: a data structure for visibility problems and motion planning
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Topologically sweeping the visibility complex of polygonal scenes
Proceedings of the eleventh annual symposium on Computational geometry
The visibility complex made visibly simple: an introduction to 2D structures of visibility
Proceedings of the eleventh annual symposium on Computational geometry
Pseudo-triangulations: theory and applications
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Dynamic visibility in polygonal scenes with the visibility complex
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
3D visibility made visibly simple: an introduction to the visibility skeleton
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Determining an optimal penetration among weighted regions in two and three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
ACM Transactions on Graphics (TOG)
Exact from-region visibility culling
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
ACM SIGGRAPH Asia 2009 papers
On the computation of 3D visibility skeletons
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Exact workspace boundary by extremal reaches
Proceedings of the twenty-seventh annual symposium on Computational geometry
The stochastic walk algorithms for point location in pseudo-triangulations
Advances in Engineering Software
Approximating functions on a mesh with restricted Voronoï diagrams
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
We introduce the visibility complex of a collectionO of n pairwisedisjoint convex objects in the plane. This 2-dimensiotnal cell complexmay be considered as a generalization of the tangent visibility graph ofO. Its space complexityk is proportional to the size of thetangent visibility graph. We give an Onlogn+k algorithm for its construction. Furthermore we showhow the visibility complex can be used to compute the view from a pointor a convex object with respect to O in Omlogn time, wherem is the size of theview. The view from a point is a generalization of the visibilitypolygon of that point with respect to O.