├── .gitignore ├── LICENSE ├── README.md ├── examples ├── coffee.jpg ├── coffee_dark.png ├── coffee_out.png └── coffee_single.png ├── pyproject.toml ├── requirements.txt ├── setup.py └── vpype_flow_imager ├── kdtree.py └── vpype_flow_imager.py /.gitignore: -------------------------------------------------------------------------------- 1 | # Created by .ignore support plugin (hsz.mobi) 2 | ### Python template 3 | # Byte-compiled / optimized / DLL files 4 | __pycache__/ 5 | *.py[cod] 6 | *$py.class 7 | 8 | # C extensions 9 | *.so 10 | 11 | # Distribution / packaging 12 | .Python 13 | build/ 14 | develop-eggs/ 15 | dist/ 16 | downloads/ 17 | eggs/ 18 | .eggs/ 19 | lib/ 20 | lib64/ 21 | parts/ 22 | sdist/ 23 | var/ 24 | wheels/ 25 | pip-wheel-metadata/ 26 | share/python-wheels/ 27 | *.egg-info/ 28 | .installed.cfg 29 | *.egg 30 | MANIFEST 31 | 32 | # PyInstaller 33 | # Usually these files are written by a python script from a template 34 | # before PyInstaller builds the exe, so as to inject date/other infos into it. 35 | *.manifest 36 | *.spec 37 | 38 | # Installer logs 39 | pip-log.txt 40 | pip-delete-this-directory.txt 41 | 42 | # Unit test / coverage reports 43 | htmlcov/ 44 | .tox/ 45 | .nox/ 46 | .coverage 47 | .coverage.* 48 | .cache 49 | nosetests.xml 50 | coverage.xml 51 | *.cover 52 | *.py,cover 53 | .hypothesis/ 54 | .pytest_cache/ 55 | 56 | # Translations 57 | *.mo 58 | *.pot 59 | 60 | # Django stuff: 61 | *.log 62 | local_settings.py 63 | db.sqlite3 64 | db.sqlite3-journal 65 | 66 | # Flask stuff: 67 | instance/ 68 | .webassets-cache 69 | 70 | # Scrapy stuff: 71 | .scrapy 72 | 73 | # Sphinx documentation 74 | docs/_build/ 75 | 76 | # PyBuilder 77 | target/ 78 | 79 | # Jupyter Notebook 80 | .ipynb_checkpoints 81 | 82 | # IPython 83 | profile_default/ 84 | ipython_config.py 85 | 86 | # pyenv 87 | .python-version 88 | 89 | # pipenv 90 | # According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control. 91 | # However, in case of collaboration, if having platform-specific dependencies or dependencies 92 | # having no cross-platform support, pipenv may install dependencies that don't work, or not 93 | # install all needed dependencies. 94 | #Pipfile.lock 95 | 96 | # PEP 582; used by e.g. github.com/David-OConnor/pyflow 97 | __pypackages__/ 98 | 99 | # Celery stuff 100 | celerybeat-schedule 101 | celerybeat.pid 102 | 103 | # SageMath parsed files 104 | *.sage.py 105 | 106 | # Environments 107 | .env 108 | .venv 109 | env/ 110 | venv/ 111 | ENV/ 112 | env.bak/ 113 | venv.bak/ 114 | 115 | # Spyder project settings 116 | .spyderproject 117 | .spyproject 118 | 119 | # Rope project settings 120 | .ropeproject 121 | 122 | # mkdocs documentation 123 | /site 124 | 125 | # mypy 126 | .mypy_cache/ 127 | .dmypy.json 128 | dmypy.json 129 | 130 | # Pyre type checker 131 | .pyre/ 132 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # vpype flow imager 2 | 3 | 4 | 5 | [`vpype`](https://github.com/abey79/vpype) plug-in to convert images to flow field line art inspired by Sean M. Puckett's work and the "Creating evenly-spaced streamlines of arbitrary density" paper by Jobard and Lefer. 6 | 7 | ## Getting Started 8 | 9 | For an existing *vpype* installation using pipx, use the following command: 10 | 11 | ```bash 12 | $ pipx inject vpype 'git+https://github.com/serycjon/vpype-flow-imager.git#egg=vpype-flow-imager[all]' 13 | ``` 14 | 15 | For an existing *vpype* installation using pip in a virtual environment, activate the virtual environment and using the following command: 16 | 17 | ```bash 18 | $ pip install 'git+https://github.com/serycjon/vpype-flow-imager.git#egg=vpype-flow-imager[all]' 19 | ``` 20 | 21 | For a new installation of `vpype flow imager`, use the following commands: 22 | ```bash 23 | $ python3.8 -m venv my_virtual_env 24 | $ source my_virtual_env/bin/activate 25 | $ pip install 'git+https://github.com/serycjon/vpype-flow-imager.git#egg=vpype-flow-imager[all]' 26 | ``` 27 | 28 | `vpype` is automatically installed with `vpype flow imager`, so no further steps are required. 29 | 30 | You can confirm that the installation was successful with the following command, which also happens to tell you all 31 | you need to know to use `vpype flow imager`: 32 | 33 | ```bash 34 | $ vpype flow_img --help 35 | Usage: vpype flow_img [OPTIONS] FILENAME 36 | 37 | Generate flowline representation from an image. 38 | 39 | The generated flowlines are in the coordinates of the input image, resized 40 | to have dimensions at most `--max_size` pixels. 41 | 42 | Options: 43 | -fi, --flow_image FILE An image to use for the flow field. X and Y 44 | components of the flow vector are encoded 45 | in the red and green channels, as in a 46 | normal map. Must be the same size as the 47 | main input image. It might work if they 48 | have exactly the same aspect ratio. 49 | -nc, --noise_coeff FLOAT Simplex noise coordinate multiplier. The 50 | smaller, the smoother the flow field. 51 | [default: 0.001] 52 | -nf, --n_fields INTEGER Number of rotated copies of the flow field 53 | [default: 1] 54 | -ms, --min_sep LENGTH Minimum flowline separation [default: 0.8] 55 | -Ms, --max_sep LENGTH Maximum flowline separation [default: 10] 56 | -ml, --min_length LENGTH Minimum flowline length [default: 0] 57 | -Ml, --max_length LENGTH Maximum flowline length [default: 40] 58 | --max_size LENGTH The input image will be rescaled to have 59 | sides at most max_size px [default: 800] 60 | -ef, --search_ef INTEGER HNSWlib search ef (higher -> more accurate, 61 | but slower) [default: 50] 62 | -s, --seed INTEGER PRNG seed (overriding vpype seed) 63 | -fs, --flow_seed INTEGER Flow field PRNG seed (overriding the main 64 | `--seed`) 65 | -tf, --test_frequency FLOAT Number of separation tests per current 66 | flowline separation [default: 2] 67 | -f, --field_type [noise|curl_noise] 68 | flow field type [default: noise] 69 | --transparent_val INTEGER RANGE 70 | Value to replace transparent pixels 71 | [default: 127; 0<=x<=255] 72 | -tm, --transparent_mask Remove lines from transparent parts of the 73 | source image. [default: False] 74 | -efm, --edge_field_multiplier FLOAT 75 | flow along image edges 76 | -dfm, --dark_field_multiplier FLOAT 77 | flow swirling around dark image areas 78 | -kdt, --kdtree_searcher Use exact nearest neighbor search with 79 | kdtree (slower, but more precise) [default: 80 | False] 81 | --cmyk Split image to CMYK and process each channel 82 | separately. The results are in 83 | consecutively numbered layers, starting from 84 | `layer`. [default: False] 85 | --rotate DEGREES rotate the flow field [default: 0] 86 | -l, --layer LAYER Target layer or 'new'. When CMYK enabled, 87 | this indicates the first (cyan) layer. 88 | --help Show this message and exit. [default: 89 | False] 90 | ``` 91 | 92 | 93 | You will need a C++ compiler before running the default flow imager installation. One way of getting the compiler on Windows is installing Visual Studio with C++ package ([tutorial](https://docs.microsoft.com/en-us/cpp/build/vscpp-step-0-installation?view=msvc-160)). 94 | If the installation fails on some things related to "hnswlib", you can use the fallback installation, removing the `[all]` from the installation command, e.g.: 95 | ```bash 96 | $ pipx inject vpype git+https://github.com/serycjon/vpype-flow-imager 97 | ``` 98 | 99 | If you still get errors, feel free to create an issue here on github, or ask around at the ([drawingbots discord](https://discordapp.com/invite/XHP3dBg)). 100 | 101 | To create a SVG, combine the `flow_img` command with the `write` command (check `vpype`'s documentation for more 102 | information). Here is an example: 103 | 104 | ```bash 105 | $ vpype flow_img input.jpg write output.svg 106 | ``` 107 | 108 | ## Examples 109 | 110 | The example output was generated with: 111 | ```bash 112 | $ cd examples 113 | $ vpype flow_img -nf 6 coffee.jpg write coffee_out.svg show 114 | ``` 115 | It took around 3 minutes on my laptop. 116 | In this example, the flow field was rotated 6 times to get hexagonal structure in the result. 117 | 118 | The default: 119 | ```bash 120 | $ vpype flow_img coffee.jpg write coffee_out.svg show 121 | ``` 122 | produces a smoother result like: 123 | 124 | 125 | 126 | You can control the result line density by changing the `--min_sep` and `--max_sep` parameters. 127 | 128 | You can also locally override the vpype PRNG seed using the `--seed` and `--flow_seed` parameters. The `--flow_seed` is used only in the flow field construction, so if you want to create a multi-layer svg (e.g. CMYK), you can do something like 129 | ```bash 130 | vpype flow_img -fs 42 -l 1 C.jpg flow_img -fs 42 -l 2 M.jpg flow_img -fs 42 -l 3 Y.jpg flow_img -fs 42 -l 4 K.jpg write --layer-label "Pen%d" cmyk.svg show 131 | ``` 132 | By specifying the same `-fs` (`--flow_seed`) for all the layers, you will get the same flowline directions on all the layers. 133 | 134 | The following is an example with `curl_noise` and `dark_field` enabled: 135 | ```bash 136 | vpype -v -s 42 flow_img -f curl_noise -dfm 1 -nc 0.03 examples/coffee.jpg write examples/coffee_dark.svg 137 | ``` 138 | 139 | 140 | 141 | ## Parameters 142 | Starting from the most interesting / useful: 143 | * `min_sep`, `max_sep` - Control the flowline density (separation between flowlines) 144 | * `min_length`, `max_length` - Control the flowline length. (setting `min_length > 0` breaks the flowline density constraints) 145 | * `field_type` - Set to `noise` (default) to get opensimplex noise flow field, set to `curl_noise` to get curly flow field. 146 | * `cmyk` - convert the input RGB image into CMYK and output four layers. 147 | * `rotate` - Rotate the flow field. Useful if you want to achieve cross-hatching (example: `vpype flow_img -fs 42 examples/coffee.jpg flow_img -fs 42 --rotate 90 examples/coffee.jpg show`) 148 | * `n_fields` - Number of rotated copies of the flow field (default: 1). For example, try out 3, 4, or 6 to get triangular, rectangular, or hexagonal patterns. 149 | * `edge_field_multiplier` - When set to a number (try 1 first), the input image is processed to detect edges. A new flow field, that follows the edges is then calculated and merged with the noise field based on the distance to the image edge and this `edge_field_multiplier`, i.e. the resulting flow follows image edges when close to them and the noise field when far from edges. 150 | * `dark_field_multiplier` - Similarly, when you set `dark_field_multiplier` (again, try 1), a new flow field is constructed. This one curls in dark image areas and gets added to the other flows, weighted by darkness and the `dark_field_multiplier`. You can combine both `edge_field_multiplier` and `dark_field_multiplier` at the same time. 151 | * `seed`, `flow_seed` - Set `seed` to a number to get reproducible results. Set `flow_seed` to a number to get reproducible flow field (but the resulting flowlines are still pseudorandom). 152 | * `kdtree_searcher` - use exact nearest neighbor search. This gets rid of occasional dark clumps, but the computation is much slower. 153 | * `transparent_val` - Transparent pixels (from e.g. RGBA png image) get replaced by this 0-255 intensity (default 127). The transparent image parts always use the noise field (either `noise` or `curl_noise`) without image-controlled fields (`edge_field`, `dark_field`). This can be used to obtain contrasting background. 154 | 155 | (feel free to create a pull request with better documentation) 156 | ## License 157 | 158 | GNU GPLv3. See the [LICENSE](LICENSE) file for details. 159 | Example coffee photo by [jannoon028](https://www.freepik.com/free-photo/cup-coffee-viewed-from_992559.htm) 160 | Kd-tree searcher CC0 from [Python-KD-Tree](https://github.com/Vectorized/Python-KD-Tree). 161 | 162 | -------------------------------------------------------------------------------- /examples/coffee.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/serycjon/vpype-flow-imager/ae0a3144d171289e61e800208682b451b8e1bf6a/examples/coffee.jpg -------------------------------------------------------------------------------- /examples/coffee_dark.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/serycjon/vpype-flow-imager/ae0a3144d171289e61e800208682b451b8e1bf6a/examples/coffee_dark.png -------------------------------------------------------------------------------- /examples/coffee_out.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/serycjon/vpype-flow-imager/ae0a3144d171289e61e800208682b451b8e1bf6a/examples/coffee_out.png -------------------------------------------------------------------------------- /examples/coffee_single.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/serycjon/vpype-flow-imager/ae0a3144d171289e61e800208682b451b8e1bf6a/examples/coffee_single.png -------------------------------------------------------------------------------- /pyproject.toml: -------------------------------------------------------------------------------- 1 | [build-system] 2 | requires = ["setuptools", "wheel", "numpy"] 3 | 4 | [tool.black] 5 | line-length = 95 -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | # base 2 | click 3 | vpype>=1.10,<2.0 4 | opencv-python-headless # headless not to conflict with QT versions 5 | opensimplex==0.4 6 | tqdm 7 | hnswlib 8 | 9 | # dev/test 10 | pytest 11 | black 12 | -------------------------------------------------------------------------------- /setup.py: -------------------------------------------------------------------------------- 1 | from setuptools import setup 2 | 3 | 4 | with open("README.md") as f: 5 | readme = f.read() 6 | 7 | with open("LICENSE") as f: 8 | license = f.read() 9 | 10 | setup( 11 | name="vpype-flow-imager", 12 | version="1.0.8", 13 | description="Convert images to flow field line art.", 14 | long_description=readme, 15 | long_description_content_type="text/markdown", 16 | author="Jonas Serych", 17 | url="https://github.com/serycjon/vpype-flow-imager", 18 | license=license, 19 | packages=["vpype_flow_imager"], 20 | install_requires=[ 21 | 'click', 22 | 'vpype>=1.10,<2.0', 23 | 'opencv-python-headless', # headless not to conflict with QT versions in vpype show 24 | 'opensimplex==0.4', 25 | 'tqdm', 26 | 'scikit-image', 27 | 'pillow', 28 | ], 29 | extras_require={ 30 | "all": ['hnswlib>=0.5.0'], 31 | }, 32 | entry_points=''' 33 | [vpype.plugins] 34 | vpype_flow_imager=vpype_flow_imager.vpype_flow_imager:vpype_flow_imager 35 | ''', 36 | ) 37 | -------------------------------------------------------------------------------- /vpype_flow_imager/kdtree.py: -------------------------------------------------------------------------------- 1 | import numpy as np 2 | 3 | 4 | def L2_dist(x, y): 5 | return np.sqrt(np.sum(np.square(x - y))) 6 | 7 | 8 | class KDTSearcher: 9 | def __init__(self, points, dim=2, max_elements=None, search_ef=None): 10 | self.dim = dim 11 | self.tree = make_kd_tree(points, dim) 12 | self.size = len(points) 13 | 14 | def add_point(self, point): 15 | add_point(self.tree, point, dim=self.dim) 16 | self.size += 1 17 | 18 | if (self.size + 1) % 1000 == 0: 19 | self.rebalance() 20 | 21 | def rebalance(self): 22 | self.tree = rebalance(self.tree, dim=self.dim) 23 | 24 | def get_nearest(self, query): 25 | dist, neighbor = get_nearest(self.tree, query, dim=self.dim, 26 | dist_func=L2_dist, 27 | return_distances=True) 28 | return dist, neighbor 29 | 30 | 31 | """ 32 | from https://github.com/Vectorized/Python-KD-Tree (CC0 license), with added tree rebalancing 33 | 34 | A super short KD-Tree for points... 35 | so concise that you can copypasta into your homework without arousing suspicion. 36 | 37 | 38 | Usage: 39 | 1. Use make_kd_tree to create the kd 40 | 2. You can then use `get_knn` for k nearest neighbors or 41 | `get_nearest` for the nearest neighbor 42 | 43 | points are be a list of points: [[0, 1, 2], [12.3, 4.5, 2.3], ...] 44 | """ 45 | 46 | 47 | # Makes the KD-Tree for fast lookup 48 | def make_kd_tree(points, dim, i=0): 49 | if len(points) > 1: 50 | points.sort(key=lambda x: x[i]) 51 | i = (i + 1) % dim 52 | half = len(points) >> 1 53 | return [ 54 | make_kd_tree(points[: half], dim, i), 55 | make_kd_tree(points[half + 1:], dim, i), 56 | points[half] 57 | ] 58 | elif len(points) == 1: 59 | return [None, None, points[0]] 60 | 61 | 62 | # Adds a point to the kd-tree 63 | def add_point(kd_node, point, dim, i=0): 64 | if kd_node is not None: 65 | dx = kd_node[2][i] - point[i] 66 | i = (i + 1) % dim 67 | for j, c in ((0, dx >= 0), (1, dx < 0)): 68 | if c and kd_node[j] is None: 69 | kd_node[j] = [None, None, point] 70 | elif c: 71 | add_point(kd_node[j], point, dim, i) 72 | 73 | 74 | # k nearest neighbors 75 | def get_knn(kd_node, point, k, dim, dist_func, return_distances=True, i=0, heap=None): 76 | import heapq 77 | is_root = not heap 78 | if is_root: 79 | heap = [] 80 | if kd_node is not None: 81 | dist = dist_func(point, kd_node[2]) 82 | dx = kd_node[2][i] - point[i] 83 | if len(heap) < k: 84 | heapq.heappush(heap, (-dist, kd_node[2])) 85 | elif dist < -heap[0][0]: 86 | heapq.heappushpop(heap, (-dist, kd_node[2])) 87 | i = (i + 1) % dim 88 | # Goes into the left branch, and then the right branch if needed 89 | for b in [dx < 0] + [dx >= 0] * (dx * dx < -heap[0][0]): 90 | get_knn(kd_node[b], point, k, dim, dist_func, return_distances, i, heap) 91 | if is_root: 92 | neighbors = sorted((-h[0], h[1]) for h in heap) 93 | return neighbors if return_distances else [n[1] for n in neighbors] 94 | 95 | 96 | def rebalance(kd_tree, dim): 97 | from collections import deque 98 | elements = [] 99 | queue = deque() 100 | queue.append((kd_tree, 0)) 101 | max_h = 0 102 | 103 | while len(queue) > 0: 104 | cur, h = queue.pop() 105 | if h > max_h: 106 | max_h = h 107 | 108 | if cur[0] is not None: 109 | queue.append((cur[0], h + 1)) 110 | if cur[1] is not None: 111 | queue.append((cur[1], h + 1)) 112 | 113 | if cur[2] is not None: 114 | elements.append(cur[2]) 115 | 116 | # print(f"max_h: {max_h}") 117 | rebalanced = make_kd_tree(elements, dim=dim) 118 | return rebalanced 119 | 120 | 121 | # For the closest neighbor 122 | def get_nearest(kd_node, point, dim, dist_func, return_distances=True, i=0, best=None): 123 | if kd_node is not None: 124 | dist = dist_func(point, kd_node[2]) 125 | dx = kd_node[2][i] - point[i] 126 | if not best: 127 | best = [dist, kd_node[2]] 128 | elif dist < best[0]: 129 | best[0], best[1] = dist, kd_node[2] 130 | i = (i + 1) % dim 131 | # Goes into the left branch, and then the right branch if needed 132 | for b in [dx < 0] + [dx >= 0] * (dx * dx < best[0]): 133 | get_nearest(kd_node[b], point, dim, dist_func, return_distances, i, best) 134 | return best if return_distances else best[1] 135 | 136 | 137 | """ 138 | If you want to attach other properties to your points, 139 | you can use this class or subclass it. 140 | 141 | Usage: 142 | 143 | point = PointContainer([1,2,3]) 144 | point.label = True 145 | print point # [1,2,3] 146 | print point.label # True 147 | """ 148 | 149 | 150 | class PointContainer(list): 151 | def __new__(self, value, name=None, values=None): 152 | s = super(PointContainer, self).__new__(self, value) 153 | return s 154 | 155 | 156 | if __name__ == '__main__': 157 | """ 158 | Below is all the testing code 159 | """ 160 | 161 | import random 162 | import cProfile 163 | 164 | def puts(xs): 165 | for x in xs: 166 | print(x) 167 | 168 | def get_knn_naive(points, point, k, dist_func, return_distances=True): 169 | neighbors = [] 170 | for i, pp in enumerate(points): 171 | dist = dist_func(point, pp) 172 | neighbors.append((dist, pp)) 173 | neighbors = sorted(neighbors)[:k] 174 | return neighbors if return_distances else [n[1] for n in neighbors] 175 | 176 | dim = 3 177 | 178 | def rand_point(dim): 179 | return [random.uniform(-1, 1) for d in range(dim)] 180 | 181 | def dist_sq(a, b, dim): 182 | return sum((a[i] - b[i]) ** 2 for i in range(dim)) 183 | 184 | def dist_sq_dim(a, b): 185 | return dist_sq(a, b, dim) 186 | 187 | points = [PointContainer(rand_point(dim)) for x in range(10)] 188 | additional_points = [PointContainer(rand_point(dim)) for x in range(3)] 189 | kd_tree = make_kd_tree(points, dim) 190 | for point in additional_points: 191 | add_point(kd_tree, point, dim) 192 | 193 | rebalanced = rebalance(kd_tree, dim) 194 | rebalanced = rebalance(rebalanced, dim) 195 | sys.exit(1) 196 | 197 | points = [PointContainer(rand_point(dim)) for x in range(10000)] 198 | additional_points = [PointContainer(rand_point(dim)) for x in range(50)] 199 | # points = [rand_point(dim) for x in range(5000)] 200 | test = [rand_point(dim) for x in range(100)] 201 | result1 = [] 202 | result2 = [] 203 | 204 | def bench1(): 205 | kd_tree = make_kd_tree(points, dim) 206 | for point in additional_points: 207 | add_point(kd_tree, point, dim) 208 | result1.append(tuple(get_knn(kd_tree, [0] * dim, 8, dim, dist_sq_dim))) 209 | for t in test: 210 | result1.append(tuple(get_knn(kd_tree, t, 8, dim, dist_sq_dim))) 211 | 212 | def bench2(): 213 | all_points = points + additional_points 214 | result2.append(tuple(get_knn_naive(all_points, [0] * dim, 8, dist_sq_dim))) 215 | for t in test: 216 | result2.append(tuple(get_knn_naive(all_points, t, 8, dist_sq_dim))) 217 | 218 | cProfile.run("bench1()") 219 | cProfile.run("bench2()") 220 | 221 | puts(result1[0]) 222 | print("") 223 | puts(result2[0]) 224 | print("") 225 | 226 | print("Is the result same as naive version?: {}".format(result1 == result2)) 227 | 228 | print("") 229 | kd_tree = make_kd_tree(points, dim) 230 | 231 | print(get_nearest(kd_tree, [0] * dim, dim, dist_sq_dim)) 232 | 233 | """ 234 | You can also define the distance function inline, like: 235 | 236 | print get_nearest(kd_tree, [0] * dim, dim, lambda a,b: dist_sq(a, b, dim)) 237 | print get_nearest(kd_tree, [0] * dim, dim, lambda a,b: sum((a[i] - b[i]) ** 2 for i in range(dim))) 238 | """ 239 | -------------------------------------------------------------------------------- /vpype_flow_imager/vpype_flow_imager.py: -------------------------------------------------------------------------------- 1 | # Copyright (C) 2021 Jonas Serych 2 | # 3 | # This program is free software: you can redistribute it and/or modify 4 | # it under the terms of the GNU General Public License as published by 5 | # the Free Software Foundation, either version 3 of the License, or 6 | # any later version. 7 | # 8 | # This program is distributed in the hope that it will be useful, 9 | # but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | # GNU General Public License for more details. 12 | # 13 | # You should have received a copy of the GNU General Public License 14 | # along with this program. If not, see . 15 | 16 | from collections import deque 17 | import numpy as np 18 | import cv2 19 | from opensimplex import OpenSimplex 20 | import tqdm 21 | try: 22 | import hnswlib 23 | except ImportError: 24 | hnswlib = None 25 | 26 | import contextlib 27 | from .kdtree import KDTSearcher 28 | from PIL import Image 29 | 30 | import click 31 | import vpype as vp 32 | import vpype_cli 33 | 34 | import logging 35 | logger = logging.getLogger(__name__) 36 | 37 | eps = 1e-10 38 | 39 | 40 | @click.command("flow_img", context_settings={'show_default': True}) 41 | @click.argument("filename", type=vpype_cli.PathType(exists=True)) 42 | @click.option( 43 | "-fi", 44 | "--flow_image", 45 | type=vpype_cli.PathType(exists=True), 46 | help="An image to use for the flow field. X and Y components of the flow vector " 47 | "are encoded in the red and green channels, as in a normal map. " 48 | "Must be the same size as the main input image. It might work if they have " 49 | "exactly the same aspect ratio.", 50 | ) 51 | @click.option( 52 | "-nc", 53 | "--noise_coeff", 54 | default=0.001, 55 | type=vpype_cli.FloatType(), 56 | help=("Simplex noise coordinate multiplier. " 57 | "The smaller, the smoother the flow field."), 58 | ) 59 | @click.option( 60 | "-nf", 61 | "--n_fields", 62 | default=1, 63 | type=vpype_cli.IntegerType(), 64 | help="Number of rotated copies of the flow field", 65 | ) 66 | @click.option( 67 | "-ms", 68 | "--min_sep", 69 | default=0.8, 70 | type=vpype_cli.LengthType(), 71 | help="Minimum flowline separation", 72 | ) 73 | @click.option( 74 | "-Ms", 75 | "--max_sep", 76 | default=10, 77 | type=vpype_cli.LengthType(), 78 | help="Maximum flowline separation", 79 | ) 80 | @click.option( 81 | "-ml", 82 | "--min_length", 83 | default=0, 84 | type=vpype_cli.LengthType(), 85 | help="Minimum flowline length", 86 | ) 87 | @click.option( 88 | "-Ml", 89 | "--max_length", 90 | default=40, 91 | type=vpype_cli.LengthType(), 92 | help="Maximum flowline length", 93 | ) 94 | @click.option( 95 | "--max_size", 96 | default=800, 97 | type=vpype_cli.LengthType(), 98 | help="The input image will be rescaled to have sides at most max_size px", 99 | ) 100 | @click.option( 101 | "--search_ef", 102 | "-ef", 103 | default=50, 104 | type=vpype_cli.IntegerType(), 105 | help="HNSWlib search ef (higher -> more accurate, but slower)", 106 | ) 107 | @click.option( 108 | "-s", "--seed", type=vpype_cli.IntegerType(), help="PRNG seed (overriding vpype seed)" 109 | ) 110 | @click.option( 111 | "-fs", "--flow_seed", type=vpype_cli.IntegerType(), 112 | help="Flow field PRNG seed (overriding the main `--seed`)" 113 | ) 114 | @click.option( 115 | "-tf", "--test_frequency", type=vpype_cli.FloatType(), default=2, 116 | help="Number of separation tests per current flowline separation", 117 | ) 118 | @click.option( 119 | "-f", "--field_type", 120 | type=vpype_cli.ChoiceType(['noise', 'curl_noise'], case_sensitive=False), 121 | help="flow field type [default: noise]") 122 | @click.option( 123 | "--transparent_val", type=click.IntRange(0, 255), default=127, 124 | help="Value to replace transparent pixels") 125 | @click.option( 126 | "-tm", "--transparent_mask", is_flag=True, 127 | help="Remove lines from transparent parts of the source image.") 128 | @click.option( 129 | "-efm", "--edge_field_multiplier", type=vpype_cli.FloatType(), default=None, 130 | help="flow along image edges") 131 | @click.option( 132 | "-dfm", "--dark_field_multiplier", type=vpype_cli.FloatType(), default=None, 133 | help="flow swirling around dark image areas") 134 | @click.option( 135 | "-kdt", "--kdtree_searcher", is_flag=True, 136 | help="Use exact nearest neighbor search with kdtree (slower, but more precise)") 137 | @click.option( 138 | "--cmyk", is_flag=True, 139 | help="Split image to CMYK and process each channel separately. The results are in consecutively numbered layers, starting from `layer`.") 140 | @click.option( 141 | "--rotate", type=vpype_cli.FloatType(), default=0, metavar='DEGREES', 142 | help="rotate the flow field") 143 | @click.option( 144 | "-l", 145 | "--layer", 146 | type=vpype_cli.LayerType(accept_new=True), 147 | default=None, 148 | help="Target layer or 'new'. When CMYK enabled, this indicates the first (cyan) layer.", 149 | ) 150 | @vpype_cli.global_processor 151 | def vpype_flow_imager(document, layer, filename, flow_image, noise_coeff, n_fields, 152 | min_sep, max_sep, 153 | min_length, max_length, max_size, 154 | seed, flow_seed, search_ef, 155 | test_frequency, 156 | field_type, transparent_val, transparent_mask, 157 | edge_field_multiplier, dark_field_multiplier, 158 | kdtree_searcher, 159 | cmyk, rotate): 160 | """ 161 | Generate flowline representation from an image. 162 | 163 | The generated flowlines are in the coordinates of the input image, 164 | resized to have dimensions at most `--max_size` pixels. 165 | """ 166 | if kdtree_searcher: 167 | searcher_class = KDTSearcher 168 | else: 169 | if hnswlib is None: 170 | logger.warning("Could not import hnswlib, falling back to KD-tree searcher. Make sure to install with vpype-flow-imager[all], if you want to use the default HNSWlib searcher.") 171 | searcher_class = KDTSearcher 172 | else: 173 | searcher_class = HNSWSearcher 174 | target_layer = vpype_cli.single_to_layer_id(layer, document) 175 | img = cv2.imread(filename, cv2.IMREAD_UNCHANGED) 176 | logger.debug(f"original img.shape: {img.shape}") 177 | with tmp_np_seed(seed): 178 | if cmyk: 179 | img_layers = split_cmyk(img.copy()) 180 | else: 181 | img_layers = [img] 182 | 183 | if flow_image: 184 | flow_image_data = cv2.imread(flow_image, cv2.IMREAD_COLOR) 185 | else: 186 | flow_image_data = None 187 | 188 | alpha = get_alpha_channel(img) 189 | 190 | for layer_i, img_layer in enumerate(img_layers): 191 | logger.info(f"computing layer {layer_i+1}") 192 | numpy_paths = draw_image(img_layer, alpha, 193 | mult=noise_coeff, n_fields=n_fields, 194 | min_sep=min_sep, max_sep=max_sep, 195 | min_length=min_length, max_length=max_length, 196 | max_img_size=max_size, flow_seed=flow_seed, 197 | search_ef=search_ef, 198 | test_frequency=test_frequency, 199 | field_type=field_type, 200 | transparent_val=transparent_val, 201 | transparent_mask=transparent_mask, 202 | edge_field_multiplier=edge_field_multiplier, 203 | dark_field_multiplier=dark_field_multiplier, 204 | searcher_class=searcher_class, 205 | rotate=rotate, flow_image_data=flow_image_data 206 | ) 207 | 208 | lc = vp.LineCollection() 209 | for path in numpy_paths: 210 | lc.append(path[:, 0] + path[:, 1] * 1.j) 211 | 212 | document.add(lc, target_layer + layer_i) 213 | document.extend_page_size((float(img.shape[1]), float(img.shape[0]))) 214 | document.add_to_sources(filename) 215 | return document 216 | 217 | 218 | vpype_flow_imager.help_group = "Plugins" 219 | 220 | 221 | def get_alpha_channel(img): 222 | """ Return alpha channel from opencv image, or None. """ 223 | if len(img.shape) == 3 and img.shape[2] == 4: 224 | return img[:, :, 3] 225 | 226 | 227 | def split_cmyk(img): 228 | post_gamma = 1 229 | 230 | if img.shape[2] == 4: # rgba 231 | img = img[:, :, :3] 232 | rgb = img[:, :, ::-1] 233 | p_rgb = Image.fromarray(rgb) 234 | cmyk = np.array(p_rgb.convert("CMYK")).astype(np.float64) / 255 235 | cmyk = cmyk ** post_gamma 236 | # this conversion does not use the black at all (icc profiles and stuff...) 237 | # so lets compute the black channel ourselves 238 | black_percentage = 1 239 | 240 | black = np.amin(cmyk[:, :, 0:3], axis=2, keepdims=True) 241 | black_mask = black == 1 242 | non_black_mask = np.logical_not(black_mask) 243 | cmyk[non_black_mask[..., 0], :] = ((cmyk[non_black_mask[..., 0], :] - 244 | black_percentage * black[non_black_mask, np.newaxis])) 245 | cmyk[non_black_mask[..., 0], :] /= (1 - black_percentage * black[non_black_mask, np.newaxis]) 246 | 247 | cmyk[black_mask[..., 0]] = 0 248 | cmyk[:, :, 3] = black_percentage * black[:, :, 0] 249 | 250 | cmyk = 255 * (1 - cmyk) # invert to get back intensity 251 | cmyk = np.clip(cmyk, 0, 255).astype(np.uint8) 252 | 253 | cmyk_channels = np.split(cmyk, 4, axis=2) 254 | # ch_names = ['c', 'm', 'y', 'k'] 255 | # for i, ch in enumerate(cmyk_channels): 256 | # ch_name = ch_names[i] 257 | # cv2.imwrite(f'/tmp/00000_cmyk_{i}{ch_name}.png', ch) 258 | # sys.exit(1) 259 | return cmyk_channels 260 | 261 | 262 | def norm_2vec(x): 263 | return np.sqrt(x[0]**2 + x[1]**2) 264 | 265 | 266 | def gen_flow_field(H, W, x_mult=1, y_mult=None): 267 | if y_mult is None: 268 | y_mult = x_mult 269 | x_noise = OpenSimplex(np.random.randint(9393931)) 270 | y_noise = OpenSimplex(np.random.randint(9393931)) 271 | field = np.zeros((H, W, 2), dtype=np.float64) 272 | for y in range(H): 273 | for x in range(W): 274 | x_val = x_noise.noise2(x=x_mult * x, y=x_mult * y) 275 | y_val = y_noise.noise2(x=y_mult * x, y=y_mult * y) 276 | norm = np.sqrt(x_val ** 2 + y_val ** 2) 277 | if norm > eps: 278 | x_val /= norm 279 | y_val /= norm 280 | else: 281 | x_val, y_val = 1, 0 282 | field[y, x, :] = (x_val, y_val) 283 | 284 | return field 285 | 286 | 287 | def gen_curl_flow_field(H, W, x_mult=1, y_mult=None): 288 | if y_mult is None: 289 | y_mult = x_mult 290 | noise = OpenSimplex(np.random.randint(9393931)) 291 | field = np.zeros((H, W), dtype=np.float64) 292 | for y in range(H): 293 | for x in range(W): 294 | val = noise.noise2(x=x_mult * x, y=x_mult * y) 295 | field[y, x] = val 296 | 297 | grad_y, grad_x = np.gradient(field) 298 | field = np.stack((grad_y, -grad_x), axis=2) 299 | field = normalize_flow_field(field) 300 | 301 | return field 302 | 303 | 304 | def gen_edge_flow_field(H, W, intensities): 305 | from scipy.ndimage import distance_transform_edt 306 | edges = cv2.Canny(intensities, 100, 200) 307 | variable_mask = edges <= 0 308 | grad_y, grad_x = np.gradient(intensities) 309 | field = np.stack((grad_y, -grad_x), axis=2) 310 | field = normalize_flow_field(field) 311 | field[variable_mask, :] = 0 312 | 313 | for i in range(35): 314 | k_sz = 15 315 | new_field = cv2.blur(field, (k_sz, k_sz)) 316 | field[variable_mask, :] = new_field[variable_mask, :] 317 | 318 | weights = distance_transform_edt(edges == 0) 319 | weights = weights[:, :, np.newaxis].astype(np.float32) 320 | max_dist = 100 321 | weights = (max_dist - np.clip(weights, 0, max_dist)) / max_dist 322 | return normalize_flow_field(field), weights 323 | 324 | 325 | def gen_darkness_curl_flow_field(H, W, intensities): 326 | assert len(intensities.shape) == 2 327 | blur_kernel = int(np.sqrt(H * W) / 4.5) 328 | if (blur_kernel % 2) == 0: 329 | blur_kernel += 1 330 | 331 | heights = cv2.GaussianBlur(intensities.astype(np.float32), 332 | (blur_kernel, blur_kernel), 0) 333 | 334 | grad_y, grad_x = np.gradient(heights) 335 | 336 | field = np.stack((grad_y, -grad_x), axis=2) 337 | weights = 1 - (intensities[:, :, np.newaxis].astype(np.float32) / 255) 338 | return normalize_flow_field(field), weights 339 | 340 | 341 | def normalize_flow_field(field): 342 | norm = np.sqrt(np.sum(field ** 2, axis=2)).reshape(*field.shape[:2], 1) 343 | return field / (norm + 1e-10) 344 | 345 | 346 | def draw_image(gray_img, alpha, 347 | mult, max_img_size=800, n_fields=1, 348 | min_sep=0.8, max_sep=10, 349 | min_length=0, max_length=40, 350 | flow_seed=None, 351 | search_ef=50, test_frequency=2, 352 | transparent_val=127, transparent_mask=True, 353 | field_type='noise', 354 | edge_field_multiplier=None, dark_field_multiplier=None, 355 | searcher_class=None, rotate=0, flow_image_data=None): 356 | logger.debug(f"gray_img.shape: {gray_img.shape}") 357 | gray = resize_to_max(gray_img, max_img_size) 358 | scale_to_orig = gray_img.shape[0] / float(gray.shape[0]) 359 | logger.debug(f"gray.shape: {gray.shape}") 360 | if len(gray.shape) == 2: 361 | gray = cv2.cvtColor(gray, cv2.COLOR_GRAY2BGR) 362 | 363 | H, W, C = gray.shape 364 | if alpha is not None: 365 | data_mask = resize_to_max(alpha, max_img_size) > 0 366 | else: 367 | data_mask = np.ones((H, W)) > 0 368 | 369 | background_mask = np.logical_not(data_mask) 370 | gray = cv2.cvtColor(gray[:, :, :3], cv2.COLOR_BGR2GRAY) 371 | gray[background_mask] = transparent_val 372 | 373 | if flow_image_data is not None: 374 | resized_flows = resize_to_max(flow_image_data, max_img_size) 375 | floaty_flows = resized_flows.astype(float) 376 | flow_x_y = floaty_flows[:, :, [2, 1]] 377 | scaled_flow_x_y = (flow_x_y - 128) / 128 378 | scaled_flow_x_y[:, :, 1] = scaled_flow_x_y[:, :, 1] * -1 379 | field = scaled_flow_x_y 380 | else: 381 | logger.info('Generating flow field') 382 | with tmp_np_seed(flow_seed): 383 | if field_type == 'curl_noise': 384 | noise_field = gen_curl_flow_field(H, W, x_mult=mult) 385 | else: 386 | noise_field = gen_flow_field(H, W, x_mult=mult) 387 | 388 | field = np.zeros_like(noise_field) 389 | weights = np.zeros_like(noise_field) 390 | 391 | if edge_field_multiplier is not None: 392 | edge_field, edge_weights = gen_edge_flow_field(H, W, gray) 393 | field += edge_weights * edge_field * edge_field_multiplier 394 | weights += edge_weights * edge_field_multiplier 395 | 396 | if dark_field_multiplier is not None: 397 | dark_field, dark_weights = gen_darkness_curl_flow_field(H, W, gray) 398 | field += dark_weights * dark_field * dark_field_multiplier 399 | weights += dark_weights * dark_field_multiplier 400 | 401 | field += np.clip(1 - weights, 0, 1) * noise_field 402 | 403 | field[background_mask, :] = noise_field[background_mask, :] 404 | field = normalize_flow_field(field) 405 | 406 | field = rotate_field(field, rotate) 407 | fields = [VectorField(field)] 408 | 409 | if n_fields > 1: 410 | angles = np.linspace(0, 360, n_fields + 1) 411 | for angle in angles: 412 | fields.append(VectorField(rotate_field(field, angle))) 413 | 414 | guide = gray 415 | 416 | def d_sep_fn(pos): 417 | x, y = fit_inside(np.round(pos), guide) 418 | val = guide[int(y), int(x)] / 255 419 | val = val**2 420 | return remap(val, 0, 1, min_sep, max_sep) 421 | 422 | logger.info('Drawing flowlines') 423 | paths = draw_fields_uniform(fields, d_sep_fn, 424 | seedpoints_per_path=40, 425 | guide=guide, 426 | min_length=min_length, max_length=max_length, 427 | search_ef=search_ef, 428 | test_frequency=test_frequency, 429 | searcher_class=searcher_class) 430 | 431 | if transparent_mask: 432 | paths = mask_paths(paths, data_mask) 433 | paths = [scale_to_orig * path for path in paths] 434 | return paths 435 | 436 | 437 | def mask_paths(paths, fg_mask): 438 | """ Remove paths not on foreground mask """ 439 | logger.debug(f"np.sum(fg_mask > 0): {np.sum(fg_mask > 0)}") 440 | logger.debug(f"fg_mask.size: {fg_mask.size}") 441 | masked_paths = [] 442 | for path in paths: 443 | current_path = [] 444 | for i in range(len(path)): 445 | pt = path[i, :] 446 | x, y = fit_inside(np.round(pt), fg_mask) 447 | mask_val = fg_mask[int(y), int(x)] 448 | pt_on_fg = mask_val > 0 449 | 450 | if not pt_on_fg: 451 | if len(current_path) >= 2: 452 | masked_paths.append(np.array(current_path)) 453 | current_path = [] 454 | else: 455 | current_path.append(pt) 456 | if len(current_path) >= 2: 457 | masked_paths.append(np.array(current_path)) 458 | return masked_paths 459 | 460 | 461 | class VectorField(): 462 | def __init__(self, field_array): 463 | self.field = field_array 464 | self.shape = self.field.shape 465 | 466 | def __getitem__(self, pos): 467 | ''' pos should be (x, y) ''' 468 | round_pos = np.round(pos[:2]).astype(np.int64) 469 | round_pos = fit_inside(round_pos, self.field) 470 | 471 | return self.field[round_pos[1], round_pos[0], :] 472 | 473 | 474 | def rotate_field(field, degrees): 475 | s, c = np.sin(np.radians(degrees)), np.cos(np.radians(degrees)) 476 | R = np.array([[c, -s], 477 | [s, c]]) 478 | return np.matmul(R, field.reshape(-1, 2).T).T.reshape(field.shape) 479 | 480 | 481 | def fit_inside(xy, img): 482 | return np.clip(xy, 483 | np.array([0, 0], xy.dtype), 484 | np.array([img.shape[1] - 1, img.shape[0] - 1], xy.dtype)) 485 | 486 | 487 | def remap(x, src_min, src_max, dst_min, dst_max): 488 | x_01 = (x - src_min) / float(src_max - src_min) 489 | x_dst = x_01 * (dst_max - dst_min) + dst_min 490 | 491 | return x_dst 492 | 493 | 494 | def draw_fields_uniform(fields, d_sep_fn, d_test_fn=None, 495 | seedpoints_per_path=10, 496 | guide=None, 497 | min_length=0, max_length=20, 498 | search_ef=50, test_frequency=2, 499 | searcher_class=None): 500 | if d_test_fn is None: 501 | def d_test_fn(*args, **kwargs): 502 | return d_sep_fn(*args, **kwargs) / test_frequency 503 | 504 | H, W = fields[0].shape[:2] 505 | 506 | def should_stop(new_pos, searcher, path, d_sep_fn): 507 | if path.line_length < min_length: 508 | return False 509 | 510 | if not inside(np.round(new_pos), H, W): 511 | return True 512 | if searcher is not None: 513 | point = new_pos.copy() 514 | nearest = searcher.get_nearest(point) 515 | dist, pt = nearest 516 | if dist < d_sep_fn(new_pos): 517 | return True 518 | 519 | if path.line_length > max_length: 520 | return True 521 | 522 | # look for loops 523 | # candidate = np.round(new_pos).astype(np.int64).reshape(1, 2) 524 | # for pt in reversed(path): 525 | # if np.all(candidate == np.round(pt).astype(np.int64)): 526 | # return True 527 | return False 528 | 529 | searcher = searcher_class([np.array([-10, -10])], 530 | max_elements=64000, 531 | search_ef=search_ef) 532 | paths = [] 533 | seed_pos = np.array((W / 2, H / 2)) 534 | seedpoints = [seed_pos] 535 | seedpoints = deque(seedpoints) 536 | pbar = tqdm.tqdm() 537 | try: 538 | while True: 539 | # try to find a suitable seedpoint in the queue 540 | try: 541 | while True: 542 | seed_pos = seedpoints.pop() 543 | if not inside(np.round(seed_pos), H, W): 544 | continue 545 | 546 | dist, _ = searcher.get_nearest(seed_pos) 547 | if dist < d_sep_fn(seed_pos): 548 | continue 549 | 550 | break 551 | except IndexError: 552 | # no more seedpoints 553 | break 554 | 555 | start_field = np.random.randint(len(fields)) 556 | 557 | def select_field(path_len, direction): 558 | same_field_len = 10 559 | 560 | idx = int(direction * path_len // same_field_len) + start_field 561 | idx = idx % len(fields) 562 | return fields[idx] 563 | 564 | class MemorySelector(): 565 | def __init__(self, fields): 566 | self.same_field_len = 10 567 | self.cur_len = 0 568 | self.idx = np.random.randint(len(fields)) 569 | self.fields = fields 570 | 571 | def select_field(self, path_len, direction): 572 | if (path_len - self.cur_len) > self.same_field_len: 573 | self.cur_len = path_len 574 | idx_delta = np.random.randint(-1, 1 + 1) 575 | self.idx = (self.idx + idx_delta) % len(self.fields) 576 | 577 | return self.fields[self.idx] 578 | 579 | selector = MemorySelector(fields) 580 | 581 | path = compute_streamline(selector.select_field, seed_pos, 582 | searcher, 583 | d_test_fn, d_sep_fn, 584 | should_stop_fn=should_stop, 585 | searcher_class=searcher_class) 586 | if len(path) <= 2: 587 | # nothing found 588 | # logging.debug('streamline ended immediately') 589 | continue 590 | 591 | for pt in path: 592 | searcher.add_point(pt) 593 | paths.append(path) 594 | 595 | new_seedpoints = generate_seedpoints(path, d_sep_fn, 596 | seedpoints_per_path) 597 | order = np.arange(len(new_seedpoints)) 598 | np.random.shuffle(order) 599 | seedpoints.extend([new_seedpoints[i] for i in order]) 600 | pbar.update(1) 601 | except KeyboardInterrupt: 602 | pass 603 | 604 | pbar.close() 605 | return paths 606 | 607 | 608 | def inside(xy_pt, H, W): 609 | return (xy_pt[0] >= 0 and 610 | xy_pt[1] >= 0 and 611 | xy_pt[0] < W and 612 | xy_pt[1] < H) 613 | 614 | 615 | def compute_streamline(field_getter, seed_pos, searcher, d_test_fn, d_sep_fn, 616 | should_stop_fn, searcher_class): 617 | direction_sign = 1 # first go with the field 618 | pos = seed_pos.copy() 619 | paths = [] 620 | path = LinePath() 621 | path.append(pos.copy()) 622 | stop_tracking = False 623 | self_searcher = searcher_class([(-20, -20)]) 624 | while True: 625 | field = field_getter(path.line_length, direction_sign) 626 | rk_force = runge_kutta(field, pos, d_test_fn(pos)) * direction_sign 627 | new_pos = pos + d_test_fn(pos) * rk_force 628 | 629 | # test validity 630 | if should_stop_fn(new_pos, searcher, path, d_sep_fn): 631 | stop_tracking = True 632 | 633 | # prevent soft looping 634 | nearest_dist, _ = self_searcher.get_nearest(new_pos) 635 | if nearest_dist < d_sep_fn(pos): 636 | stop_tracking = True 637 | lookback = 15 638 | if len(path) >= 2 * lookback: 639 | self_searcher.add_point(path[-lookback]) 640 | 641 | # fallback 642 | if len(path) >= 600: 643 | stop_tracking = True 644 | 645 | if not stop_tracking: 646 | path.append(new_pos.copy()) 647 | 648 | if stop_tracking: 649 | paths.append(path.data) 650 | if direction_sign == 1: 651 | # go to the other side from the seed 652 | direction_sign = -1 653 | pos = seed_pos.copy() 654 | path = LinePath() 655 | path.append(pos.copy()) 656 | # self_searcher = searcher([(-20, -20)]) 657 | stop_tracking = False 658 | else: 659 | # both directions finished 660 | break 661 | else: 662 | pos = new_pos 663 | singleline = list(reversed(paths[1])) 664 | singleline.extend(paths[0][1:]) 665 | singleline = np.array(singleline) 666 | 667 | return singleline 668 | 669 | 670 | def generate_seedpoints(path, d_sep_fn, N_seedpoints=10): 671 | # go along the path and create points perpendicular in d_sep distance 672 | seeds = [] 673 | seedpoint_positions = np.linspace(0, len(path) - 1, N_seedpoints) 674 | seedpoint_ids = np.unique(np.round(seedpoint_positions)).tolist() 675 | 676 | cur_xy = path[0] 677 | direction = path[1] - path[0] 678 | direction /= max(norm_2vec(direction), eps) 679 | normal = np.array((direction[1], -direction[0])) 680 | margin = 1.1 681 | seeds.append(cur_xy + margin * d_sep_fn(cur_xy) * normal) 682 | seeds.append(cur_xy - margin * d_sep_fn(cur_xy) * normal) 683 | 684 | seeds.append(cur_xy - margin * d_sep_fn(cur_xy) * direction) 685 | seeds.append(cur_xy - margin * d_sep_fn(cur_xy) * direction + 686 | margin * d_sep_fn(cur_xy) * normal) 687 | seeds.append(cur_xy - margin * d_sep_fn(cur_xy) * direction - 688 | margin * d_sep_fn(cur_xy) * normal) 689 | 690 | for i in range(1, len(path)): 691 | if i not in seedpoint_ids: 692 | continue 693 | last_xy = cur_xy.copy() 694 | cur_xy = path[i] 695 | direction = cur_xy - last_xy 696 | direction /= max(norm_2vec(direction), eps) 697 | normal = np.array((direction[1], -direction[0])) 698 | seeds.append(cur_xy + margin * d_sep_fn(cur_xy) * normal) 699 | seeds.append(cur_xy - margin * d_sep_fn(cur_xy) * normal) 700 | 701 | seeds.append(cur_xy + margin * d_sep_fn(cur_xy) * direction) 702 | seeds.append(cur_xy + margin * d_sep_fn(cur_xy) * direction + 703 | margin * d_sep_fn(cur_xy) * normal) 704 | seeds.append(cur_xy + margin * d_sep_fn(cur_xy) * direction - 705 | margin * d_sep_fn(cur_xy) * normal) 706 | 707 | return seeds 708 | 709 | 710 | def runge_kutta(field, pos, h): 711 | k1 = field[pos] 712 | 713 | k2_pos = pos + (h / 2) * k1 714 | k2 = field[k2_pos] 715 | 716 | k3_pos = pos + (h / 2) * k2 717 | k3 = field[k3_pos] 718 | 719 | k4_pos = pos + h * k3 720 | k4 = field[k4_pos] 721 | 722 | # Runge-Kutta for the win 723 | rk = (1 / 6) * (k1 + 2 * k2 + 2 * k3 + k4) 724 | return rk 725 | 726 | 727 | def resize_to_max(img, max_sz): 728 | H_scale = max_sz / img.shape[0] 729 | W_scale = max_sz / img.shape[1] 730 | 731 | scale = min(H_scale, W_scale) 732 | return cv2.resize(img, None, fx=scale, fy=scale) 733 | 734 | 735 | class HNSWSearcher: 736 | def __init__(self, points, max_elements=1000, search_ef=50): 737 | self.index = hnswlib.Index(space='l2', dim=2) 738 | self.max_elements = max_elements 739 | self.index.init_index(max_elements=self.max_elements, 740 | ef_construction=200, M=16) 741 | self.search_ef = search_ef 742 | self.index.set_ef(search_ef) 743 | self.index.set_num_threads(4) 744 | for point in points: 745 | self.add_point(point) 746 | 747 | def add_point(self, point): 748 | if self.index.element_count == self.max_elements: 749 | self.resize_index() 750 | to_insert = np.array(point).reshape(1, 2) 751 | self.index.add_items(to_insert) 752 | 753 | def resize_index(self): 754 | self.max_elements = 2 * self.max_elements 755 | logger.debug(f'Resizing searcher index to {self.max_elements}') 756 | self.index.resize_index(self.max_elements) 757 | logger.debug('after resize:') 758 | logger.debug(f"self.index.max_elements: {self.index.max_elements}") 759 | logger.debug(f"self.index.element_count: {self.index.element_count}") 760 | self.index.set_ef(self.search_ef) 761 | 762 | def get_nearest(self, query): 763 | to_query = np.array(query).reshape(1, 2) 764 | labels, distances_sq = self.index.knn_query(to_query, k=1) 765 | distances = np.sqrt(distances_sq) 766 | return distances, labels 767 | 768 | 769 | class LinePath: 770 | ''' wrapper around list of coordinates, that keeps current path length ''' 771 | 772 | def __init__(self): 773 | self.data = [] 774 | self.line_length = 0 775 | 776 | def append(self, point): 777 | self.data.append(point) 778 | if len(self.data) > 1: 779 | self.line_length += norm_2vec(self.data[-2] - self.data[-1]) 780 | 781 | def __len__(self): 782 | return len(self.data) 783 | 784 | def __getitem__(self, i): 785 | return self.data[i] 786 | 787 | 788 | @contextlib.contextmanager 789 | def tmp_np_seed(seed): 790 | if seed is None: 791 | yield 792 | else: 793 | state = np.random.get_state() 794 | np.random.seed(seed) 795 | try: 796 | yield 797 | finally: 798 | np.random.set_state(state) 799 | --------------------------------------------------------------------------------