Sciweavers

79 search results - page 9 / 16
» Planarity of iterated line graphs
Sort
View
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
14 years 4 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...
VMV
2003
143views Visualization» more  VMV 2003»
13 years 11 months ago
Animating a Camera for Viewing a Planar Polygon
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
Daniel Brunstein, Gill Barequet, Craig Gotsman
CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 5 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
PAMI
2002
184views more  PAMI 2002»
13 years 9 months ago
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
Jianzhuang Liu, Yong Tsui Lee, Wai-kuen Cham
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy