Last update: Sun Oct 15 02:32:55 MDT 2017
Top |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{VanLoon:1992:HCD,
author = "Erik {Van Loon} and C. W. A. M. {Van Overveld}",
title = "Hanging Cloths and Dangling Rods: a Unified Approach
to Constraints in Computer Animation",
journal = j-J-VIS-COMP-ANIMATION,
volume = "3",
number = "1",
pages = "45--59",
month = jan # "--" # mar,
year = "1992",
CODEN = "JVCAEO",
ISSN = "1049-8907 (print), 1099-1778 (electronic)",
ISSN-L = "1049-8907",
bibdate = "Tue Jun 3 08:05:21 MDT 1997",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/1992.bib.gz;
http://www.math.utah.edu/pub/tex/bib/jviscompanimation.bib;
telnet sigggraph.org: login biblio",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C6130B (Graphics
techniques); C6185 (Simulation techniques)",
corpsource = "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
Tech., Netherlands",
keywords = "computer animation; computer simulation; computer
simulations; constraint-types; constraints; digital
simulation; distributed computation; genetic
algorithms; mathematical merits; numerical methods;
over-constrained systems; real-valued parameters;
simple unified approach",
treatment = "P Practical",
xxauthor = "C. W. A. M. {Van Overveld} and E. {Van Loon}",
}
Related entries
- algorithm,
1(1)18,
1(1)22,
2(1)26,
2(3)92,
2(4)132,
3(2)129,
3(4)201,
4(1)51,
4(2)95,
4(4)199,
5(2)85,
5(3)129,
5(3)167,
6(3)129,
6(4)231,
7(3)125,
7(3)177,
7(4)193,
7(4)229,
8(1)3,
8(1)17,
8(3)165,
9(1)33,
9(4)229,
10(4)181,
12(3)117,
12(3)159,
12(5)277,
13(3)187,
14(4)169,
14(4)211
- approach,
1(1)18,
2(1)16,
3(4)219,
5(4)225,
6(2)91,
6(2)109,
6(3)129,
6(3)155,
8(2)69,
8(3)147,
9(4)215,
10(3)133,
10(4)225,
11(5)237,
12(1)31,
14(4)225
- C1180,
4(2)95,
5(2)85,
6(3)129,
6(3)143,
8(3)147
- C6185,
3(1)13,
4(1)13,
4(2)95,
4(2)113,
5(1)3,
5(1)17,
5(1)37,
5(1)55,
5(3)143,
5(4)265,
6(4)195,
6(4)231,
7(2)79
- cloth,
9(4)215,
12(1)23,
12(1)45
- computation,
3(1)31,
4(3)133,
5(3)129,
6(3)129,
6(3)143,
6(4)231,
7(3)169,
8(3)147,
14(2)73
- constraint,
2(3)82,
4(2)113,
4(3)153,
5(3)143,
6(3)143,
7(3)125,
8(1)33,
8(3)147,
14(1)31
- digital,
1(1)9,
1(1)18,
3(1)13,
3(3)183,
4(1)13,
4(2)79,
4(2)95,
4(2)113,
5(1)3,
5(1)17,
5(1)37,
5(1)55,
5(3)143,
5(4)265,
6(1)3,
6(2)71,
6(2)91,
6(3)143,
6(3)155,
6(3)173,
6(4)195,
6(4)231,
7(2)79,
7(3)177,
7(3)z,
7(4)193,
7(4)229,
8(2)97,
8(3)147,
11(4)169
- distributed,
1(2)49,
2(1)26
- genetic,
4(1)3,
5(2)85,
6(3)129
- mathematical,
6(3)143,
6(3)155,
7(3)149
- method,
1(1)2,
1(1)22,
2(1)34,
2(2)60,
2(4)118,
2(4)132,
3(1)13,
3(1)23,
4(1)33,
4(2)63,
4(2)95,
4(3)133,
4(4)187,
5(1)37,
5(2)85,
5(3)167,
5(4)225,
6(1)33,
6(1)49,
6(2)91,
6(3)143,
6(3)155,
6(3)173,
6(4)219,
7(1)3,
7(2)61,
7(2)79,
7(2)95,
7(2)111,
7(3)125,
7(4)229,
8(1)3,
8(1)33,
8(2)69,
8(2)97,
8(2)115,
9(4)195,
10(3)123,
11(5)249,
12(2)93,
13(1)21,
13(1)21-1,
13(1)65,
13(1)65-1,
13(4)211
- numerical,
4(1)33,
5(1)17
- optimisation,
4(2)95,
5(2)85,
6(3)129,
6(3)143,
8(3)147
- Overveld, C. W. A. M., Van,
4(4)233,
5(1)17,
8(1)3
- parameter,
1(1)26,
1(2)73,
2(4)129,
2(4)135,
3(1)1,
3(2)105,
5(2)69,
5(4)209,
5(4)247,
6(1)3,
6(2)109,
8(2)69,
8(2)81,
8(2)97
- simple,
1(1)18,
1(1)26,
5(1)17,
10(1)27
- simulation,
1(1)9,
1(1)18,
2(2)68,
2(3)114,
3(1)13,
3(3)147,
4(1)13,
4(1)51,
4(2)79,
4(2)95,
4(2)113,
4(3)133,
5(1)3,
5(1)17,
5(1)37,
5(1)55,
5(3)143,
5(4)225,
5(4)265,
6(1)3,
6(1)33,
6(2)71,
6(2)91,
6(3)129,
6(3)143,
6(3)155,
6(3)173,
6(4)195,
6(4)231,
7(2)79,
7(3)177,
7(4)229,
8(3)147,
9(4)185,
10(1)27,
11(4)197,
14(2)73
- system,
1(1)15,
1(1)26,
1(1)33,
1(2)66,
1(2)73,
2(1)16,
2(1)26,
2(1)34,
2(2)44,
2(2)60,
2(3)82,
2(3)106,
2(4)123,
2(4)129,
3(1)31,
3(3)175,
3(3)183,
4(1)13,
4(2)79,
4(2)95,
4(2)113,
4(3)165,
4(4)199,
4(4)233,
5(1)17,
5(1)55,
5(3)143,
5(4)209,
5(4)225,
5(4)247,
5(4)265,
5(4)z,
6(1)3,
6(3)143,
7(1)3,
7(1)25,
7(2)61,
7(2)111,
7(3)141,
7(3)159,
7(4)229,
8(3)165,
9(4)259,
11(1)39,
11(4)169,
12(3)145,
14(3)111,
14(5)243,
14(5)261
- Van Overveld, C. W. A. M.,
4(4)233,
5(1)17,
8(1)3