Angular resolution (graph drawing)

In graph drawing, the angular resolution of a drawing of a graph refers to the sharpest angle formed by any two edges that meet at a common vertex of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Developing robust light transport simulation algorithms that are capable of dealing with arbitrary input scenes remains an… (More)
Is this relevant?
2009
2009
[1] Definitive exposures of pristine, ancient crust on Mars are rare, and the finding that much of the ancient Noachian terrain… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The derivation of the bidirectional reflectance distribution function (BRDF) from earth-surface features provides a more complete… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2005
2005
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present multi-agent A* (MAA*), the first complete and optimal heuristic search algorithm for solving decentralized… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
We present a novel way to draw planar graphs with good angular resolution. We introduce the polar coordinate representation and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Multiresolution signal and image models such as the hidden Markov tree (HMT) aim to capture the statistical structures of smooth… (More)
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A foreland basin system is defined as: (a) an elongate region of potential sediment accommodation that forms on continental crust… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
This paper is concerned with a game on graphs called graph searching. The object of this game is to clear all edges of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The problem of abduction can be characterized as nding the best explanation of a set of data. In this paper we focus on one type… (More)
Is this relevant?