Results 1  10
of
698,642
o r A Layout Algorithm for Bar;.Visibility Graphs on the Mobius Band
"... Abstract. We characterize two types of barvisibility graphs on the Mobius band (abbreviated "BVGMs"), in which vertices correspond to intervals that are parallel or orthogonal to the axis of the band, depen ding on type, and in which adjacency corresponds to orthogonal visibility of inter ..."
Abstract
 Add to MetaCart
Abstract. We characterize two types of barvisibility graphs on the Mobius band (abbreviated "BVGMs"), in which vertices correspond to intervals that are parallel or orthogonal to the axis of the band, depen ding on type, and in which adjacency corresponds to orthogonal visibility
Bar kVisibility Graphs
"... Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a onetoone correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G if and only if t ..."
Abstract
 Add to MetaCart
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a onetoone correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G if and only
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 628 (44 self)
 Add to MetaCart
graphs. These algorithms adopt a variety of representations (e.g., straightline, polyline, visibility), and update the drawing in a smooth way.
On the Minimum Size of Visibility Graphs
"... In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the barvisibility graph of n disjoint line segments in the plane, according to their vertexconnectivity. ..."
Abstract
 Add to MetaCart
In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the barvisibility graph of n disjoint line segments in the plane, according to their vertexconnectivity.
Automating the Design of Graphical Presentations of Relational Information
 ACM Transactions on Graphics
, 1986
"... The goal of the research described in this paper is to develop an applicationindependent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal: The codi ..."
Abstract

Cited by 559 (9 self)
 Add to MetaCart
The goal of the research described in this paper is to develop an applicationindependent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
with loops (undirected cycles). The algorithm is an exact inference algorithm for singly connected networks the beliefs converge to the cor rect marginals in a number of iterations equal to the diameter of the graph.1 However, as Pearl noted, the same algorithm will not give the correct beliefs for mul
Characterizations of 1,kbar visibility trees
 In preparation
, 2005
"... A unit barvisibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unitlength bars such that two vertices are adjacent if and only if there is a unobstructed, nondegenerate, vertical band of visibility between the corresponding bars. We generalize unit bar ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A unit barvisibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unitlength bars such that two vertices are adjacent if and only if there is a unobstructed, nondegenerate, vertical band of visibility between the corresponding bars. We generalize unit
Arc and circlevisibility graphs
 Australas. J. Combin
"... We study polar visibility graphs, graphs whose vertices can be represented by arcs of concentric circles with adjacency determined by radial visibility including visibility through the origin. These graphs are more general than the wellstudied barvisibility graphs and are characterized here, when ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study polar visibility graphs, graphs whose vertices can be represented by arcs of concentric circles with adjacency determined by radial visibility including visibility through the origin. These graphs are more general than the wellstudied barvisibility graphs and are characterized here, when
Bar kVisibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
"... Abstract. Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a onetoone correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G if and ..."
Abstract
 Add to MetaCart
Abstract. Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a onetoone correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G
Ownership Types for Flexible Alias Protection
 In ObjectOriented Programming, Systems, Languages, and Applications (OOPSLA
, 1998
"... Objectoriented programming languages allow interobject aliasing. Although necessary to construct linked data structures and networks of interacting objects, aliasing is problematic in that an aggregate object's state can change via an alias to one of its components, without the aggregate bein ..."
Abstract

Cited by 365 (41 self)
 Add to MetaCart
being aware of any aliasing. Ownership types form a static type system that indicates object ownership. This provides a flexible mechanism to limit the visibility of object references and restrict access paths to objects, thus controlling a system's dynamic topology. The type system is shown
Results 1  10
of
698,642