21 search results - page 1 / 5 » Computing straight skeletons of planar straight-line graphs ... |
94
Voted
CCCG
2010
15 years 2 months ago
2010
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
115
Voted
ALGORITHMICA
2006
15 years 18 days ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
110
Voted
GD
2007
Springer
15 years 6 months ago
2007
Springer
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
103
Voted
COMGEO
2008
ACM
15 years 3 days ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
93
Voted
CCCG
2007
15 years 2 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...