# Visibility graph

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- 2012

We propose a method to measure real-valued time series irreversibility which combines two different tools: the horizontalâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007

A human observer can effortlessly identify visible portions of geometric objects present in the environment. Howeverâ€¦Â (More)

Is this relevant?

2004

2004

- IEEE/RSJ International Conference on Intelligentâ€¦
- 2004

In this paper, we propose a fast dynamic visibility graph (DVG) for constructing a reduced roadmap among convex polygonalâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- 2000

An isovist, or viewshed, is the area in a spatial environment directly visible from a location within the space. Here we show howâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Discrete & Computational Geometry
- 1996

This paper describes a new algorithm for constructing the set of free bitangents of a collection ofn disjoint convex obstacles ofâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Symposium on Computational Geometry
- 1993

We introduce the visibility complex of a collection<inline-equation><f><sc>O</sc></f></inline-equation> of <?Pub Fmt italic>nâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Symposium on Computational Geometry
- 1988

Let <italic>S</italic> be a set of <italic>n</italic> non-intersecting line segments in the plane. The visibility graph <italic>Gâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- FOCS
- 1987

The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertex setâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Algorithmica
- 1986

Consider a collection of disjoint polygons in the plane containing a total ofn edges. We show how to build, inO(n 2) time andâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Inf. Process. Lett.
- 1985

Given a set S of line segments in the plane, its visibility graph G s is the undirected graph which has the endpoints of the lineâ€¦Â (More)

Is this relevant?