Sciweavers

339 search results - page 15 / 68
» Geometry of Graphs
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
On the maximum number of edges in topological graphs with no four pairwise crossing edges
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
Eyal Ackerman
CGA
2006
13 years 7 months ago
From Linear Story Generation to Branching Story Graphs
Interactive narrative systems are storytelling systems in which the user can influence the content or ordering of story world events. Conceptually, an interactive narrative can be...
Mark O. Riedl, R. Michael Young
SDM
2009
SIAM
104views Data Mining» more  SDM 2009»
14 years 4 months ago
On Randomness Measures for Social Networks.
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
Xiaowei Ying, Xintao Wu
SIAMDM
2008
90views more  SIAMDM 2008»
13 years 7 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen
COMPGEOM
2004
ACM
14 years 1 months ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...