We introduce the visibility complex of a collection<inline-equation><f><sc>O</sc></f></inline-equation> of <?Pub Fmt italic>n<?Pub Fmt /italic> pairwisedisjoint convex objects in the plane. This 2-dimensiotnal cell complexmay be considered as a generalization of the tangent visibility graph of<inline-equation><f><sc>O</sc></f></inline-equation>. Its space complexity<?Pub Fmt italic>k<?Pub Fmt /italic> is proportional to the size of thetangent visibility graph. We give an <inline-equation><f>O<fen lp="par">n<rf>log</rf>n+k<rp post="par"></fen></f></inline-equation> 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 <inline-equation><f><sc>O</sc></f></inline-equation> in <inline-equation><f>O<fen lp="par">m<rf>log</rf>n<rp post="par"></fen></f></inline-equation> time, where<?Pub Fmt italic>m<?Pub Caret><?Pub Fmt /italic> is the size of theview. The view from a point is a generalization of the visibilitypolygon of that point with respect to <inline-equation><f><sc>O</sc></f></inline-equation>.
[1]
Joseph S. B. Mitchell,et al.
An Optimal Algorithm for Computing Visibility in the Plane
,
1991,
WADS.
[2]
Gert Vegter,et al.
The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning
,
1990,
Scandinavian Workshop on Algorithm Theory.
[3]
David M. Mount,et al.
An output sensitive algorithm for computing visibility graphs
,
1987,
28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4]
Leonidas J. Guibas,et al.
Visibility and intersection problems in plane geometry
,
1989,
Discret. Comput. Geom..
[5]
Gert Vegter,et al.
Dynamically Maintaining the Visibility Graph
,
1991,
WADS.
[6]
Emo WELZL,et al.
Constructing the Visibility Graph for n-Line Segments in O(n²) Time
,
1985,
Inf. Process. Lett..
[7]
Michel Pocciola,et al.
Graphics in Flatland Revisited
,
1990,
SWAT.