• Keine Ergebnisse gefunden

Sketch-Driven Orthogonal Graph Drawing

N/A
N/A
Protected

Academic year: 2022

Aktie "Sketch-Driven Orthogonal Graph Drawing"

Copied!
11
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

½

¾

!"

" "#""

#" " "

" #" ## !

" $

#"" "

" " # " "#"

! "

# $

%

%%

& "!

%Æ %

!

%% '

() !%

%

&

*

% %

$

%

#%%! %

+"

, -./

%%0 * " -112./ $"

%-12/ -3/ %

$ ! %&"'()*+,)-)+)(,+-)

First publ. in: Proceedings of the 10th International Symposium on Graph Drawing (GD´02) (LNCS 2528), 2002, pp. 1-11

Konstanzer Online-Publikations-System (KOPS) URN: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-73474

URL: http://kops.ub.uni-konstanz.de/volltexte/2009/7347/

(2)

! " %

567!-28/ "

* % ,( )0

% , 07

"

%

Æ !

-29/

-1/%:71

7 9 % ! 7.

7;

" % <

! ,0 %:

-42;/

: # ,0 =

% = !

% =

#

%! ! $ * %"

! %

#

, 02 ,0

2.

3>

Æ

# ?>

>

Æ

+

%! ,0",0

,0%= ,0 ,0%

= ,0 #$"

! $" @

$" $"

(3)

#

= <C ?,0

! C

+ %!

+ %

18>

Æ

%= 18>

Æ

7-29/ #

$

>

Æ

18>

Æ

>

Æ

# ""

-4D 19/ * ,0"

,0 =

*%!!, 0 6%

: !"

" -19/>

Æ

-29/779

& $

%

%* $

%

%5-2>/

-1>;98/

,0 $ %

" %' "

* +% -12/

-A/ +%"

* +% "B

7 "" "

%

B

(4)

, 0

?,

0 %

" % #

+%

!

<

! %

!

! %,0

! , 0

""

'* ?,0

?

7

% @!$"

3>

Æ

3>

18>

Æ

@$" % #

% $"

"B "'

=

$"

"

*

": -29/

" #

= $""*

+% , 0

, 0

% =

,0? 2

1

! B

,0?

,0,0

(5)

,0?

, ,0 ,00

,

0 "

B -A/' "

%

$" +%

,0?

,0E

,0

E,,0,00

%

6%$" = %

$" ,0

$ #

"

%" ":-29/7

:%:

5":

" !

-19/ %!, 0

, 0

= %

%! :" %!"

" # : > = 3>

Æ

:

2 24>

Æ

' 27

0 0

1

. / "

- 0 ## #!0 # "

(6)

%! 9A> %!"

,0.

7 * : 3>

Æ

>

Æ

%: &

% '1 %

: " %!"

: %! &

>

Æ

$ C 2 '

%!" = ,0 ,0. # %!"

% ,0

%!" %

,0

2C+1 2C+1

2C+1 2C+1

2C+1

2C+1

2C+1

2C+1 2C+1

2C+1

0 # # 1 2 "

" "# ".

/ # /

/ #

#%$& #

& =

F2

= = %! =

= %

%!

¼

¼

%!"

%

,0" %!#"

%! # %!"

"

(7)

34 /

f

s (2,0) b

g f

s (2,0) b

g (2,0)

(1,w) (1,w) (2,0)

(1,2C)

3!4"/-!

5 2 # 6# !

# 3!4 #76#

"6 " !

,0 = &,0>

,0 *& ,0 >

,0 * #

%,0 %!"

%! =

,0? ,0.

,0

'9,0

= '

% '9,0 # 2

B %

* %

# E@=

%!" '

!'9,0 %!"

= *

!

" % =

! %

!

,0E

,0? ,0.?

,0 % $"

:

% $"&"

":

(8)

D ,0"

%!" : ,0 %

,,00?> ,,00 ?> "

C,

0

, 0

?

,,00E,,00

?

,,00E,,00

# %< %

* # EC

%

,0E

,E0?,

E

0E,

0?,

0E,

0

C1 -29/ Æ "B

" "%

' ,

0

Æ "

+ B

%$

%

'.!

= %

% %"

! %

#!% G%

'-1./ ' ; !

-28/& "

":

%

