├── LICENSE
├── NetCreator.pyp
├── README.md
└── res
├── c4d_symbols.h
├── description
├── Onetcreator.h
└── Onetcreator.res
├── icon.png
└── strings_us
└── description
└── Onetcreator.str
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/NetCreator.pyp:
--------------------------------------------------------------------------------
1 | import c4d
2 | import timeit
3 | from c4d.modules import mograph as mo
4 | from c4d.bitmaps import BaseBitmap as bmp
5 | import random
6 | import math
7 | import sys
8 | import os
9 |
10 | PLUGIN_ID = 1037040
11 |
12 | NETCREATOR_MODE = 1000
13 | NETCREATOR_MODE_A = 1001
14 | NETCREATOR_MODE_B = 1002
15 | NETCREATOR_OBJECTA = 1003
16 | NETCREATOR_VERTEXMAPA = 1004
17 | NETCREATOR_OBJECTB = 1005
18 | NETCREATOR_VERTEXMAPB = 1006
19 |
20 | ID_DISTANCE = 2000
21 | NETCREATOR_SPACE = 2001
22 | NETCREATOR_SPACE_LOCAL = 2002
23 | NETCREATOR_SPACE_GLOBAL = 2003
24 | NETCREATOR_MINDISTANCE = 2004
25 | NETCREATOR_MAXDISTANCE = 2005
26 | NETCREATOR_VISIBILITY = 2006
27 | NETCREATOR_SEED = 2007
28 |
29 | ID_PROPAGATION = 3000
30 | NETCREATOR_PROPAGATION_ENABLE = 3001
31 | NETCREATOR_PROPAGATION_SPEED = 3002
32 | NETCREATOR_PROPAGATION_TURBULENCE = 3003
33 | NETCREATOR_PROPAGATION_STRENGTH = 3004
34 | NETCREATOR_PROPAGATION_SIZE = 3005
35 |
36 | NETCREATOR_DEBUG_FLAG = 0
37 |
38 | print 'NetCreator v1.2'
39 |
40 | def debug(output):
41 | if NETCREATOR_DEBUG_FLAG:
42 | print output
43 |
44 |
45 | # verify if a vmap belong to a obj
46 | def verifyVertexMap(obj, vmap):
47 | if not vmap or vmap.GetObject() != obj:
48 | return False
49 | return True
50 |
51 | # convert local pos to global pos for p_list
52 | def localSpaceToGlobalSpace(obj, p_list):
53 | # get the transformation matrix
54 | trans_matrix = obj.GetMg()
55 | shift_list = []
56 |
57 | # transfer matrix for p_list
58 | for p in p_list:
59 | shift_list.append(trans_matrix * p)
60 |
61 | return shift_list
62 |
63 | # get p_list from polygon object
64 | def getPolyList(obj, vmap):
65 | d_obj = obj.GetDeformCache()
66 | if not d_obj:
67 | p_list = obj.GetAllPoints()
68 | else:
69 | p_list = d_obj.GetAllPoints()
70 |
71 | # filter p_list if there is legal vertex map
72 | if verifyVertexMap(obj, vmap):
73 | v_list = vmap.GetAllHighlevelData()
74 | p_list = listFilter(p_list, v_list)
75 |
76 | return p_list
77 |
78 | # get p_list from thinking particles
79 | def getTPList(tp_group):
80 | tp_list = []
81 |
82 | doc = tp_group.GetDocument()
83 | TP = doc.GetParticleSystem()
84 |
85 | for i in tp_group.GetParticles():
86 | tp_list.append(TP.Position(i))
87 |
88 | return tp_list
89 |
90 | # get p_list from MoGraph object
91 | def getMDList(MoObj):
92 | modata = mo.GeGetMoData(MoObj)
93 | mo_matrix = modata.GetArray(c4d.MODATA_MATRIX)
94 | mo_flags = modata.GetArray(c4d.MODATA_FLAGS)
95 | p_count = len(mo_matrix)
96 |
97 | # invisible filter list
98 | mo_visible = []
99 | for i in xrange(p_count):
100 | mo_visible.append(mo_flags[i] & c4d.MOGENFLAG_CLONE_ON)
101 |
102 | # filter invisible elements
103 | mo_matrix = listFilter(mo_matrix, mo_visible)
104 |
105 | p_list = []
106 | for i in mo_matrix:
107 | p_list.append(i.off)
108 |
109 | return p_list
110 |
111 | # check if obj type is legal
112 | def checkObj(obj):
113 | if (obj.GetType() == c4d.Opolygon or
114 | obj.GetType() == 1001381 or
115 | obj.GetType() == 1018544 or
116 | obj.GetType() == 1018545 or
117 | obj.GetType() == 1018791 or
118 | obj.GetType() == 1019268):
119 |
120 | return True
121 | return False
122 |
123 | # get p_list accroding to different obj types
124 | def getPList(obj, vmap):
125 | if obj.GetType() == c4d.Opolygon:
126 | p_list = getPolyList(obj, vmap)
127 | elif obj.GetType() == 1001381: # thinking particle type
128 | p_list = getTPList(obj)
129 | # MoGraph objects
130 | elif (obj.GetType() == 1018544 or #Cloner
131 | obj.GetType() == 1018545 or #Matrix
132 | obj.GetType() == 1018791 or #Fracture
133 | obj.GetType() == 1019268): #MoText
134 |
135 | p_list = getMDList(obj)
136 | pass
137 | else:
138 | print "Wrong object A."
139 | return None
140 | return p_list
141 |
142 | # remove all list elements with value < 0.5 in filter_list
143 | def listFilter(p_list, filter_list):
144 | p_count = len(p_list)
145 | for i in range(p_count - 1,-1,-1):
146 | if filter_list[i] <0.5:
147 | del(p_list[i])
148 | return p_list
149 |
150 | def pointVisibleFilter(p_list, index, seed):
151 | # no need to filter if visibility = 100%
152 | if index == 100:
153 | return p_list
154 |
155 | # count processing time
156 | start_time = timeit.default_timer()
157 |
158 | # initialize random
159 | rand = random.Random(seed)
160 |
161 | # create 0,1 choice base list
162 | choice_list = [1] * index + [0] * (100-index)
163 |
164 | p_count = len(p_list)
165 | filter_list = []
166 |
167 | # create filter list with 0,1 for later filtering use
168 | for i in range(p_count):
169 | filter_list += [rand.choice(choice_list)]
170 |
171 | p_list = listFilter(p_list, filter_list)
172 |
173 | elapsed = timeit.default_timer() - start_time
174 | print 'Visibility Processing Time: %f' % elapsed
175 |
176 | return p_list
177 |
178 | # return a list with splines(represented with two vectors) for self-connection mode
179 | def buildSegList_One(p_list, min_distance, max_distance):
180 | p_count = len(p_list)
181 | seg_list = []
182 |
183 | start_time = timeit.default_timer() #timecount
184 |
185 | for i in range(p_count):
186 | for j in range(i + 1, p_count):
187 | temp_spline = p_list[i] - p_list[j]
188 | distance = temp_spline.GetLength()
189 |
190 | # append a spline into spline list when distance is legal
191 | if min_distance <= distance and distance <= max_distance:
192 | seg_list.extend([p_list[i], p_list[j]])
193 |
194 | """elapsed = timeit.default_timer() - start_time #timeend
195 | print '%f' % elapsed + ' in finding proper splines'"""
196 | return seg_list
197 |
198 | # return a list with splines(represented with two vectors) for A/B connection mode
199 | def buildSegList_Two(p_list_A, p_list_B, min_distance, max_distance):
200 |
201 | seg_list = []
202 |
203 | for vec_a in p_list_A:
204 | for vec_b in p_list_B:
205 | vec_dis = vec_a - vec_b
206 | distance = vec_dis.GetLength()
207 |
208 | if min_distance <= distance and distance <= max_distance:
209 | seg_list.extend([vec_a, vec_b])
210 |
211 | return seg_list
212 | pass
213 |
214 |
215 | def verifyObj(obj):
216 |
217 | if obj.GetType() != c4d.Opolygon or obj.GetType != c4d.Oparticle:
218 | return False
219 |
220 | def findTag(name, obj):
221 | tags = obj.GetTags()
222 | for tag in tags:
223 | if tag.GetName() == name:
224 | return tag
225 | return False
226 |
227 | # find the mean weight around certain point
228 | def meanNeighborWeight(pindex, graph, vlist):
229 | nbwset = []
230 | for i in graph[pindex]:
231 | nbwset.append(vlist[i])
232 | mean_weight = sum(nbwset)/len(nbwset)
233 | return mean_weight
234 |
235 | # create adjacent graph for object
236 | def adjGraph(obj):
237 | polylist = obj.GetAllPolygons()
238 | pcnt = obj.GetPointCount()
239 | graph = []
240 |
241 | # build graph structure
242 | for i in range(pcnt):
243 | graph.append(set())
244 |
245 | # fill chain data
246 | for poly in polylist:
247 | if poly.IsTriangle():
248 | for i in xrange(3):
249 | edge = poly.EdgePoints(i)
250 | graph[edge[0]].add(edge[1])
251 | graph[edge[1]].add(edge[0])
252 | else:
253 | for i in xrange(4):
254 | edge = poly.EdgePoints(i)
255 | graph[edge[0]].add(edge[1])
256 | graph[edge[1]].add(edge[0])
257 |
258 | #calc mem size
259 | size = 0
260 | for i in graph:
261 | size += sys.getsizeof(i)
262 |
263 | size += sys.getsizeof(graph)
264 | size /= 1048576
265 | print "size is %d" % size + "mb"
266 |
267 | return graph
268 |
269 | def vertexmapGrow(self, tag, speed, turbulence, strength, size):
270 | debug("func vertexmapGrow")
271 | obj = tag.GetObject()
272 | old_data = tag.GetAllHighlevelData()
273 | pcnt = obj.GetPointCount()
274 | p_list = obj.GetAllPoints()
275 | new_data = [0.0] * pcnt
276 | graph = adjGraph(obj)
277 | iters = math.ceil(float(speed))
278 | k = float(speed)/iters
279 |
280 | for iter in xrange(int(iters)):
281 | for i in xrange(obj.GetPointCount()):
282 | mean_weight = meanNeighborWeight(i, graph, old_data)
283 | if turbulence:
284 | new_weight = (old_data[i] + mean_weight * c4d.utils.noise.Turbulence(p_list[i]* size, strength, True)) * k
285 | else:
286 | new_weight = (old_data[i] + mean_weight) * k * 0.5
287 | # += min(new_weight,1)
288 | new_data[i] += (new_weight, 1.0)[new_weight > 1]
289 | # = max(new_data[i], old_data[i])
290 | new_data[i] = (new_data[i], old_data[i])[new_data[i] < old_data[i]]
291 | # = min(new_data[i],1)
292 | new_data[i] = (new_data[i], 1.0)[new_weight > 1]
293 | old_data = new_data
294 | tag.SetAllHighlevelData(old_data)
295 | propagationFinishDetect(self, old_data)
296 |
297 | def propagationFinishDetect(self,vlist):
298 | for i in vlist:
299 | if i < 0.5:
300 | self.propagation_finished = False
301 | return None
302 |
303 | self.propagation_finished = True
304 | return None
305 |
306 |
307 | # entry function for vertexmap propagation
308 | def initPropagation(self, grow_enabled, tag, speed, turbulence, strength, size):
309 | debug("initPropagation funcc")
310 | # exit if no animated tag
311 | if not tag:
312 | return None
313 | tag_tail = tag.GetName()[-8:]
314 | if tag_tail != "_Animate":
315 | debug("animate tag NOT deteted")
316 | return None
317 |
318 | debug("animate tag deteted")
319 | doc = tag.GetDocument()
320 | frame = doc.GetTime().GetFrame(doc.GetFps())
321 |
322 | if frame == 0:
323 | #self.propagation_started = False
324 | self.propagation_finished = False
325 |
326 | # reset tag data on the beginning
327 | tag_name = tag.GetName()
328 | old_tag_name = tag_name[:-8]
329 | obj = tag.GetObject()
330 | origin_tag = findTag(old_tag_name, obj)
331 | origin_data = origin_tag.GetAllHighlevelData()
332 | tag.SetAllHighlevelData(origin_data)
333 |
334 | self.propagation_resetflag = True
335 | #self.propagation_started = True
336 |
337 | if grow_enabled and frame > self.lastFrame:
338 | # real propagation process
339 | vertexmapGrow(self, tag, speed, turbulence, strength, size)
340 | self.propagation_resetflag = False
341 |
342 | self.lastFrame = frame
343 |
344 | # find or build animate vertexmap
345 | def getGrowTag(tag):
346 | tag_name = tag.GetName()
347 | if tag_name[-8:] == "_Animate":
348 | return tag
349 |
350 | # find existing animate tag
351 | obj = tag.GetObject()
352 | target_name = tag.GetName() + "_Animate"
353 | target_tag = findTag(target_name, obj)
354 |
355 | # make a new vertexmap tag if target tag does not exist
356 | if not target_tag:
357 | pcnt = obj.GetPointCount()
358 | target_tag = c4d.VariableTag(c4d.Tvertexmap, pcnt)
359 | target_tag.SetName(target_name)
360 | obj.InsertTag(target_tag, tag)
361 |
362 | # copy vertexmap data from original tag
363 | transfer_data = tag.GetAllHighlevelData()
364 | target_tag.SetAllHighlevelData(transfer_data)
365 | return target_tag
366 |
367 | # entry func to build spline
368 | def buildSpline(self, op):
369 | debug('--------------buildSpline---------------')
370 |
371 | mode = op[NETCREATOR_MODE]
372 | obj_A = op[NETCREATOR_OBJECTA]
373 | vmap_A = op[NETCREATOR_VERTEXMAPA]
374 | obj_B = op[NETCREATOR_OBJECTB]
375 | vmap_B = op[NETCREATOR_VERTEXMAPB]
376 | min_distance = op[NETCREATOR_MINDISTANCE]
377 | max_distance = op[NETCREATOR_MAXDISTANCE]
378 | working_space = op[NETCREATOR_SPACE]
379 | visible_index = op[NETCREATOR_VISIBILITY]
380 | seed = op[NETCREATOR_SEED]
381 | propagation_enable = op[NETCREATOR_PROPAGATION_ENABLE]
382 | propagation_speed = op[NETCREATOR_PROPAGATION_SPEED]
383 | propagation_turbulence = op[NETCREATOR_PROPAGATION_TURBULENCE]
384 | propagation_strength = op[NETCREATOR_PROPAGATION_STRENGTH]
385 | propagation_size = op[NETCREATOR_PROPAGATION_SIZE]
386 |
387 | if vmap_A and mode == NETCREATOR_MODE_A:
388 | initPropagation(self, propagation_enable, vmap_A, propagation_speed, propagation_turbulence, propagation_strength, propagation_size/10)
389 |
390 | if vmap_A and mode == NETCREATOR_MODE_A and propagation_enable:
391 | vmap_A = getGrowTag(vmap_A)
392 | op[NETCREATOR_VERTEXMAPA] = vmap_A
393 |
394 | # ---generate p_list A ---
395 | p_list_A = getPList(obj_A, vmap_A)
396 | if not p_list_A:
397 | return None
398 |
399 | # filter invisible points
400 | p_list_A = pointVisibleFilter(p_list_A, int(visible_index * 100), seed)
401 | # ---generate p_list_B ---
402 | if mode == NETCREATOR_MODE_B:
403 | p_list_B = getPList(obj_B, vmap_B)
404 | if not p_list_B:
405 | return None
406 | # filter invisible points
407 | p_list_B = pointVisibleFilter(p_list_B, int(visible_index * 100), seed)
408 | # ---creating splines---
409 |
410 | # self connection mode
411 | if mode == NETCREATOR_MODE_A:
412 | if working_space == NETCREATOR_SPACE_GLOBAL:
413 | p_list_A = localSpaceToGlobalSpace(obj_A, p_list_A)
414 |
415 | seg_list = buildSegList_One(p_list_A, min_distance, max_distance)
416 |
417 | # A/B Connection mode
418 | else:
419 | p_list_A = localSpaceToGlobalSpace(obj_A, p_list_A)
420 | p_list_B = localSpaceToGlobalSpace(obj_B, p_list_B)
421 | seg_list = buildSegList_Two(p_list_A, p_list_B, min_distance, max_distance)
422 |
423 | if not seg_list:
424 | print 'No spline was created'
425 | return None
426 |
427 | seg_count = len(seg_list)/2
428 |
429 | # Initiate all segments
430 | splineObj = c4d.SplineObject(0,0)
431 | splineObj.ResizeObject(len(seg_list), seg_count)
432 | for i in range(seg_count):
433 | splineObj.SetSegment(i,2,False)
434 |
435 |
436 | start_time = timeit.default_timer()
437 |
438 | #print str(p_count) + " points in obj"
439 | print str(seg_count) + " segments"
440 | # Set all segments
441 | splineObj.SetAllPoints(seg_list)
442 |
443 | return splineObj
444 |
445 | # check if scene has changed
446 | # used to decide if rebuild is needed
447 | def sceneChange(self, op):
448 | obj_A = op[NETCREATOR_OBJECTA]
449 | vmap_A = op[NETCREATOR_VERTEXMAPA]
450 |
451 | obj_B = op[NETCREATOR_OBJECTB]
452 | vmap_B = op[NETCREATOR_VERTEXMAPB]
453 |
454 | dirty_now = 0
455 |
456 | dirty_now += op.GetDirty(c4d.DIRTY_DATA)
457 |
458 | if obj_A:
459 | dirty_now += obj_A.GetDirty(c4d.DIRTY_DATA)
460 | dirty_now += obj_A.GetDirty(c4d.DIRTY_CACHE)
461 | if obj_A.GetType() == 1001381:
462 | doc = op.GetDocument()
463 | TP = doc.GetParticleSystem()
464 | dirty_now += TP.GetDirty()
465 |
466 | if vmap_A:
467 | dirty_now += vmap_A.GetDirty(c4d.DIRTY_DATA)
468 |
469 | if op[NETCREATOR_MODE] == NETCREATOR_MODE_B:
470 | if obj_B:
471 | dirty_now += obj_B.GetDirty(c4d.DIRTY_DATA)
472 |
473 | if (obj_B.GetType() == 1018544 or #Cloner
474 | obj_B.GetType() == 1018545 or #Matrix
475 | obj_B.GetType() == 1018791 or #Fracture
476 | obj_B.GetType() == 1019268): #MoText
477 | dirty_now += obj_B.GetDirty(c4d.DIRTYFLAGS_CACHE)
478 | if vmap_B:
479 | dirty_now += vmap_B.GetDirty(c4d.DIRTY_DATA)
480 |
481 | if op[NETCREATOR_SPACE] == NETCREATOR_SPACE_GLOBAL:
482 | if obj_A: dirty_now += obj_A.GetDirty(c4d.DIRTY_MATRIX)
483 | if obj_B: dirty_now += obj_B.GetDirty(c4d.DIRTY_MATRIX)
484 |
485 | if self.DIRTY_COUNT != dirty_now:
486 | self.DIRTY_COUNT = dirty_now
487 | return True
488 |
489 |
490 | # Detect animated vertexmap
491 | if op[NETCREATOR_MODE] != NETCREATOR_MODE_A:
492 | return False
493 | doc = op.GetDocument()
494 | frame = doc.GetTime().GetFrame(doc.GetFps())
495 |
496 | tag = op[NETCREATOR_VERTEXMAPA]
497 | if not tag:
498 | return False
499 | tag_tail = tag.GetName()[-8:]
500 | if tag_tail == "_Animate":
501 | debug("tag detected")
502 | if frame is 0 and not self.propagation_resetflag:
503 | # reset tag data
504 | return True
505 | if op[NETCREATOR_PROPAGATION_ENABLE] and frame > self.lastFrame and not self.propagation_finished:
506 | # propagate vertexmap
507 | return True
508 |
509 | return False
510 |
511 |
512 | # validate if plugin parameters are legal
513 | def paramsValid(op):
514 | mode = op[NETCREATOR_MODE]
515 | obj_A = op[NETCREATOR_OBJECTA]
516 | vmap_A = op[NETCREATOR_VERTEXMAPA]
517 | obj_B = op[NETCREATOR_OBJECTB]
518 | vmap_B = op[NETCREATOR_VERTEXMAPB]
519 | min_distance = op[NETCREATOR_MINDISTANCE]
520 | max_distance = op[NETCREATOR_MAXDISTANCE]
521 |
522 | # verify all objects
523 | if not obj_A:
524 | print "Source object A does not exist."
525 | return False
526 | if not checkObj(obj_A):
527 | print "Source object A is illegal."
528 | return False
529 | if vmap_A:
530 | if vmap_A.GetType() != c4d.Tvertexmap or vmap_A.GetObject() != obj_A():
531 | print "Illegal Vertex Map A."
532 | op[NETCREATOR_VERTEXMAPA] = None
533 | return False
534 |
535 | # verify when mode = 2 objs
536 | if mode == NETCREATOR_MODE_B:
537 | if not obj_B:
538 | print "Source object B does not exist."
539 | return False
540 | if not checkObj(obj_B):
541 | print "Source object B is illegal."
542 | return False
543 | if vmap_B:
544 | if vmap_B.GetType() != c4d.Tvertexmap or vmap_B.GetObject() != obj_B():
545 | print "Illegal Vertex Map B"
546 | op[NETCREATOR_VERTEXMAPB] = None
547 | return False
548 |
549 | if min_distance >= max_distance:
550 | print 'Wrong distance, no spline is created.'
551 | return False
552 |
553 | return True
554 |
555 |
556 | class NetCreator(c4d.plugins.ObjectData):
557 | # Initialize default parameters
558 | def Init(self, node):
559 | self.InitAttr(node, int, NETCREATOR_MODE)
560 | self.InitAttr(node, int, NETCREATOR_SPACE)
561 | self.InitAttr(node, float, NETCREATOR_MAXDISTANCE)
562 | self.InitAttr(node, float, NETCREATOR_VISIBILITY)
563 | self.InitAttr(node, float, NETCREATOR_PROPAGATION_SPEED)
564 | self.InitAttr(node, int, NETCREATOR_PROPAGATION_STRENGTH)
565 | self.InitAttr(node, float, NETCREATOR_PROPAGATION_SIZE)
566 |
567 | node[NETCREATOR_MODE] = NETCREATOR_MODE_A
568 | node[NETCREATOR_SPACE] = NETCREATOR_SPACE_LOCAL
569 | node[NETCREATOR_MAXDISTANCE] = 100
570 | node[NETCREATOR_VISIBILITY] = 1
571 | node[NETCREATOR_PROPAGATION_SPEED] = 1.1
572 | node[NETCREATOR_PROPAGATION_STRENGTH] = 5
573 | node[NETCREATOR_PROPAGATION_SIZE] = 0.2
574 |
575 | self.DIRTY_COUNT = 0
576 | self.propagation_started = False
577 | self.spline_cache = None
578 | self.lastFrame = 0
579 | self.propagation_finished = False
580 | self.propagation_resetflag = False #flag is used to indicate if there is propagation in the middle
581 |
582 |
583 | return True
584 |
585 | # Main Entry
586 | def GetVirtualObjects(self, op, hh):
587 |
588 | # use cache if scene is not changed
589 | if not sceneChange(self, op):
590 | return self.spline_cache
591 | # keeps cache if params are illegal
592 | if not paramsValid(op):
593 | return self.spline_cache
594 | else:
595 | self.spline_cache = buildSpline(self, op)
596 | return self.spline_cache
597 |
598 | # params grey-out detection
599 | def GetDEnabling(self, node, id, t_data, flags, itemdesc):
600 | if id[0].id == NETCREATOR_VERTEXMAPA:
601 | if not node[NETCREATOR_OBJECTA]:
602 | return False
603 | if node[NETCREATOR_OBJECTA].GetType() != c4d.Opolygon:
604 | return False
605 |
606 | if id[0].id == NETCREATOR_OBJECTB :
607 | if node[NETCREATOR_MODE] != NETCREATOR_MODE_B:
608 | return False
609 |
610 | if id[0].id == NETCREATOR_VERTEXMAPB:
611 | if node[NETCREATOR_MODE] != NETCREATOR_MODE_B:
612 | return False
613 | if not node[NETCREATOR_OBJECTB]:
614 | return False
615 | if node[NETCREATOR_OBJECTB].GetType() != c4d.Opolygon:
616 | return False
617 |
618 | if id[0].id == NETCREATOR_PROPAGATION_ENABLE:
619 | if not node[NETCREATOR_VERTEXMAPA]:
620 | node[NETCREATOR_PROPAGATION_ENABLE] = False
621 | return False
622 | if node[NETCREATOR_MODE] == NETCREATOR_MODE_B:
623 | node[NETCREATOR_PROPAGATION_ENABLE] = False
624 | return False
625 |
626 | if id[0].id == NETCREATOR_SPACE:
627 | if node[NETCREATOR_MODE] == NETCREATOR_MODE_B:
628 | node[NETCREATOR_SPACE] = NETCREATOR_SPACE_GLOBAL
629 | return False
630 |
631 | if (id[0].id == NETCREATOR_PROPAGATION_SPEED or
632 | id[0].id == NETCREATOR_PROPAGATION_STRENGTH or
633 | id[0].id == NETCREATOR_PROPAGATION_SIZE ):
634 | if not node[NETCREATOR_PROPAGATION_ENABLE]:
635 | return False
636 |
637 | if id[0].id == NETCREATOR_PROPAGATION_TURBULENCE:
638 | if not node[NETCREATOR_PROPAGATION_ENABLE]:
639 | node[NETCREATOR_PROPAGATION_TURBULENCE] = False
640 | return False
641 | return c4d.plugins.NodeData.GetDEnabling(self, node, id, t_data, flags, itemdesc)
642 |
643 |
644 | def main():
645 | ICON = bmp()
646 | ICON.InitWith(os.path.join(os.path.dirname(__file__),"res","icon.png"))
647 | c4d.plugins.RegisterObjectPlugin(
648 | PLUGIN_ID,
649 | "NetCreator",
650 | NetCreator,
651 | "Onetcreator",
652 | c4d.OBJECT_GENERATOR ,
653 | ICON
654 | )
655 |
656 | if __name__ == '__main__':
657 | main()
658 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # NetCreator v1.1.1
2 | Cinema 4D plugin for creating linking-splines effect.
3 |
4 | For more information please check https://www.behance.net/gallery/38292207/NetCreator-v11-Cinema-4D-plugin
5 |
--------------------------------------------------------------------------------
/res/c4d_symbols.h:
--------------------------------------------------------------------------------
1 |
2 |
--------------------------------------------------------------------------------
/res/description/Onetcreator.h:
--------------------------------------------------------------------------------
1 | #ifndef _Onetcreator_H__
2 | #define _Onetcreator_H__
3 |
4 | enum {
5 | Onetcreator = 1037040,
6 | NETCREATOR_MODE = 1000,
7 | NETCREATOR_MODE_A = 1001,
8 | NETCREATOR_MODE_B = 1002,
9 | NETCREATOR_OBJECTA = 1003,
10 | NETCREATOR_VERTEXMAPA = 1004,
11 | NETCREATOR_OBJECTB = 1005,
12 | NETCREATOR_VERTEXMAPB = 1006,
13 |
14 | ID_DISTANCE = 2000,
15 | NETCREATOR_SPACE = 2001,
16 | NETCREATOR_SPACE_LOCAL = 2002,
17 | NETCREATOR_SPACE_GLOBAL = 2003,
18 | NETCREATOR_MINDISTANCE = 2004,
19 | NETCREATOR_MAXDISTANCE = 2005,
20 | NETCREATOR_VISIBILITY = 2006,
21 | NETCREATOR_SEED = 2007,
22 |
23 | ID_PROPAGATION = 3000,
24 | NETCREATOR_PROPAGATION_ENABLE = 3001,
25 | NETCREATOR_PROPAGATION_SPEED = 3002,
26 | NETCREATOR_PROPAGATION_TURBULENCE = 3003,
27 | NETCREATOR_PROPAGATION_STRENGTH = 3004,
28 | NETCREATOR_PROPAGATION_SIZE = 3005
29 | };
30 |
31 | #endif
--------------------------------------------------------------------------------
/res/description/Onetcreator.res:
--------------------------------------------------------------------------------
1 | CONTAINER Onetcreator
2 | {
3 | NAME Onetcreator;
4 | INCLUDE Obase;
5 |
6 | GROUP ID_OBJECTPROPERTIES {
7 | DEFAULT 1;
8 | LONG NETCREATOR_MODE {
9 | DEFAULT 0;
10 | CYCLE {
11 | NETCREATOR_MODE_A;
12 | NETCREATOR_MODE_B;
13 | };
14 | ANIM OFF;
15 | }
16 | LINK NETCREATOR_OBJECTA {
17 | ACCEPT {
18 | Opolygon;
19 | 1001381;
20 | 1018544;
21 | 1018545;
22 | 1018791;
23 | 1019268;
24 | }
25 | }
26 | LINK NETCREATOR_VERTEXMAPA {
27 | ACCEPT { 5682; }
28 | }
29 | LINK NETCREATOR_OBJECTB {
30 | ACCEPT {
31 | Opolygon;
32 | 1001381;
33 | 1018544;
34 | 1018545;
35 | 1018791;
36 | 1019268;
37 | }
38 | }
39 | LINK NETCREATOR_VERTEXMAPB {
40 | ACCEPT { 5682; }
41 | }
42 | }
43 | GROUP ID_DISTANCE {
44 | DEFAULT 1;
45 | LONG NETCREATOR_SPACE {
46 | CYCLE {
47 | NETCREATOR_SPACE_LOCAL;
48 | NETCREATOR_SPACE_GLOBAL;
49 | }
50 | ANIM OFF;
51 | }
52 | REAL NETCREATOR_MINDISTANCE {
53 | UNIT REAL;
54 | STEP 0.001;
55 | MIN 0;
56 | MINSLIDER 0;
57 | MAXSLIDER 1000;
58 | CUSTOMGUI REALSLIDER;
59 | }
60 | REAL NETCREATOR_MAXDISTANCE {
61 | UNIT REAL;
62 | STEP 0.001;
63 | MIN 0;
64 | DEFAULT 100;
65 | MINSLIDER 0;
66 | MAXSLIDER 10000;
67 | CUSTOMGUI REALSLIDER;
68 | }
69 | REAL NETCREATOR_VISIBILITY {
70 | UNIT PERCENT;
71 | STEP 0.1;
72 | MIN 0;
73 | MAX 100;
74 | MINSLIDER 0;
75 | MAXSLIDER 100;
76 | DEFAULT 100;
77 | CUSTOMGUI REALSLIDER;
78 | }
79 | LONG NETCREATOR_SEED {
80 | MIN 0;
81 | MINSLIDER 0;
82 | MAX 100;
83 | MAXSLIDER 100;
84 | CUSTOMGUI LONGSLIDER;
85 | }
86 | }
87 | GROUP ID_PROPAGATION {
88 | DEFAULT 1;
89 | BOOL NETCREATOR_PROPAGATION_ENABLE {}
90 | REAL NETCREATOR_PROPAGATION_SPEED {
91 | STEP 0.1;
92 | MIN 1;
93 | MINSLIDER 1;
94 | MAX 20;
95 | MAXSLIDER 20;
96 | CUSTOMGUI REALSLIDER;
97 | }
98 | BOOL NETCREATOR_PROPAGATION_TURBULENCE {}
99 | LONG NETCREATOR_PROPAGATION_STRENGTH {
100 | CUSTOMGUI LONGSLIDER;
101 | DEFAULT 5;
102 | STEP 1;
103 | MIN 1;
104 | MINSLIDER 1;
105 | MAX 10;
106 | MAXSLIDER 10;
107 | }
108 | REAL NETCREATOR_PROPAGATION_SIZE {
109 | DEFAULT 0.2;
110 | CUSTOMGUI REALSLIDER;
111 | STEP 0.01;
112 | MIN 0;
113 | MINSLIDER 0;
114 | MAX 1;
115 | MAXSLIDER 1;
116 | }
117 | }
118 | }
--------------------------------------------------------------------------------
/res/icon.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/LewisOrton/NetCreator/ad3d12167b9b247d3ef08d6fd94ef640a5711770/res/icon.png
--------------------------------------------------------------------------------
/res/strings_us/description/Onetcreator.str:
--------------------------------------------------------------------------------
1 | STRINGTABLE Onetcreator {
2 | Onetcreator "NetCreator";
3 |
4 | NETCREATOR_MODE "Mode";
5 | NETCREATOR_MODE_A "Self connection";
6 | NETCREATOR_MODE_B "A-B Connection";
7 | NETCREATOR_OBJECTA "Object_A";
8 | NETCREATOR_VERTEXMAPA "VertexMap_A";
9 | NETCREATOR_OBJECTB "Object_B";
10 | NETCREATOR_VERTEXMAPB "VertexMap_B";
11 |
12 | ID_DISTANCE "Distance";
13 | NETCREATOR_SPACE "Relative Space";
14 | NETCREATOR_SPACE_LOCAL "Local Space";
15 | NETCREATOR_SPACE_GLOBAL "Global Space";
16 | NETCREATOR_MINDISTANCE "Min Distance";
17 | NETCREATOR_MAXDISTANCE "Max Distance";
18 | NETCREATOR_VISIBILITY "Visibility";
19 | NETCREATOR_SEED "Seed";
20 |
21 | ID_PROPAGATION "Propagation";
22 | NETCREATOR_PROPAGATION_ENABLE "Enable";
23 | NETCREATOR_PROPAGATION_SPEED "Speed";
24 | NETCREATOR_PROPAGATION_TURBULENCE "Turbulence";
25 | NETCREATOR_PROPAGATION_STRENGTH "Strength";
26 | NETCREATOR_PROPAGATION_SIZE "Size";
27 | }
--------------------------------------------------------------------------------