AN OUTPUT-SENSITIVE ALGORITHM FOR COMPUTING VISIBILITY GRAPHS

被引：139

作者：

GHOSH, SK

MOUNT, DM

机构：

[1] TATA INST FUNDAMENTAL RES,COMP SCI GRP,BOMBAY 400005,INDIA

[2] UNIV MARYLAND,INST ADV COMP STUDIES,COLLEGE PK,MD 20742

[3] UNIV MARYLAND,DEPT COMP SCI,COLLEGE PK,MD 20742

来源：

SIAM JOURNAL ON COMPUTING | 1991年 / 20卷 / 05期

关键词：

VISIBILITY GRAPH; OUTPUT-SENSITIVE ALGORITHMS; SHORTEST PATHS;

D O I：

10.1137/0220055

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertex set consists of the vertices of the obstacles and whose edges are pairs of vertices (u, upsilon) such that the open line segment between u and upsilon does not intersect any of the obstacles. The visibility graph is an important combinatorial structure in computational geometry and is used in applications such as solving visibility problems and computing shortest paths. This paper presents an algorithm that computes the visibility graph of a set of obstacles in time O(E + n log n), where E is the number of edges in the visibility graph and n is the total number of vertices in all the obstacles.

引用

页码：888 / 910

页数：23

共 16 条

[1] Visibility of Disjoint Polygons [J].