Theory of Combinatorial Algorithms

advertisement
Search ethz.ch
Search Person
Department of Computer Science | Institute of Theoretical Computer Science
Theory of Combinatorial Algorithms
Prof. Emo Welzl

People
o
o
o





Personnel
Guests
Alumni
Reports
o Current Report
o Report for 2015
o Report for 2014
o Report for 2013
o Previous Reports (for 2012 and before)
Research
o Grants
o Dissertations
o Master/Bachelor Theses
o Publications 2016
o Publications up to 2015
Mittagsseminar
Teaching
o Courses
o Theses + Topics
Events
o Workshops
 Current
 Previous
o Social Activities
 SOLA
 GREDA
 GRAPE

Џ ࡱ က >
*
,
) 쥁 #`
ࡱ
bjbj
.
ÿ ÿ
P
P
P
P
\
@
_
_
_
‫ۀ‬
x
_
_
_
_
_
咀
_
R R R R R R $ ࡱࡱh
_
^
l 咀
Eրǁ P
{
_
_
_
_
0 @
咀 咀 y
_
ʖ 9
_
_
@ ʖ
@
_
ʖ
_
_
0 _
_
_
_
D
P
P
$ ‫܃‬
ࡱ
GCMB'07 16 May 07 Linkages worksheet Definitions: A strut is a fixed length bar A linkage
is: 2d: planar linkages 1. Consider a triangle ABC with A=(0,0), B=(3,0), and lengths AB=3,
BC=4, and CA=5. Where can point C be? (What are the coordinates of C?) 2. Consider a
quadrilateral ABCD with A=(0,0), B=(3,0), and lengths AB=3, BC=4, CD=5, and DA =6. Where
can point C be? 3. How many numbers (degrees of freedom) are needed to specify where in the
plane is a point? ___ two points? ___ three points? ____ a strut? ___ a triangle? ___ two struts
joining three points? ___ 4. Make a few linkages that are rigid in the plane.
Is there a pattern of their number of vertices and edges? 3d: space linkages Consider a triangle
ABC with A=(0,0), B=(3,0), and lengths AB=3, BC=4, and CA =5. Where can point C be? 2.
Consider a quadrilateral ABCD with A=(0,0), B=(3,0), and lengths AB=3, BC=4, CD=5, and
DA =6. Where can point C be? 3. How many numbers (degrees of freedom) are needed to
specify where in space is a point? ___ three points? ___ four points? ____ a strut? ___ a triangle?
___ a tetrahedron? ___ 4. Make a few linkages that are rigid in space. Is there a pattern of their
number of vertices and edges?
'
8
=
y
^_hmtu{
~Ί ъ Պ ;
J
L
O
S
‫ڋ‬
ࡱՀոոոոՑՑՑՑՑՑ‫ٸ‬
h݀
h즩ࡱࡱࡱh֝ࡱࡱh֝ࡱ6ࡱࡱࡱh֝ࡱࡱh~ࡱࡱ5ࡱࡱࡱh֝ࡱࡱh֝ 5
ࡱh֝ ࡱh֝ࡱࡱࡱh֝
h{EK
'
(
6
T
b
c
d
e
y
ࡱࡱ ࡱࡱ ࡱࡱ
퀀 퀀 퀀 퀀 퀀 퀀 퀀 퀀 耀 耀 耀 耀 耀 耀 耀 耀 耀
耀 耀 耀 耀 耀 耀
gd즩
ࡱࡱ$ࡱa$ࡱgd֝
ࡱࡱ$ࡱa$ࡱgd֝
≀ ㉀
\]^_ъ Ҋ ӊ Պ 芀 Q
R
S
T
U
V
W
ы ҋ Ӌ ԋ Ջ ࡱ
ꀀ ꀀ ꀀ ꀀ ꀀ ꀀ ꀀ ꀀ ꀀ ꀀ ꀀ ꀀࡱࡱࡱgd֝ ࡱࡱࡱЂ`Ђgd֝
gd즩
ࡱ ࡱ (
)
[
\
Ō
ࡱ ࡱ
ࡱࡱࡱࡱࡱࡱЂ`Ђgd֝ࡱࡱࡱgd֝
, 1h Я ཡ
"
# $ %
Ђ Ђ
Ђ
@ @ࡱ@
N o r m a l
CJ
_H
aJ
mH
sH
tH
D A ࡱD
D e f a u l t
P a r a g r a p h
F o n t R i ࡱR
T a b l e
( k ࡱࡱ(
z Ԃ
N o r m a l
ࡱࡱ4ֆ
l 4ֆ
N o L i s t
' ( 6 T b c d e y
aࡱࡱ
z
⁀ ࡱ
\
]
^
_
т ҂ Ղ 肀
W
уࡱ҃ Ӄ ԃ Ճ փ ‫( ׃‬
)
[
\
ń
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
' ( 6 T b c d e y
Q
R
S
T
!
U
V
!
⁀ ࡱ
T
U
V
W
уࡱ҃
ń
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 @ 0 0 0 0 0 0 0 0
0 0 0 0 0 @ 0 0 @ 0 0 @ 0
Q
R
S
Ӄ
0
0
0
ԃ
0
0
0
\
]
Ճ փ ‫׃‬
0 @ 0
0 0 0
0 0 0
^
_
т ҂ ӂ Ղ 肀
(
)
[
\
@ 0 0 0 0 0 0 0 @ 0
0 0 0 0 0 0 0 0 0 0 0
ࡱ
ࡱ
ࡱ
ࡱ
ࡱ
𨀀
ࡱ
@ -ࡱ ࡱࡱ
¢ࡱ
ࡱ
¢
ࡱࡱ
¢ࡱ
S
ࡱ
ˁ
ࡱࡱ
m
?
%
~
•
:
:
;
U
2
7
:
( Ղ 肀
ࡱࡱ
:
:
)
:
:
*
:
7
:
I
M
:
]
:
ࡱ 䁀
^
l
:
:
:
:
V
z
倀ࡱࡱࡱ֝ {EK 즩 뇾 ~
݀@
P=F
P
@
U n k n o w n
G
z
T i m e s N e w
R o m a n 5
S y m b o l 3
z
A r i a l "
1
ࡱ h
f
f
A
A
\
ࡱ
24
3
ࡱ
HP )ࡱ
? 䄀
ࡱࡱࡱࡱࡱࡱࡱࡱ֝ 2
C O M P 6 d J a c k S n o e y i n k
J a c k
S n o e y i n k
şࡱࡱࡱࡱ+'ٰࡱࡱࡱࡱࡱࡱࡱࡱࡱࡱࡱࡱࡱࡱࡱ̀
‫؀‬
䀀
H
T
`
h
Snoeyink -
p
-
x
-
䄀 -
COMP 6d -
-
Jack
Normal.dot Jack Snoeyink Word @ ^в @ lՀǁ@ lՀǁ
2 A
Microsoft Office
Ս՜.
+,0 ࡱࡱ
h
p
|
Ѐ
-
䄀 -
COMP 6d
ğ
-
Title
E n t r y
" # $ % ' ( + R o o t
F Фmրǁ- 1 T a b l e
ʖ W o r d D o c u m e n t
r m a t i o n (
I n f o r m a t i o n 8
F Microsoft Office Word Document
Imprint Disclaimer Copyright
.
S u m m a r y I n f o
D o c u m e n t S u m m a r y
!
C o m p O b j
q
MSWordDoc
Word.Document.8 ࡱࡱ
Download