(9)

! " " 8)9:

# % = H

% #!

% 'A @ %

(I) % % %!"

% =! !

"B*

SchName

Schema

SCH_RELS

Relation RelName

d

VIEW_RELATION BASE_RELATION

Query

VIEW_ATTRS

VIEW_ATTRIBUTE AttrName

AttrNum Indexes RefRel KEYS

FKEY KEY

KeyNo

DEFINES

INDEX INDEX_ATTRS

IndexType IndexName

ATTRIBUTE REL_ATTRS

KEY_ATTRS AttrName DataType

SchName

Schema

SCH_RELS Relation

RelName

d

VIEW_RELATION BASE_RELATION

Query

VIEW_ATTRS

VIEW_ATTRIBUTE AttrName

AttrNum Indexes RefRel KEYS

FKEY KEY

KeyNo

DEFINES

INDEX INDEX_ATTRS

IndexType IndexName

ATTRIBUTE

REL_ATTRS

KEY_ATTRS AttrName

DataType

;<" 8)(*99:4 "

!

@

% %%

%

% #

$

%

(10)

% % 7 '8

;"

& =

+ %

%

#% "

& -22/

% J%

% "

%

) ' $

)=== ! """# $$

( ' ".'" " $

& #">=9"?6)@*@A(@BC(D9)==9

@ ' " "!"##!"

$ ." >=+"?6)*@@A+=C=+)==+

D E ' " #"

"?6 (F(*A((+C(DB (FF)

* '" E % .&" < ? G

A . " " " #" $ &

#">=9"?6)@*@A@F@C@F+)==9

B '"< H " "

#" " D3@4AD9C9D

(FFF

9 5 & E E % @-

" " #"

*3(4A)C@*(FF)

+ & '$;<&

$I)===

= I 6 $; " #" $

(11)

" !"#(DC@@)==)

)) 5;""5% J " #"#

G $!$ & #">F)"?6((B*A)(DC)@+

(FF(

)( <;6 $ % & . -

@(FFF

)@ % K5 #""""# #!-

! $ & #">=*"?6)F(9A(*DC(BB )==B

)D E" # #" -""J"$ & #-

">=*"?6)F(9A@@@C@@B)==B

)* 5 "

"?6 (F(*(FF)

)B &$5L- " #" "<=+-)-

F)@ 5/-$- ! )==+

)9 ?. !" &"!""-

! $ & #">F) "?6((B*ADB*CDBB (FF(

)+ 5 & !1 #"" '(((

!")9DC+9)==(

)= M 5 N $; ?" **

&+ ' & , 9BC++)==@

(F . $ & " "#"

$ & #">=*"?6)F(9AD)=CD@F )==B

() & $ !# #"

$ & #">=+ "?6)*D9A@=DCDF()==+

(( < E 5 ! . #" "

$ & #">=B"?6))=FA@+9C@=D )==9

(@ < J!" " "# !

! &' )B3@4AD()CDDD)=+9

(D < 5;""5 2A G

" $ & #">F)"?6((B*AD*@CD*D(FF(

Referenzen

ÄHNLICHE DOKUMENTE

Given is a graph G = (V, E, ω) with nonnegative weights, without self-loops and the Laplace matrix L(G). The assertion is the upper gershgorin bound of N.. GRAPH RELATED MATRICES

With shortest-path distances as input, classical multidimen- sional scaling can be regarded as a spectral graph drawing algorithm, and recent approximation techniques make it scale

ADM 36 Video Display Terminal Maintenance Manual Drawing .Package.. LEAR SIEGLER,

The shift method is a linear-time algorithm to pro- duce a straight-line drawing of maximally triconnected, that is, triangulated graphs on a grid with an area bound quadratic in

A conclusion from a more recent experimental study on distance-based graph drawing from Brandes and Pich (2008) is that, given a goal to represent distances well in a graph,

3.3 we describe how to test whether a tree has a straight line drawing that satisfies both angle and distance constraints and show how using polylines and curves for the edges makes

Approaches to dynamic graph drawing most often augment a layout algorithm designed for static graphs in such a way that the resulting sequence of layouts is more stable than if

Because of the links an edge in the variable path is horizontal in a valid orthogonal drawing if an edge corresponding to the same variable is drawn horizontally in a