Sciweavers

21 search results - page 3 / 5
» Integer representations of convex polygon intersection graph...
Sort
View
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 6 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
13 years 11 months ago
Geometric Reformulation of 3-Fingered Force-Closure Condition
— This paper addresses the problem of testing whether three contact points form a 3-fingered force-closure grasp in two dimensions. In particular, assuming frictional point cont...
Attawith Sudsang, Thanathorn Phoka
CCCG
2003
13 years 7 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
VISSOFT
2005
IEEE
13 years 11 months ago
Exploring Relations within Software Systems Using Treemap Enhanced Hierarchical Graphs
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existi...
Michael Balzer, Oliver Deussen
WG
2010
Springer
13 years 4 months ago
Graphs with Large Obstacle Numbers
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Padmini Mukkamala, János Pach, Deniz Sari&o...