├── .gitignore ├── LICENSE.txt ├── README.md ├── app ├── .gitignore ├── app-release.apk ├── build.gradle ├── proguard-rules.pro └── src │ ├── androidTest │ └── java │ │ └── cn │ │ └── hugeterry │ │ └── ployfun │ │ └── ApplicationTest.java │ ├── main │ ├── AndroidManifest.xml │ ├── java │ │ └── cn │ │ │ └── hugeterry │ │ │ └── ployfun │ │ │ ├── PolyfunKey.java │ │ │ ├── activity │ │ │ ├── AboutActivity.java │ │ │ └── MainActivity.java │ │ │ ├── core │ │ │ ├── StartPolyFun.java │ │ │ └── delaunay │ │ │ │ ├── ArraySet.java │ │ │ │ ├── Graph.java │ │ │ │ ├── Pnt.java │ │ │ │ ├── Triangle.java │ │ │ │ └── Triangulation.java │ │ │ ├── model │ │ │ └── PointBean.java │ │ │ └── utils │ │ │ ├── ConvertGreyImg.java │ │ │ ├── DrawTriangle.java │ │ │ ├── GetPhoto.java │ │ │ ├── SavePhoto.java │ │ │ └── ShareUtils.java │ └── res │ │ ├── drawable │ │ ├── ic_arrow_white_24dp.xml │ │ ├── ic_done_white_24dp.xml │ │ ├── ic_save_white_24dp.xml │ │ ├── ic_share_white_24dp.xml │ │ ├── photo.png │ │ ├── photos.xml │ │ └── view_shadow.xml │ │ ├── layout │ │ ├── activity_about.xml │ │ └── activity_main.xml │ │ ├── menu │ │ ├── menu_about.xml │ │ └── menu_main.xml │ │ ├── mipmap-hdpi │ │ ├── lowpoly_logo.png │ │ └── me.png │ │ ├── values-w820dp │ │ └── dimens.xml │ │ └── values │ │ ├── colors.xml │ │ ├── dimens.xml │ │ ├── strings.xml │ │ └── styles.xml │ └── test │ └── java │ └── cn │ └── hugeterry │ └── ployfun │ └── ExampleUnitTest.java ├── build.gradle ├── gradle.properties ├── gradle └── wrapper │ ├── gradle-wrapper.jar │ └── gradle-wrapper.properties ├── gradlew ├── gradlew.bat ├── settings.gradle └── showUI ├── 1.jpg ├── 2.jpg ├── 3.jpg ├── sample01.jpg ├── sample02.jpg ├── sample03.jpg ├── sample04.jpg ├── sample_res01.png ├── sample_res02.png ├── sample_res03.png └── sample_res04.png /.gitignore: -------------------------------------------------------------------------------- 1 | .gradle 2 | /local.properties 3 | /.idea/workspace.xml 4 | .DS_Store 5 | /build 6 | # built application files 7 | *.apk 8 | *.ap_ 9 | 10 | # files for the dex VM 11 | *.dex 12 | 13 | # Java class files 14 | *.class 15 | .DS_Store 16 | 17 | # generated files 18 | bin/ 19 | gen/ 20 | Wiki/ 21 | 22 | # Local configuration file (sdk path, etc) 23 | local.properties 24 | 25 | # Eclipse project files 26 | .classpath 27 | .project 28 | .settings/ 29 | 30 | # Proguard folder generated by Eclipse 31 | proguard/ 32 | 33 | #Android Studio 34 | build/ 35 | 36 | # Intellij project files 37 | *.iml 38 | *.ipr 39 | *.iws 40 | .idea/ 41 | 42 | #gradle 43 | .gradle/ -------------------------------------------------------------------------------- /LICENSE.txt: -------------------------------------------------------------------------------- 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 | # PolyFun Android APP 2 | 3 | - 为你的图片生成Low Poly风格图片的app 4 | - 通过一张输入图像，输出其对应的 low-poly 图 5 | - 直接下载：[http://fir.im/polyfun](http://fir.im/polyfun) 6 | 7 | ## Demo 8 | 9 | 10 | ## 图片结果 11 | 12 | 13 | 14 | 15 | 16 | 17 | ## 算法 18 | - 通过灰度转化图片取边缘点以及随机取点 19 | - Delaunay三角剖分算法: 将生成的点组成三角形 20 | - 取三角形中点颜色为三角形颜色进行绘图 21 | - 完成 22 | 23 | ## 开源协议 24 | 25 | [GPL v3](LICENSE) 26 | -------------------------------------------------------------------------------- /app/.gitignore: -------------------------------------------------------------------------------- 1 | /build 2 | -------------------------------------------------------------------------------- /app/app-release.apk: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hugeterry/PloyFun/01dfae6b4752ec73d80bd8e1e517f253a51e7030/app/app-release.apk -------------------------------------------------------------------------------- /app/build.gradle: -------------------------------------------------------------------------------- 1 | apply plugin: 'com.android.application' 2 | 3 | android { 4 | compileSdkVersion 25 5 | buildToolsVersion '26.0.2' 6 | 7 | defaultConfig { 8 | applicationId "cn.hugeterry.ployfun" 9 | minSdkVersion 15 10 | targetSdkVersion 25 11 | versionCode 4 12 | versionName "1.0.2" 13 | } 14 | buildTypes { 15 | release { 16 | minifyEnabled false 17 | proguardFiles getDefaultProguardFile('proguard-android.txt'), 'proguard-rules.pro' 18 | } 19 | } 20 | } 21 | 22 | dependencies { 23 | compile fileTree(dir: 'libs', include: ['*.jar']) 24 | testCompile 'junit:junit:4.12' 25 | compile 'com.android.support:appcompat-v7:25.1.0' 26 | compile 'com.android.support:design:25.1.0' 27 | 28 | //自己开源的应用更新库https://github.com/hugeterry/UpdateDemo 29 | compile 'cn.hugeterry.updatefun:updatefun:1.8.4' 30 | } 31 | -------------------------------------------------------------------------------- /app/proguard-rules.pro: -------------------------------------------------------------------------------- 1 | # Add project specific ProGuard rules here. 2 | # By default, the flags in this file are appended to flags specified 3 | # in /Users/admin/Library/Android/sdk/tools/proguard/proguard-android.txt 4 | # You can edit the include path and order by changing the proguardFiles 5 | # directive in build.gradle. 6 | # 7 | # For more details, see 8 | # http://developer.android.com/guide/developing/tools/proguard.html 9 | 10 | # Add any project specific keep options here: 11 | 12 | # If your project uses WebView with JS, uncomment the following 13 | # and specify the fully qualified class name to the JavaScript interface 14 | # class: 15 | #-keepclassmembers class fqcn.of.javascript.interface.for.webview { 16 | # public *; 17 | #} 18 | -------------------------------------------------------------------------------- /app/src/androidTest/java/cn/hugeterry/ployfun/ApplicationTest.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun; 2 | 3 | import android.app.Application; 4 | import android.test.ApplicationTestCase; 5 | 6 | /** 7 | * Testing Fundamentals 8 | */ 9 | public class ApplicationTest extends ApplicationTestCase { 10 | public ApplicationTest() { 11 | super(Application.class); 12 | } 13 | } -------------------------------------------------------------------------------- /app/src/main/AndroidManifest.xml: -------------------------------------------------------------------------------- 1 | 2 | 4 | 5 | 6 | 7 | 8 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/PolyfunKey.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun; 2 | 3 | /** 4 | * Created by hugeterry(http://hugeterry.cn) 5 | * Date: 16/5/1 16:28 6 | */ 7 | public class PolyfunKey { 8 | public static final int graMax = 30;//边缘检测的阀值控制，值越大，出来的点越少 9 | public static int pc = 600;//最后绘制的点数量控制 10 | public static final int initialSize = 4000;//包围三角形的大小 11 | } 12 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/activity/AboutActivity.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.activity; 2 | 3 | import android.os.Bundle; 4 | import android.support.v7.app.AppCompatActivity; 5 | import android.support.v7.widget.Toolbar; 6 | import android.view.Menu; 7 | import android.view.MenuItem; 8 | import android.widget.TextView; 9 | 10 | import cn.hugeterry.ployfun.BuildConfig; 11 | import cn.hugeterry.ployfun.R; 12 | import cn.hugeterry.ployfun.utils.ShareUtils; 13 | 14 | /** 15 | * Created by hugeterry(http://hugeterry.cn) 16 | * Date: 16/2/24 02:24 17 | */ 18 | public class AboutActivity extends AppCompatActivity { 19 | private Toolbar toolbar; 20 | private TextView tv_version; 21 | 22 | @Override 23 | protected void onCreate(Bundle savedInstanceState) { 24 | super.onCreate(savedInstanceState); 25 | setContentView(R.layout.activity_about); 26 | 27 | initToolbar(); 28 | initVersionTextView(); 29 | } 30 | 31 | private void initVersionTextView() { 32 | tv_version = (TextView) findViewById(R.id.about_version); 33 | tv_version.setText("Version:" + BuildConfig.VERSION_NAME); 34 | } 35 | 36 | private void initToolbar() { 37 | toolbar = (Toolbar) findViewById(R.id.toolbar); 38 | setSupportActionBar(toolbar); 39 | getSupportActionBar().setDisplayHomeAsUpEnabled(true); 40 | getSupportActionBar().setHomeAsUpIndicator(R.drawable.ic_arrow_white_24dp); 41 | getSupportActionBar().setTitle("关于"); 42 | } 43 | 44 | @Override 45 | public boolean onCreateOptionsMenu(Menu menu) { 46 | getMenuInflater().inflate(R.menu.menu_about, menu); 47 | return super.onCreateOptionsMenu(menu); 48 | } 49 | 50 | @Override 51 | public boolean onOptionsItemSelected(MenuItem item) { 52 | switch (item.getItemId()) { 53 | case android.R.id.home: 54 | finish(); 55 | break; 56 | case R.id.action_share: 57 | ShareUtils.shareText(this, "「PolyFun」为你喜欢的图片添上低平面风 下载地址：http://fir.im/polyfun"); 58 | break; 59 | } 60 | return super.onOptionsItemSelected(item); 61 | } 62 | 63 | } 64 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/activity/MainActivity.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.activity; 2 | 3 | import android.content.Intent; 4 | import android.graphics.Bitmap; 5 | 6 | import android.net.Uri; 7 | import android.provider.MediaStore; 8 | import android.support.design.widget.Snackbar; 9 | import android.support.v7.app.AppCompatActivity; 10 | import android.os.Bundle; 11 | import android.support.v7.widget.Toolbar; 12 | import android.util.Log; 13 | import android.view.Menu; 14 | import android.view.MenuItem; 15 | import android.view.View; 16 | import android.widget.Button; 17 | import android.widget.ImageView; 18 | import android.widget.LinearLayout; 19 | import android.widget.SeekBar; 20 | import android.widget.TextView; 21 | 22 | import cn.hugeterry.ployfun.PolyfunKey; 23 | import cn.hugeterry.ployfun.R; 24 | import cn.hugeterry.ployfun.core.StartPolyFun; 25 | import cn.hugeterry.ployfun.utils.GetPhoto; 26 | import cn.hugeterry.ployfun.utils.SavePhoto; 27 | import cn.hugeterry.ployfun.utils.ShareUtils; 28 | import cn.hugeterry.updatefun.UpdateFunGO; 29 | import cn.hugeterry.updatefun.config.UpdateKey; 30 | 31 | /** 32 | * Created by hugeterry(http://hugeterry.cn) 33 | * Date: 16/6/7 13:24 34 | */ 35 | public class MainActivity extends AppCompatActivity { 36 | private Uri uri; 37 | private String path; 38 | public LinearLayout ll_choose; 39 | public LinearLayout ll_result; 40 | public ImageView iv; 41 | private Toolbar toolbar; 42 | private Button bt_save, bt_share; 43 | private SeekBar seekbar; 44 | private TextView seekbar_count; 45 | public LinearLayout progressbar; 46 | private boolean isDone = false; 47 | 48 | @Override 49 | protected void onCreate(Bundle savedInstanceState) { 50 | super.onCreate(savedInstanceState); 51 | setContentView(R.layout.activity_main); 52 | 53 | setupUpdate(); 54 | initToolbar(); 55 | initView(); 56 | } 57 | 58 | /** 59 | * 更新模块 60 | */ 61 | private void setupUpdate() { 62 | UpdateKey.API_TOKEN = ""; 63 | UpdateKey.APP_ID = "57b14ee3ca87a87c1b0009e6"; 64 | //UpdateKey.DialogOrNotification=UpdateKey.WITH_DIALOG;通过Dialog来进行下载 65 | UpdateFunGO.init(this); 66 | } 67 | 68 | private void initToolbar() { 69 | toolbar = (Toolbar) findViewById(R.id.toolbar); 70 | setSupportActionBar(toolbar); 71 | } 72 | 73 | private void initView() { 74 | iv = (ImageView) findViewById(R.id.iv); 75 | ll_choose = (LinearLayout) findViewById(R.id.ll_choose); 76 | ll_result = (LinearLayout) findViewById(R.id.ll_result); 77 | bt_save = (Button) findViewById(R.id.bt_save); 78 | bt_share = (Button) findViewById(R.id.bt_share); 79 | seekbar = (SeekBar) findViewById(R.id.seekbar); 80 | seekbar_count = (TextView) findViewById(R.id.seekbar_count); 81 | progressbar = (LinearLayout) findViewById(R.id.progressbar); 82 | 83 | bt_save.setOnClickListener(new View.OnClickListener() { 84 | @Override 85 | public void onClick(View v) { 86 | if (path == null || path.length() == 0) { 87 | path = SavePhoto.writePhoto(iv.getDrawingCache()); 88 | SavePhoto.scanPhotos(path, MainActivity.this); 89 | Snackbar.make(iv, "已保存到" + path, Snackbar.LENGTH_LONG).show(); 90 | } else Snackbar.make(bt_save, "该图片已保存", Snackbar.LENGTH_SHORT).show(); 91 | } 92 | 93 | 94 | }); 95 | bt_share.setOnClickListener(new View.OnClickListener() { 96 | @Override 97 | public void onClick(View v) { 98 | if (path == null || path.length() == 0) { 99 | path = SavePhoto.writePhoto(iv.getDrawingCache()); 100 | SavePhoto.scanPhotos(path, MainActivity.this); 101 | Snackbar.make(iv, "已保存到" + path, Snackbar.LENGTH_LONG).show(); 102 | } 103 | ShareUtils.shareImage(MainActivity.this, path); 104 | } 105 | }); 106 | 107 | seekbar.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() { 108 | @Override 109 | public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) { 110 | seekbar_count.setText(progress + 600 + ""); 111 | } 112 | 113 | @Override 114 | public void onStartTrackingTouch(SeekBar seekBar) { 115 | } 116 | 117 | @Override 118 | public void onStopTrackingTouch(SeekBar seekBar) { 119 | PolyfunKey.pc = seekBar.getProgress() + 600; 120 | Log.i("PolyFun pc", PolyfunKey.pc + ""); 121 | } 122 | }); 123 | } 124 | 125 | @Override 126 | public boolean onCreateOptionsMenu(Menu menu) { 127 | getMenuInflater().inflate(R.menu.menu_main, menu); 128 | return super.onCreateOptionsMenu(menu); 129 | } 130 | 131 | @Override 132 | public boolean onOptionsItemSelected(MenuItem item) { 133 | switch (item.getItemId()) { 134 | case R.id.action_choose: 135 | path = null; 136 | isDone = false; 137 | ll_result.setVisibility(View.INVISIBLE); 138 | ll_choose.setVisibility(View.VISIBLE); 139 | GetPhoto.gallery(MainActivity.this); 140 | break; 141 | case R.id.action_done: 142 | if (uri != null) { 143 | if (!isDone) { 144 | new StartPolyFun(this).start(); 145 | } else Snackbar.make(iv, "已经制作完了，请重新选择图片", Snackbar.LENGTH_LONG).show(); 146 | } else Snackbar.make(iv, "请先选择图片再制作", Snackbar.LENGTH_LONG).show(); 147 | isDone = true; 148 | break; 149 | case R.id.action_about_me: 150 | ShareUtils.shareUri(this, "http://www.hugeterry.cn/about"); 151 | break; 152 | case R.id.action_about: 153 | Intent intent_about = new Intent(this, AboutActivity.class); 154 | startActivity(intent_about); 155 | break; 156 | } 157 | return super.onOptionsItemSelected(item); 158 | } 159 | 160 | @Override 161 | public void onActivityResult(int requestCode, int resultCode, Intent data) { 162 | super.onActivityResult(requestCode, resultCode, data); 163 | switch (requestCode) { 164 | case 12: 165 | if (resultCode == RESULT_OK) { 166 | uri = data.getData(); 167 | Log.i("uri", uri + ""); 168 | Bitmap image; 169 | try { 170 | image = MediaStore.Images.Media.getBitmap(getContentResolver(), uri); 171 | iv.setImageBitmap(image); 172 | } catch (Exception e) { 173 | e.printStackTrace(); 174 | } 175 | } 176 | break; 177 | } 178 | } 179 | 180 | @Override 181 | protected void onResume() { 182 | super.onResume(); 183 | UpdateFunGO.onResume(this); 184 | } 185 | 186 | @Override 187 | protected void onStop() { 188 | super.onStop(); 189 | UpdateFunGO.onStop(this); 190 | } 191 | } 192 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/core/StartPolyFun.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.core; 2 | 3 | import android.app.Activity; 4 | import android.content.Context; 5 | import android.graphics.Bitmap; 6 | import android.graphics.Canvas; 7 | import android.os.Handler; 8 | import android.os.Message; 9 | import android.util.Log; 10 | import android.view.View; 11 | 12 | import java.lang.ref.WeakReference; 13 | import java.util.ArrayList; 14 | import java.util.Collections; 15 | import java.util.List; 16 | import java.util.Random; 17 | 18 | import cn.hugeterry.ployfun.model.PointBean; 19 | import cn.hugeterry.ployfun.PolyfunKey; 20 | import cn.hugeterry.ployfun.activity.MainActivity; 21 | import cn.hugeterry.ployfun.core.delaunay.Pnt; 22 | import cn.hugeterry.ployfun.core.delaunay.Triangle; 23 | import cn.hugeterry.ployfun.core.delaunay.Triangulation; 24 | import cn.hugeterry.ployfun.utils.ConvertGreyImg; 25 | import cn.hugeterry.ployfun.utils.DrawTriangle; 26 | 27 | /** 28 | * Created by hugeterry(http://hugeterry.cn) 29 | * Date: 16/8/13 11:34 30 | */ 31 | public class StartPolyFun extends Thread { 32 | private static final int POLY_START = 1; 33 | private static final int POLY_STOP = 2; 34 | 35 | public Triangulation dt; 36 | public List pnts = new ArrayList<>(); 37 | public long time = System.currentTimeMillis(); 38 | 39 | private Canvas canvas; 40 | private static Bitmap bmp; 41 | 42 | private int xd, yd; 43 | private int x, y; 44 | private int cx, cy, rgb; 45 | private int in = 0; 46 | 47 | private Context context; 48 | private Handler handler; 49 | 50 | public StartPolyFun(Context context) { 51 | this.context = context; 52 | handler = new PolyHandler((Activity) context); 53 | } 54 | 55 | static class PolyHandler extends Handler { 56 | WeakReference mActivityReference; 57 | 58 | PolyHandler(Activity activity) { 59 | mActivityReference = new WeakReference<>(activity); 60 | } 61 | 62 | @Override 63 | public void handleMessage(Message msg) { 64 | MainActivity activity = (MainActivity) mActivityReference.get(); 65 | if (activity != null) { 66 | switch (msg.what) { 67 | case POLY_START: 68 | if (activity.progressbar.getVisibility() == View.GONE) { 69 | activity.progressbar.setVisibility(View.VISIBLE); 70 | Log.i("PolyFun progress", "start"); 71 | } 72 | break; 73 | case POLY_STOP: 74 | activity.iv.setImageBitmap(bmp); 75 | if (activity.progressbar.getVisibility() == View.VISIBLE) { 76 | activity.progressbar.setVisibility(View.GONE); 77 | Log.i("PolyFun progress", "stop"); 78 | } 79 | activity.ll_choose.setVisibility(View.INVISIBLE); 80 | activity.ll_result.setVisibility(View.VISIBLE); 81 | if (bmp != null) { 82 | bmp = null; 83 | } 84 | break; 85 | default: 86 | break; 87 | } 88 | } 89 | } 90 | } 91 | 92 | @Override 93 | public void run() { 94 | handler.sendEmptyMessage(POLY_START); 95 | 96 | if (((MainActivity) context).iv.isDrawingCacheEnabled()) { 97 | ((MainActivity) context).iv.destroyDrawingCache(); 98 | Log.i("PolyFun TAG", "destory drawing cache"); 99 | } 100 | ((MainActivity) context).iv.setDrawingCacheEnabled(true); 101 | //这是包围三角形的诞生地... 102 | Triangle initialTriangle = new Triangle( 103 | new Pnt(-PolyfunKey.initialSize, -PolyfunKey.initialSize), 104 | new Pnt(PolyfunKey.initialSize, -PolyfunKey.initialSize), 105 | new Pnt(0, PolyfunKey.initialSize)); 106 | dt = new Triangulation(initialTriangle); 107 | bmp = ((MainActivity) context).iv.getDrawingCache(); 108 | int height = bmp.getHeight(); 109 | int width = bmp.getWidth(); 110 | Log.i("PolyFun TAG", "height:" + height + ",width:" + width); 111 | //加入四个端点 112 | dt.delaunayPlace(new Pnt(1, 1)); 113 | dt.delaunayPlace(new Pnt(1, height - 1)); 114 | dt.delaunayPlace(new Pnt(width - 1, 1)); 115 | dt.delaunayPlace(new Pnt(width - 1, height - 1)); 116 | //随机加入一些点 117 | Random random = new Random(System.currentTimeMillis()); 118 | for (int i = 0; i < 50; i++) { 119 | int x = random.nextInt(width); 120 | int y = random.nextInt(height); 121 | dt.delaunayPlace(new Pnt(x, y)); 122 | } 123 | //灰度取点 124 | Bitmap resultBitmap = ConvertGreyImg.convertGreyImg(bmp); 125 | canvas = new Canvas(bmp); 126 | for (int y = 1; y < height - 1; ++y) { 127 | for (int x = 1; x < width - 1; ++x) { 128 | int rgb = resultBitmap.getPixel(x, y); 129 | rgb = (rgb & 0xff0000) >> 16;//留灰度 130 | if (rgb > PolyfunKey.graMax) { 131 | pnts.add(new PointBean(x, y)); 132 | } 133 | } 134 | } 135 | Log.i("PolyFun TAG", "未过滤点集有" + pnts.size() + "个，正在随机排序"); 136 | Collections.shuffle(pnts); 137 | int count = Math.min(pnts.size(), PolyfunKey.pc); 138 | Log.i("PolyFun TAG", "正在加入点并剖分三角，请耐心等待"); 139 | for (int i = 0; i < count; i++) { 140 | PointBean p = pnts.get(i); 141 | // bmp.setPixel(p.x, p.y, 0xffffffff);用来观测加入的三角点 142 | dt.delaunayPlace(new Pnt(p.x, p.y)); 143 | } 144 | 145 | Log.i("PolyFun TAG", "开始绘制最终结果"); 146 | //取出所有三角形 147 | for (Triangle triangle : dt) { 148 | xd = 0; 149 | yd = 0; 150 | Pnt[] vertices = triangle.toArray(new Pnt[0]);//取出三个点 151 | 152 | in = 3; 153 | //判断三个点都在图片内 154 | for (Pnt pnt : vertices) { 155 | x = (int) pnt.coord(0); 156 | y = (int) pnt.coord(1); 157 | xd += x; 158 | yd += y; 159 | if (x < 0 || x > width || y < 0 || y > height) { 160 | in -= 1; 161 | } 162 | } 163 | //三个点都在图内,才画三角形 164 | if (in == 3) { 165 | //取中点颜色 166 | cx = xd / 3; 167 | cy = yd / 3; 168 | rgb = bmp.getPixel(cx, cy);//三角形填充色 169 | //绘画图形 170 | DrawTriangle.drawTriangle(vertices, rgb, canvas, context.getResources()); 171 | } 172 | 173 | } 174 | 175 | // canvas.drawBitmap(bmp, width, height, p); 176 | 177 | handler.sendEmptyMessage(POLY_STOP); 178 | Log.i("PolyFun TAG", "输出图片完成！耗时" + (System.currentTimeMillis() - time) + "ms"); 179 | } 180 | 181 | } 182 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/core/delaunay/ArraySet.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.core.delaunay; 2 | 3 | /* 4 | * Copyright (c) 2007 by L. Paul Chew. 5 | * 6 | * Permission is hereby granted, without written agreement and without 7 | * license or royalty fees, to use, copy, modify, and distribute this 8 | * software and its documentation for any purpose, subject to the following 9 | * conditions: 10 | * 11 | * The above copyright notice and this permission notice shall be included 12 | * in all copies or substantial portions of the Software. 13 | * 14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 15 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 16 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 17 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 18 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 19 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 20 | * DEALINGS IN THE SOFTWARE. 21 | */ 22 | 23 | import java.util.AbstractSet; 24 | import java.util.ArrayList; 25 | import java.util.Collection; 26 | import java.util.Iterator; 27 | 28 | /** 29 | * An ArrayList implementation of Set. An ArraySet is good for small sets; it 30 | * has less overhead than a HashSet or a TreeSet. 31 | * 32 | * @author Paul Chew 33 | *

34 | * Created December 2007. For use with Voronoi/Delaunay applet. 35 | */ 36 | public class ArraySet extends AbstractSet { 37 | 38 | private ArrayList items; // Items of the set 39 | 40 | /** 41 | * Create an empty set (default initial capacity is 3). 42 | */ 43 | public ArraySet() { 44 | this(3); 45 | } 46 | 47 | /** 48 | * Create an empty set with the specified initial capacity. 49 | * 50 | * @param initialCapacity the initial capacity 51 | */ 52 | public ArraySet(int initialCapacity) { 53 | items = new ArrayList(initialCapacity); 54 | } 55 | 56 | /** 57 | * Create a set containing the items of the collection. Any duplicate 58 | * items are discarded. 59 | * 60 | * @param collection the source for the items of the small set 61 | */ 62 | public ArraySet(Collection collection) { 63 | items = new ArrayList(collection.size()); 64 | for (E item : collection) 65 | if (!items.contains(item)) items.add(item); 66 | } 67 | 68 | /** 69 | * Get the item at the specified index. 70 | * 71 | * @param index where the item is located in the ListSet 72 | * @return the item at the specified index 73 | * @throws IndexOutOfBoundsException if the index is out of bounds 74 | */ 75 | public E get(int index) throws IndexOutOfBoundsException { 76 | return items.get(index); 77 | } 78 | 79 | /** 80 | * True iff any member of the collection is also in the ArraySet. 81 | * 82 | * @param collection the Collection to check 83 | * @return true iff any member of collection appears in this ArraySet 84 | */ 85 | public boolean containsAny(Collection collection) { 86 | for (Object item : collection) 87 | if (this.contains(item)) return true; 88 | return false; 89 | } 90 | 91 | @Override 92 | public boolean add(E item) { 93 | if (items.contains(item)) return false; 94 | return items.add(item); 95 | } 96 | 97 | @Override 98 | public Iterator iterator() { 99 | return items.iterator(); 100 | } 101 | 102 | @Override 103 | public int size() { 104 | return items.size(); 105 | } 106 | 107 | } 108 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/core/delaunay/Graph.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.core.delaunay; 2 | 3 | 4 | /* 5 | * Copyright (c) 2007 by L. Paul Chew. 6 | * 7 | * Permission is hereby granted, without written agreement and without 8 | * license or royalty fees, to use, copy, modify, and distribute this 9 | * software and its documentation for any purpose, subject to the following 10 | * conditions: 11 | * 12 | * The above copyright notice and this permission notice shall be included 13 | * in all copies or substantial portions of the Software. 14 | * 15 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 16 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 18 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 20 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 21 | * DEALINGS IN THE SOFTWARE. 22 | */ 23 | 24 | 25 | import java.util.Collections; 26 | import java.util.HashMap; 27 | import java.util.Map; 28 | import java.util.Set; 29 | 30 | /** 31 | * Straightforward undirected graph implementation. 32 | * Nodes are generic type N. 33 | * 34 | * @author Paul Chew 35 | *

36 | * Created November, December 2007. For use in Delaunay/Voronoi code. 37 | */ 38 | public class Graph { 39 | 40 | private Map> theNeighbors = // Node -> adjacent nodes 41 | new HashMap>(); 42 | private Set theNodeSet = // Set view of all nodes 43 | Collections.unmodifiableSet(theNeighbors.keySet()); 44 | 45 | /** 46 | * Add a node. If node is already in graph then no change. 47 | * 48 | * @param node the node to add 49 | */ 50 | public void add(N node) { 51 | if (theNeighbors.containsKey(node)) return; 52 | theNeighbors.put(node, new ArraySet()); 53 | } 54 | 55 | /** 56 | * Add a link. If the link is already in graph then no change. 57 | * 58 | * @param nodeA one end of the link 59 | * @param nodeB the other end of the link 60 | * @throws NullPointerException if either endpoint is not in graph 61 | */ 62 | public void add(N nodeA, N nodeB) throws NullPointerException { 63 | theNeighbors.get(nodeA).add(nodeB); 64 | theNeighbors.get(nodeB).add(nodeA); 65 | } 66 | 67 | /** 68 | * Remove node and any links that use node. If node not in graph, nothing 69 | * happens. 70 | * 71 | * @param node the node to remove. 72 | */ 73 | public void remove(N node) { 74 | if (!theNeighbors.containsKey(node)) return; 75 | for (N neighbor : theNeighbors.get(node)) 76 | theNeighbors.get(neighbor).remove(node); // Remove "to" links 77 | theNeighbors.get(node).clear(); // Remove "from" links 78 | theNeighbors.remove(node); // Remove the node 79 | } 80 | 81 | /** 82 | * Remove the specified link. If link not in graph, nothing happens. 83 | * 84 | * @param nodeA one end of the link 85 | * @param nodeB the other end of the link 86 | * @throws NullPointerException if either endpoint is not in graph 87 | */ 88 | public void remove(N nodeA, N nodeB) throws NullPointerException { 89 | theNeighbors.get(nodeA).remove(nodeB); 90 | theNeighbors.get(nodeB).remove(nodeA); 91 | } 92 | 93 | /** 94 | * Report all the neighbors of node. 95 | * 96 | * @param node the node 97 | * @return the neighbors of node 98 | * @throws NullPointerException if node does not appear in graph 99 | */ 100 | public Set neighbors(N node) throws NullPointerException { 101 | return Collections.unmodifiableSet(theNeighbors.get(node)); 102 | } 103 | 104 | /** 105 | * Returns an unmodifiable Set view of the nodes contained in this graph. 106 | * The set is backed by the graph, so changes to the graph are reflected in 107 | * the set. 108 | * 109 | * @return a Set view of the graph's node set 110 | */ 111 | public Set nodeSet() { 112 | return theNodeSet; 113 | } 114 | 115 | } 116 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/core/delaunay/Pnt.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.core.delaunay; 2 | 3 | /* 4 | * Copyright (c) 2005, 2007 by L. Paul Chew. 5 | * 6 | * Permission is hereby granted, without written agreement and without 7 | * license or royalty fees, to use, copy, modify, and distribute this 8 | * software and its documentation for any purpose, subject to the following 9 | * conditions: 10 | * 11 | * The above copyright notice and this permission notice shall be included 12 | * in all copies or substantial portions of the Software. 13 | * 14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 15 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 16 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 17 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 18 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 19 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 20 | * DEALINGS IN THE SOFTWARE. 21 | */ 22 | 23 | /** 24 | * Points in Euclidean space, implemented as double[]. 25 | *

26 | * Includes simple geometric operations. 27 | * Uses matrices; a matrix is represented as an array of Pnts. 28 | * Uses simplices; a simplex is represented as an array of Pnts. 29 | * 30 | * @author Paul Chew 31 | *

32 | * Created July 2005. Derived from an earlier, messier version. 33 | *

34 | * Modified Novemeber 2007. Minor clean up. 35 | */ 36 | public class Pnt { 37 | 38 | private double[] coordinates; // The point's coordinates 39 | 40 | /** 41 | * Constructor. 42 | * 43 | * @param coords the coordinates 44 | */ 45 | public Pnt(double... coords) { 46 | // Copying is done here to ensure that Pnt's coords cannot be altered. 47 | // This is necessary because the double... notation actually creates a 48 | // constructor with double[] as its argument. 49 | coordinates = new double[coords.length]; 50 | System.arraycopy(coords, 0, coordinates, 0, coords.length); 51 | } 52 | 53 | @Override 54 | public String toString() { 55 | if (coordinates.length == 0) return "Pnt()"; 56 | String result = "Pnt(" + coordinates[0]; 57 | for (int i = 1; i < coordinates.length; i++) 58 | result = result + "," + coordinates[i]; 59 | result = result + ")"; 60 | return result; 61 | } 62 | 63 | @Override 64 | public boolean equals(Object other) { 65 | if (!(other instanceof Pnt)) return false; 66 | Pnt p = (Pnt) other; 67 | if (this.coordinates.length != p.coordinates.length) return false; 68 | for (int i = 0; i < this.coordinates.length; i++) 69 | if (this.coordinates[i] != p.coordinates[i]) return false; 70 | return true; 71 | } 72 | 73 | @Override 74 | public int hashCode() { 75 | int hash = 0; 76 | for (double c : this.coordinates) { 77 | long bits = Double.doubleToLongBits(c); 78 | hash = (31 * hash) ^ (int) (bits ^ (bits >> 32)); 79 | } 80 | return hash; 81 | } 82 | 83 | /* Pnts as vectors */ 84 | 85 | /** 86 | * @return the specified coordinate of this Pnt 87 | * @throws ArrayIndexOutOfBoundsException for bad coordinate 88 | */ 89 | public double coord(int i) { 90 | return this.coordinates[i]; 91 | } 92 | 93 | /** 94 | * @return this Pnt's dimension. 95 | */ 96 | public int dimension() { 97 | return coordinates.length; 98 | } 99 | 100 | /** 101 | * Check that dimensions match. 102 | * 103 | * @param p the Pnt to check (against this Pnt) 104 | * @return the dimension of the Pnts 105 | * @throws IllegalArgumentException if dimension fail to match 106 | */ 107 | public int dimCheck(Pnt p) { 108 | int len = this.coordinates.length; 109 | if (len != p.coordinates.length) 110 | throw new IllegalArgumentException("Dimension mismatch"); 111 | return len; 112 | } 113 | 114 | /** 115 | * Create a new Pnt by adding additional coordinates to this Pnt. 116 | * 117 | * @param coords the new coordinates (added on the right end) 118 | * @return a new Pnt with the additional coordinates 119 | */ 120 | public Pnt extend(double... coords) { 121 | double[] result = new double[coordinates.length + coords.length]; 122 | System.arraycopy(coordinates, 0, result, 0, coordinates.length); 123 | System.arraycopy(coords, 0, result, coordinates.length, coords.length); 124 | return new Pnt(result); 125 | } 126 | 127 | /** 128 | * Dot product. 129 | * 130 | * @param p the other Pnt 131 | * @return dot product of this Pnt and p 132 | */ 133 | public double dot(Pnt p) { 134 | int len = dimCheck(p); 135 | double sum = 0; 136 | for (int i = 0; i < len; i++) 137 | sum += this.coordinates[i] * p.coordinates[i]; 138 | return sum; 139 | } 140 | 141 | /** 142 | * Magnitude (as a vector). 143 | * 144 | * @return the Euclidean length of this vector 145 | */ 146 | public double magnitude() { 147 | return Math.sqrt(this.dot(this)); 148 | } 149 | 150 | /** 151 | * Subtract. 152 | * 153 | * @param p the other Pnt 154 | * @return a new Pnt = this - p 155 | */ 156 | public Pnt subtract(Pnt p) { 157 | int len = dimCheck(p); 158 | double[] coords = new double[len]; 159 | for (int i = 0; i < len; i++) 160 | coords[i] = this.coordinates[i] - p.coordinates[i]; 161 | return new Pnt(coords); 162 | } 163 | 164 | /** 165 | * Add. 166 | * 167 | * @param p the other Pnt 168 | * @return a new Pnt = this + p 169 | */ 170 | public Pnt add(Pnt p) { 171 | int len = dimCheck(p); 172 | double[] coords = new double[len]; 173 | for (int i = 0; i < len; i++) 174 | coords[i] = this.coordinates[i] + p.coordinates[i]; 175 | return new Pnt(coords); 176 | } 177 | 178 | /** 179 | * Angle (in radians) between two Pnts (treated as vectors). 180 | * 181 | * @param p the other Pnt 182 | * @return the angle (in radians) between the two Pnts 183 | */ 184 | public double angle(Pnt p) { 185 | return Math.acos(this.dot(p) / (this.magnitude() * p.magnitude())); 186 | } 187 | 188 | /** 189 | * Perpendicular bisector of two Pnts. 190 | * Works in any dimension. The coefficients are returned as a Pnt of one 191 | * higher dimension (e.g., (A,B,C,D) for an equation of the form 192 | * Ax + By + Cz + D = 0). 193 | * 194 | * @param point the other point 195 | * @return the coefficients of the perpendicular bisector 196 | */ 197 | public Pnt bisector(Pnt point) { 198 | dimCheck(point); 199 | Pnt diff = this.subtract(point); 200 | Pnt sum = this.add(point); 201 | double dot = diff.dot(sum); 202 | return diff.extend(-dot / 2); 203 | } 204 | 205 | /* Pnts as matrices */ 206 | 207 | /** 208 | * Create a String for a matrix. 209 | * 210 | * @param matrix the matrix (an array of Pnts) 211 | * @return a String represenation of the matrix 212 | */ 213 | public static String toString(Pnt[] matrix) { 214 | StringBuilder buf = new StringBuilder("{"); 215 | for (Pnt row : matrix) buf.append(" " + row); 216 | buf.append(" }"); 217 | return buf.toString(); 218 | } 219 | 220 | /** 221 | * Compute the determinant of a matrix (array of Pnts). 222 | * This is not an efficient implementation, but should be adequate 223 | * for low dimension. 224 | * 225 | * @param matrix the matrix as an array of Pnts 226 | * @return the determinnant of the input matrix 227 | * @throws IllegalArgumentException if dimensions are wrong 228 | */ 229 | public static double determinant(Pnt[] matrix) { 230 | if (matrix.length != matrix[0].dimension()) 231 | throw new IllegalArgumentException("Matrix is not square"); 232 | boolean[] columns = new boolean[matrix.length]; 233 | for (int i = 0; i < matrix.length; i++) columns[i] = true; 234 | try { 235 | return determinant(matrix, 0, columns); 236 | } catch (ArrayIndexOutOfBoundsException e) { 237 | throw new IllegalArgumentException("Matrix is wrong shape"); 238 | } 239 | } 240 | 241 | /** 242 | * Compute the determinant of a submatrix specified by starting row 243 | * and by "active" columns. 244 | * 245 | * @param matrix the matrix as an array of Pnts 246 | * @param row the starting row 247 | * @param columns a boolean array indicating the "active" columns 248 | * @return the determinant of the specified submatrix 249 | * @throws ArrayIndexOutOfBoundsException if dimensions are wrong 250 | */ 251 | private static double determinant(Pnt[] matrix, int row, boolean[] columns) { 252 | if (row == matrix.length) return 1; 253 | double sum = 0; 254 | int sign = 1; 255 | for (int col = 0; col < columns.length; col++) { 256 | if (!columns[col]) continue; 257 | columns[col] = false; 258 | sum += sign * matrix[row].coordinates[col] * 259 | determinant(matrix, row + 1, columns); 260 | columns[col] = true; 261 | sign = -sign; 262 | } 263 | return sum; 264 | } 265 | 266 | /** 267 | * Compute generalized cross-product of the rows of a matrix. 268 | * The result is a Pnt perpendicular (as a vector) to each row of 269 | * the matrix. This is not an efficient implementation, but should 270 | * be adequate for low dimension. 271 | * 272 | * @param matrix the matrix of Pnts (one less row than the Pnt dimension) 273 | * @return a Pnt perpendicular to each row Pnt 274 | * @throws IllegalArgumentException if matrix is wrong shape 275 | */ 276 | public static Pnt cross(Pnt[] matrix) { 277 | int len = matrix.length + 1; 278 | if (len != matrix[0].dimension()) 279 | throw new IllegalArgumentException("Dimension mismatch"); 280 | boolean[] columns = new boolean[len]; 281 | for (int i = 0; i < len; i++) columns[i] = true; 282 | double[] result = new double[len]; 283 | int sign = 1; 284 | try { 285 | for (int i = 0; i < len; i++) { 286 | columns[i] = false; 287 | result[i] = sign * determinant(matrix, 0, columns); 288 | columns[i] = true; 289 | sign = -sign; 290 | } 291 | } catch (ArrayIndexOutOfBoundsException e) { 292 | throw new IllegalArgumentException("Matrix is wrong shape"); 293 | } 294 | return new Pnt(result); 295 | } 296 | 297 | /* Pnts as simplices */ 298 | 299 | /** 300 | * Determine the signed content (i.e., area or volume, etc.) of a simplex. 301 | * 302 | * @param simplex the simplex (as an array of Pnts) 303 | * @return the signed content of the simplex 304 | */ 305 | public static double content(Pnt[] simplex) { 306 | Pnt[] matrix = new Pnt[simplex.length]; 307 | for (int i = 0; i < matrix.length; i++) 308 | matrix[i] = simplex[i].extend(1); 309 | int fact = 1; 310 | for (int i = 1; i < matrix.length; i++) fact = fact * i; 311 | return determinant(matrix) / fact; 312 | } 313 | 314 | /** 315 | * Relation between this Pnt and a simplex (represented as an array of 316 | * Pnts). Result is an array of signs, one for each vertex of the simplex, 317 | * indicating the relation between the vertex, the vertex's opposite facet, 318 | * and this Pnt. 319 | *

320 | * 

321 |      *   -1 means Pnt is on same side of facet
322 |      *    0 means Pnt is on the facet
323 |      *   +1 means Pnt is on opposite side of facet
324 |      *
325 | * 326 | * @param simplex an array of Pnts representing a simplex 327 | * @return an array of signs showing relation between this Pnt and simplex 328 | * @throws IllegalArgumentExcpetion if the simplex is degenerate 329 | */ 330 | public int[] relation(Pnt[] simplex) { 331 | /* In 2D, we compute the cross of this matrix: 332 | * 1 1 1 1 333 | * p0 a0 b0 c0 334 | * p1 a1 b1 c1 335 | * where (a, b, c) is the simplex and p is this Pnt. The result is a 336 | * vector in which the first coordinate is the signed area (all signed 337 | * areas are off by the same constant factor) of the simplex and the 338 | * remaining coordinates are the *negated* signed areas for the 339 | * simplices in which p is substituted for each of the vertices. 340 | * Analogous results occur in higher dimensions. 341 | */ 342 | int dim = simplex.length - 1; 343 | if (this.dimension() != dim) 344 | throw new IllegalArgumentException("Dimension mismatch"); 345 | 346 | /* Create and load the matrix */ 347 | Pnt[] matrix = new Pnt[dim + 1]; 348 | /* First row */ 349 | double[] coords = new double[dim + 2]; 350 | for (int j = 0; j < coords.length; j++) coords[j] = 1; 351 | matrix[0] = new Pnt(coords); 352 | /* Other rows */ 353 | for (int i = 0; i < dim; i++) { 354 | coords[0] = this.coordinates[i]; 355 | for (int j = 0; j < simplex.length; j++) 356 | coords[j + 1] = simplex[j].coordinates[i]; 357 | matrix[i + 1] = new Pnt(coords); 358 | } 359 | 360 | /* Compute and analyze the vector of areas/volumes/contents */ 361 | Pnt vector = cross(matrix); 362 | double content = vector.coordinates[0]; 363 | int[] result = new int[dim + 1]; 364 | for (int i = 0; i < result.length; i++) { 365 | double value = vector.coordinates[i + 1]; 366 | if (Math.abs(value) <= 1.0e-6 * Math.abs(content)) result[i] = 0; 367 | else if (value < 0) result[i] = -1; 368 | else result[i] = 1; 369 | } 370 | if (content < 0) { 371 | for (int i = 0; i < result.length; i++) 372 | result[i] = -result[i]; 373 | } 374 | if (content == 0) { 375 | for (int i = 0; i < result.length; i++) 376 | result[i] = Math.abs(result[i]); 377 | } 378 | return result; 379 | } 380 | 381 | /** 382 | * Test if this Pnt is outside of simplex. 383 | * 384 | * @param simplex the simplex (an array of Pnts) 385 | * @return simplex Pnt that "witnesses" outsideness (or null if not outside) 386 | */ 387 | public Pnt isOutside(Pnt[] simplex) { 388 | int[] result = this.relation(simplex); 389 | for (int i = 0; i < result.length; i++) { 390 | if (result[i] > 0) return simplex[i]; 391 | } 392 | return null; 393 | } 394 | 395 | /** 396 | * Test if this Pnt is on a simplex. 397 | * 398 | * @param simplex the simplex (an array of Pnts) 399 | * @return the simplex Pnt that "witnesses" on-ness (or null if not on) 400 | */ 401 | public Pnt isOn(Pnt[] simplex) { 402 | int[] result = this.relation(simplex); 403 | Pnt witness = null; 404 | for (int i = 0; i < result.length; i++) { 405 | if (result[i] == 0) witness = simplex[i]; 406 | else if (result[i] > 0) return null; 407 | } 408 | return witness; 409 | } 410 | 411 | /** 412 | * Test if this Pnt is inside a simplex. 413 | * 414 | * @param simplex the simplex (an arary of Pnts) 415 | * @return true iff this Pnt is inside simplex. 416 | */ 417 | public boolean isInside(Pnt[] simplex) { 418 | int[] result = this.relation(simplex); 419 | for (int r : result) if (r >= 0) return false; 420 | return true; 421 | } 422 | 423 | /** 424 | * Test relation between this Pnt and circumcircle of a simplex. 425 | * 426 | * @param simplex the simplex (as an array of Pnts) 427 | * @return -1, 0, or +1 for inside, on, or outside of circumcircle 428 | */ 429 | public int vsCircumcircle(Pnt[] simplex) { 430 | Pnt[] matrix = new Pnt[simplex.length + 1]; 431 | for (int i = 0; i < simplex.length; i++) 432 | matrix[i] = simplex[i].extend(1, simplex[i].dot(simplex[i])); 433 | matrix[simplex.length] = this.extend(1, this.dot(this)); 434 | double d = determinant(matrix); 435 | int result = (d < 0) ? -1 : ((d > 0) ? +1 : 0); 436 | if (content(simplex) < 0) result = -result; 437 | return result; 438 | } 439 | 440 | /** 441 | * Circumcenter of a simplex. 442 | * 443 | * @param simplex the simplex (as an array of Pnts) 444 | * @return the circumcenter (a Pnt) of simplex 445 | */ 446 | public static Pnt circumcenter(Pnt[] simplex) { 447 | int dim = simplex[0].dimension(); 448 | if (simplex.length - 1 != dim) 449 | throw new IllegalArgumentException("Dimension mismatch"); 450 | Pnt[] matrix = new Pnt[dim]; 451 | for (int i = 0; i < dim; i++) 452 | matrix[i] = simplex[i].bisector(simplex[i + 1]); 453 | Pnt hCenter = cross(matrix); // Center in homogeneous coordinates 454 | double last = hCenter.coordinates[dim]; 455 | double[] result = new double[dim]; 456 | for (int i = 0; i < dim; i++) result[i] = hCenter.coordinates[i] / last; 457 | return new Pnt(result); 458 | } 459 | 460 | /** 461 | * Main program (used for testing). 462 | */ 463 | public static void main(String[] args) { 464 | Pnt p = new Pnt(1, 2, 3); 465 | System.out.println("Pnt created: " + p); 466 | Pnt[] matrix1 = {new Pnt(1, 2), new Pnt(3, 4)}; 467 | Pnt[] matrix2 = {new Pnt(7, 0, 5), new Pnt(2, 4, 6), new Pnt(3, 8, 1)}; 468 | System.out.print("Results should be -2 and -288: "); 469 | System.out.println(determinant(matrix1) + " " + determinant(matrix2)); 470 | Pnt p1 = new Pnt(1, 1); 471 | Pnt p2 = new Pnt(-1, 1); 472 | System.out.println("Angle between " + p1 + " and " + 473 | p2 + ": " + p1.angle(p2)); 474 | System.out.println(p1 + " subtract " + p2 + ": " + p1.subtract(p2)); 475 | Pnt v0 = new Pnt(0, 0), v1 = new Pnt(1, 1), v2 = new Pnt(2, 2); 476 | Pnt[] vs = {v0, new Pnt(0, 1), new Pnt(1, 0)}; 477 | Pnt vp = new Pnt(.1, .1); 478 | System.out.println(vp + " isInside " + toString(vs) + 479 | ": " + vp.isInside(vs)); 480 | System.out.println(v1 + " isInside " + toString(vs) + 481 | ": " + v1.isInside(vs)); 482 | System.out.println(vp + " vsCircumcircle " + toString(vs) + ": " + 483 | vp.vsCircumcircle(vs)); 484 | System.out.println(v1 + " vsCircumcircle " + toString(vs) + ": " + 485 | v1.vsCircumcircle(vs)); 486 | System.out.println(v2 + " vsCircumcircle " + toString(vs) + ": " + 487 | v2.vsCircumcircle(vs)); 488 | System.out.println("Circumcenter of " + toString(vs) + " is " + 489 | circumcenter(vs)); 490 | } 491 | } -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/core/delaunay/Triangle.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.core.delaunay; 2 | 3 | /* 4 | * Copyright (c) 2007 by L. Paul Chew. 5 | * 6 | * Permission is hereby granted, without written agreement and without 7 | * license or royalty fees, to use, copy, modify, and distribute this 8 | * software and its documentation for any purpose, subject to the following 9 | * conditions: 10 | * 11 | * The above copyright notice and this permission notice shall be included 12 | * in all copies or substantial portions of the Software. 13 | * 14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 15 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 16 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 17 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 18 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 19 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 20 | * DEALINGS IN THE SOFTWARE. 21 | */ 22 | 23 | import java.util.Arrays; 24 | import java.util.Collection; 25 | import java.util.Iterator; 26 | import java.util.NoSuchElementException; 27 | 28 | 29 | /** 30 | * A Triangle is an immutable Set of exactly three Pnts. 31 | *

32 | * All Set operations are available. Individual vertices can be accessed via 33 | * iterator() and also via triangle.get(index). 34 | *

35 | * Note that, even if two triangles have the same vertex set, they are 36 | * *different* triangles. Methods equals() and hashCode() are consistent with 37 | * this rule. 38 | * 39 | * @author Paul Chew 40 | *

41 | * Created December 2007. Replaced general simplices with geometric triangle. 42 | */ 43 | public class Triangle extends ArraySet { 44 | 45 | private int idNumber; // The id number 46 | private Pnt circumcenter = null; // The triangle's circumcenter 47 | 48 | private static int idGenerator = 0; // Used to create id numbers 49 | public static boolean moreInfo = false; // True iff more info in toString 50 | 51 | /** 52 | * @param vertices the vertices of the Triangle. 53 | * @throws IllegalArgumentException if there are not three distinct vertices 54 | */ 55 | public Triangle(Pnt... vertices) { 56 | this(Arrays.asList(vertices)); 57 | } 58 | 59 | /** 60 | * @param collection a Collection holding the Simplex vertices 61 | * @throws IllegalArgumentException if there are not three distinct vertices 62 | */ 63 | public Triangle(Collection collection) { 64 | super(collection); 65 | idNumber = idGenerator++; 66 | if (this.size() != 3) 67 | throw new IllegalArgumentException("Triangle must have 3 vertices"); 68 | } 69 | 70 | @Override 71 | public String toString() { 72 | if (!moreInfo) return "Triangle" + idNumber; 73 | return "Triangle" + idNumber + super.toString(); 74 | } 75 | 76 | /** 77 | * Get arbitrary vertex of this triangle, but not any of the bad vertices. 78 | * 79 | * @param badVertices one or more bad vertices 80 | * @return a vertex of this triangle, but not one of the bad vertices 81 | * @throws NoSuchElementException if no vertex found 82 | */ 83 | public Pnt getVertexButNot(Pnt... badVertices) { 84 | Collection bad = Arrays.asList(badVertices); 85 | for (Pnt v : this) if (!bad.contains(v)) return v; 86 | throw new NoSuchElementException("No vertex found"); 87 | } 88 | 89 | /** 90 | * True iff triangles are neighbors. Two triangles are neighbors if they 91 | * share a facet. 92 | * 93 | * @param triangle the other Triangle 94 | * @return true iff this Triangle is a neighbor of triangle 95 | */ 96 | public boolean isNeighbor(Triangle triangle) { 97 | int count = 0; 98 | for (Pnt vertex : this) 99 | if (!triangle.contains(vertex)) count++; 100 | return count == 1; 101 | } 102 | 103 | /** 104 | * Report the facet opposite vertex. 105 | * 106 | * @param vertex a vertex of this Triangle 107 | * @return the facet opposite vertex 108 | * @throws IllegalArgumentException if the vertex is not in triangle 109 | */ 110 | public ArraySet facetOpposite(Pnt vertex) { 111 | ArraySet facet = new ArraySet(this); 112 | if (!facet.remove(vertex)) 113 | throw new IllegalArgumentException("Vertex not in triangle"); 114 | return facet; 115 | } 116 | 117 | /** 118 | * @return the triangle's circumcenter 119 | */ 120 | public Pnt getCircumcenter() { 121 | if (circumcenter == null) 122 | circumcenter = Pnt.circumcenter(this.toArray(new Pnt[0])); 123 | return circumcenter; 124 | } 125 | 126 | /* The following two methods ensure that a Triangle is immutable */ 127 | 128 | @Override 129 | public boolean add(Pnt vertex) { 130 | throw new UnsupportedOperationException(); 131 | } 132 | 133 | @Override 134 | public Iterator iterator() { 135 | return new Iterator() { 136 | private Iterator it = Triangle.super.iterator(); 137 | 138 | public boolean hasNext() { 139 | return it.hasNext(); 140 | } 141 | 142 | public Pnt next() { 143 | return it.next(); 144 | } 145 | 146 | public void remove() { 147 | throw new UnsupportedOperationException(); 148 | } 149 | }; 150 | } 151 | 152 | /* The following two methods ensure that all triangles are different. */ 153 | 154 | @Override 155 | public int hashCode() { 156 | return (int) (idNumber ^ (idNumber >>> 32)); 157 | } 158 | 159 | @Override 160 | public boolean equals(Object o) { 161 | return (this == o); 162 | } 163 | 164 | } -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/core/delaunay/Triangulation.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.core.delaunay; 2 | 3 | /* 4 | * Copyright (c) 2005, 2007 by L. Paul Chew. 5 | * 6 | * Permission is hereby granted, without written agreement and without 7 | * license or royalty fees, to use, copy, modify, and distribute this 8 | * software and its documentation for any purpose, subject to the following 9 | * conditions: 10 | * 11 | * The above copyright notice and this permission notice shall be included 12 | * in all copies or substantial portions of the Software. 13 | * 14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 15 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 16 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 17 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 18 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 19 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 20 | * DEALINGS IN THE SOFTWARE. 21 | */ 22 | 23 | import java.util.AbstractSet; 24 | import java.util.ArrayList; 25 | import java.util.HashSet; 26 | import java.util.Iterator; 27 | import java.util.LinkedList; 28 | import java.util.List; 29 | import java.util.Queue; 30 | import java.util.Set; 31 | 32 | 33 | /** 34 | * A 2D Delaunay Triangulation (DT) with incremental site insertion. 35 | *

36 | * This is not the fastest way to build a DT, but it's a reasonable way to build 37 | * a DT incrementally and it makes a nice interactive display. There are several 38 | * O(n log n) methods, but they require that the sites are all known initially. 39 | *

40 | * A Triangulation is a Set of Triangles. A Triangulation is unmodifiable as a 41 | * Set; the only way to change it is to add sites (via delaunayPlace). 42 | * 43 | * @author Paul Chew 44 | *

45 | * Created July 2005. Derived from an earlier, messier version. 46 | *

47 | * Modified November 2007. Rewrote to use AbstractSet as parent class and to use 48 | * the Graph class internally. Tried to make the DT algorithm clearer by 49 | * explicitly creating a cavity. Added code needed to find a Voronoi cell. 50 | */ 51 | public class Triangulation extends AbstractSet { 52 | 53 | private Triangle mostRecent = null; // Most recently "active" triangle 54 | private Graph triGraph; // Holds triangles for navigation 55 | 56 | /** 57 | * All sites must fall within the initial triangle. 58 | * 59 | * @param triangle the initial triangle 60 | */ 61 | public Triangulation(Triangle triangle) { 62 | triGraph = new Graph(); 63 | triGraph.add(triangle); 64 | mostRecent = triangle; 65 | } 66 | 67 | /* The following two methods are required by AbstractSet */ 68 | 69 | @Override 70 | public Iterator iterator() { 71 | return triGraph.nodeSet().iterator(); 72 | } 73 | 74 | @Override 75 | public int size() { 76 | return triGraph.nodeSet().size(); 77 | } 78 | 79 | @Override 80 | public String toString() { 81 | return "Triangulation with " + size() + " triangles"; 82 | } 83 | 84 | /** 85 | * True iff triangle is a member of this triangulation. 86 | * This method isn't required by AbstractSet, but it improves efficiency. 87 | * 88 | * @param triangle the object to check for membership 89 | */ 90 | public boolean contains(Object triangle) { 91 | return triGraph.nodeSet().contains(triangle); 92 | } 93 | 94 | /** 95 | * Report neighbor opposite the given vertex of triangle. 96 | * 97 | * @param site a vertex of triangle 98 | * @param triangle we want the neighbor of this triangle 99 | * @return the neighbor opposite site in triangle; null if none 100 | * @throws IllegalArgumentException if site is not in this triangle 101 | */ 102 | public Triangle neighborOpposite(Pnt site, Triangle triangle) { 103 | if (!triangle.contains(site)) 104 | throw new IllegalArgumentException("Bad vertex; not in triangle"); 105 | for (Triangle neighbor : triGraph.neighbors(triangle)) { 106 | if (!neighbor.contains(site)) return neighbor; 107 | } 108 | return null; 109 | } 110 | 111 | /** 112 | * Return the set of triangles adjacent to triangle. 113 | * 114 | * @param triangle the triangle to check 115 | * @return the neighbors of triangle 116 | */ 117 | public Set neighbors(Triangle triangle) { 118 | return triGraph.neighbors(triangle); 119 | } 120 | 121 | /** 122 | * Report triangles surrounding site in order (cw or ccw). 123 | * 124 | * @param site we want the surrounding triangles for this site 125 | * @param triangle a "starting" triangle that has site as a vertex 126 | * @return all triangles surrounding site in order (cw or ccw) 127 | * @throws IllegalArgumentException if site is not in triangle 128 | */ 129 | public List surroundingTriangles(Pnt site, Triangle triangle) { 130 | if (!triangle.contains(site)) 131 | throw new IllegalArgumentException("Site not in triangle"); 132 | List list = new ArrayList(); 133 | Triangle start = triangle; 134 | Pnt guide = triangle.getVertexButNot(site); // Affects cw or ccw 135 | while (true) { 136 | list.add(triangle); 137 | Triangle previous = triangle; 138 | triangle = this.neighborOpposite(guide, triangle); // Next triangle 139 | guide = previous.getVertexButNot(site, guide); // Update guide 140 | if (triangle == start) break; 141 | } 142 | return list; 143 | } 144 | 145 | /** 146 | * Locate the triangle with point inside it or on its boundary. 147 | * 148 | * @param point the point to locate 149 | * @return the triangle that holds point; null if no such triangle 150 | */ 151 | public Triangle locate(Pnt point) { 152 | Triangle triangle = mostRecent; 153 | if (!this.contains(triangle)) triangle = null; 154 | 155 | // Try a directed walk (this works fine in 2D, but can fail in 3D) 156 | Set visited = new HashSet(); 157 | while (triangle != null) { 158 | if (visited.contains(triangle)) { // This should never happen 159 | System.out.println("Warning: Caught in a locate loop"); 160 | break; 161 | } 162 | visited.add(triangle); 163 | // Corner opposite point 164 | Pnt corner = point.isOutside(triangle.toArray(new Pnt[0])); 165 | if (corner == null) return triangle; 166 | triangle = this.neighborOpposite(corner, triangle); 167 | } 168 | // No luck; try brute force 169 | System.out.println("Warning: Checking all triangles for " + point); 170 | for (Triangle tri : this) { 171 | if (point.isOutside(tri.toArray(new Pnt[0])) == null) return tri; 172 | } 173 | // No such triangle 174 | System.out.println("Warning: No triangle holds " + point); 175 | return null; 176 | } 177 | 178 | /** 179 | * Place a new site into the DT. 180 | * Nothing happens if the site matches an existing DT vertex. 181 | * 182 | * @param site the new Pnt 183 | * @throws IllegalArgumentException if site does not lie in any triangle 184 | */ 185 | public void delaunayPlace(Pnt site) { 186 | // Uses straightforward scheme rather than best asymptotic time 187 | 188 | // Locate containing triangle 189 | Triangle triangle = locate(site); 190 | // Give up if no containing triangle or if site is already in DT 191 | if (triangle == null) 192 | throw new IllegalArgumentException("No containing triangle"); 193 | if (triangle.contains(site)) return; 194 | 195 | // Determine the cavity and update the triangulation 196 | Set cavity = getCavity(site, triangle); 197 | mostRecent = update(site, cavity); 198 | } 199 | 200 | /** 201 | * Determine the cavity caused by site. 202 | * 203 | * @param site the site causing the cavity 204 | * @param triangle the triangle containing site 205 | * @return set of all triangles that have site in their circumcircle 206 | */ 207 | private Set getCavity(Pnt site, Triangle triangle) { 208 | Set encroached = new HashSet(); 209 | Queue toBeChecked = new LinkedList(); 210 | Set marked = new HashSet(); 211 | toBeChecked.add(triangle); 212 | marked.add(triangle); 213 | while (!toBeChecked.isEmpty()) { 214 | triangle = toBeChecked.remove(); 215 | if (site.vsCircumcircle(triangle.toArray(new Pnt[0])) == 1) 216 | continue; // Site outside triangle => triangle not in cavity 217 | encroached.add(triangle); 218 | // Check the neighbors 219 | for (Triangle neighbor : triGraph.neighbors(triangle)) { 220 | if (marked.contains(neighbor)) continue; 221 | marked.add(neighbor); 222 | toBeChecked.add(neighbor); 223 | } 224 | } 225 | return encroached; 226 | } 227 | 228 | /** 229 | * Update the triangulation by removing the cavity triangles and then 230 | * filling the cavity with new triangles. 231 | * 232 | * @param site the site that created the cavity 233 | * @param cavity the triangles with site in their circumcircle 234 | * @return one of the new triangles 235 | */ 236 | private Triangle update(Pnt site, Set cavity) { 237 | Set> boundary = new HashSet>(); 238 | Set theTriangles = new HashSet(); 239 | 240 | // Find boundary facets and adjacent triangles 241 | for (Triangle triangle : cavity) { 242 | theTriangles.addAll(neighbors(triangle)); 243 | for (Pnt vertex : triangle) { 244 | Set facet = triangle.facetOpposite(vertex); 245 | if (boundary.contains(facet)) boundary.remove(facet); 246 | else boundary.add(facet); 247 | } 248 | } 249 | theTriangles.removeAll(cavity); // Adj triangles only 250 | 251 | // Remove the cavity triangles from the triangulation 252 | for (Triangle triangle : cavity) triGraph.remove(triangle); 253 | 254 | // Build each new triangle and add it to the triangulation 255 | Set newTriangles = new HashSet(); 256 | for (Set vertices : boundary) { 257 | vertices.add(site); 258 | Triangle tri = new Triangle(vertices); 259 | triGraph.add(tri); 260 | newTriangles.add(tri); 261 | } 262 | 263 | // Update the graph links for each new triangle 264 | theTriangles.addAll(newTriangles); // Adj triangle + new triangles 265 | for (Triangle triangle : newTriangles) 266 | for (Triangle other : theTriangles) 267 | if (triangle.isNeighbor(other)) 268 | triGraph.add(triangle, other); 269 | 270 | // Return one of the new triangles 271 | return newTriangles.iterator().next(); 272 | } 273 | 274 | /** 275 | * Main program; used for testing. 276 | */ 277 | public static void main(String[] args) { 278 | Triangle tri = 279 | new Triangle(new Pnt(0, 0), new Pnt(0, 2), new Pnt(2, 0)); 280 | System.out.println("Triangle created: " + tri); 281 | Triangulation dt = new Triangulation(tri); 282 | System.out.println("DelaunayTriangulation created: " + dt); 283 | dt.delaunayPlace(new Pnt(0, 0)); 284 | dt.delaunayPlace(new Pnt(1, 0)); 285 | dt.delaunayPlace(new Pnt(0, 1)); 286 | System.out.println("After adding 3 points, we have a " + dt); 287 | Triangle.moreInfo = true; 288 | System.out.println("Triangles: " + dt.triGraph.nodeSet()); 289 | } 290 | } -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/model/PointBean.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.model; 2 | 3 | /** 4 | * Created by hugeterry(http://hugeterry.cn) 5 | * Date: 16/4/28 20:12 6 | */ 7 | public class PointBean { 8 | public int x; 9 | public int y; 10 | 11 | public PointBean(int x, int y) { 12 | this.x = x; 13 | this.y = y; 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/utils/ConvertGreyImg.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.utils; 2 | 3 | import android.graphics.Bitmap; 4 | 5 | /** 6 | * Created by hugeterry(http://hugeterry.cn) 7 | * Date: 16/5/1 16:10 8 | */ 9 | public class ConvertGreyImg { 10 | /** 11 | * 将彩色图转换为灰度图 12 | * 13 | * @param img 位图 14 | * @return 返回转换好的位图 15 | */ 16 | public static Bitmap convertGreyImg(Bitmap img) { 17 | int width = img.getWidth(); //获取位图的宽 18 | int height = img.getHeight(); //获取位图的高 19 | 20 | int[] pixels = new int[width * height]; //通过位图的大小创建像素点数组 21 | 22 | img.getPixels(pixels, 0, width, 0, 0, width, height); 23 | int alpha = 0xFF << 24; 24 | for (int i = 0; i < height; i++) { 25 | for (int j = 0; j < width; j++) { 26 | int grey = pixels[width * i + j]; 27 | 28 | int red = ((grey & 0x00FF0000) >> 16); 29 | int green = ((grey & 0x0000FF00) >> 8); 30 | int blue = (grey & 0x000000FF); 31 | 32 | grey = (int) ((float) red * 0.3 + (float) green * 0.59 + (float) blue * 0.11); 33 | grey = alpha | (grey << 16) | (grey << 8) | grey; 34 | pixels[width * i + j] = grey; 35 | } 36 | } 37 | Bitmap result = Bitmap.createBitmap(width, height, Bitmap.Config.RGB_565); 38 | result.setPixels(pixels, 0, width, 0, 0, width, height); 39 | return result; 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/utils/DrawTriangle.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.utils; 2 | 3 | import android.content.res.Resources; 4 | import android.graphics.Canvas; 5 | import android.graphics.Paint; 6 | import android.graphics.Path; 7 | import android.util.Log; 8 | 9 | import cn.hugeterry.ployfun.core.delaunay.Pnt; 10 | 11 | /** 12 | * Created by hugeterry(http://hugeterry.cn) 13 | * Date: 16/5/1 16:07 14 | */ 15 | public class DrawTriangle { 16 | private static int[] x, y; 17 | private static Paint p; 18 | private static Path path; 19 | 20 | public static Paint drawTriangle(Pnt[] polygon, int fillColor, Canvas canvas, Resources res) { 21 | x = new int[polygon.length]; 22 | y = new int[polygon.length]; 23 | for (int i = 0; i < polygon.length; i++) { 24 | x[i] = (int) polygon[i].coord(0); 25 | y[i] = (int) polygon[i].coord(1); 26 | } 27 | p = new Paint(); 28 | path = new Path(); 29 | p.setColor(fillColor); 30 | Log.i("PolyFun TAG", "fillColor:" + fillColor); 31 | Log.i("PolyFun TAG", "x:" + x[0] + ",y:" + y[0]); 32 | Log.i("PolyFun TAG", "x:" + x[1] + ",y:" + y[1]); 33 | Log.i("PolyFun TAG", "x:" + x[2] + ",y:" + y[2]); 34 | path.moveTo(x[0], y[0]); 35 | path.lineTo(x[1], y[1]); 36 | path.lineTo(x[2], y[2]); 37 | path.close(); 38 | canvas.drawPath(path, p); 39 | return p; 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/utils/GetPhoto.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.utils; 2 | 3 | import android.app.Activity; 4 | import android.content.Context; 5 | import android.content.Intent; 6 | 7 | /** 8 | * Created by hugeterry(http://hugeterry.cn) 9 | * Date: 16/8/7 19:27 10 | */ 11 | public class GetPhoto { 12 | public static void gallery(Context context) { 13 | Intent intent = new Intent(Intent.ACTION_PICK, android.provider.MediaStore.Images.Media.EXTERNAL_CONTENT_URI); 14 | ((Activity) context).startActivityForResult(intent, 12); 15 | } 16 | 17 | } 18 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/utils/SavePhoto.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.utils; 2 | 3 | import android.content.Context; 4 | import android.content.Intent; 5 | import android.graphics.Bitmap; 6 | import android.net.Uri; 7 | import android.os.Environment; 8 | 9 | import java.io.File; 10 | import java.io.FileOutputStream; 11 | import java.io.IOException; 12 | 13 | /** 14 | * Created by hugeterry(http://hugeterry.cn) 15 | * Date: 16/8/14 17:21 16 | */ 17 | public class SavePhoto { 18 | public static String writePhoto(Bitmap bitmap) { 19 | File sdCardDir = Environment.getExternalStorageDirectory(); 20 | String strPath = "/PolyFun/polyfun" + System.currentTimeMillis() 21 | + ".png"; 22 | File file = new File(sdCardDir, strPath); 23 | if (!file.getParentFile().exists()) { 24 | file.getParentFile().mkdirs(); 25 | } 26 | try { 27 | FileOutputStream os = new FileOutputStream(file); 28 | bitmap.compress(Bitmap.CompressFormat.PNG, 100, os); 29 | os.flush(); 30 | os.close(); 31 | } catch (IOException e) { 32 | e.printStackTrace(); 33 | } 34 | return sdCardDir + strPath; 35 | } 36 | 37 | public static void scanPhotos(String filePath, Context context) { 38 | Intent intent = new Intent( 39 | Intent.ACTION_MEDIA_SCANNER_SCAN_FILE); 40 | Uri uri = Uri.fromFile(new File(filePath)); 41 | intent.setData(uri); 42 | context.sendBroadcast(intent); 43 | } 44 | } 45 | -------------------------------------------------------------------------------- /app/src/main/java/cn/hugeterry/ployfun/utils/ShareUtils.java: -------------------------------------------------------------------------------- 1 | package cn.hugeterry.ployfun.utils; 2 | 3 | import android.content.Context; 4 | import android.content.Intent; 5 | import android.net.Uri; 6 | 7 | import java.io.File; 8 | 9 | /** 10 | * Created by hugeterry(http://hugeterry.cn) 11 | * Date: 16/2/22 21:43 12 | */ 13 | public class ShareUtils { 14 | public static void shareText(Context context, String shareText) { 15 | Intent intent = new Intent(Intent.ACTION_SEND); 16 | intent.setType("text/plain"); 17 | intent.putExtra(Intent.EXTRA_SUBJECT, "分享"); 18 | intent.putExtra(Intent.EXTRA_TEXT, shareText); 19 | intent.setFlags(Intent.FLAG_ACTIVITY_NEW_TASK); 20 | context.startActivity(Intent.createChooser(intent, "分享")); 21 | } 22 | 23 | public static void shareImage(Context context, String path) { 24 | Uri uri = Uri.fromFile(new File(path)); 25 | Intent shareIntent = new Intent(); 26 | shareIntent.setAction(Intent.ACTION_SEND); 27 | shareIntent.putExtra(Intent.EXTRA_STREAM, uri); 28 | shareIntent.setType("image/jpeg"); 29 | context.startActivity(Intent.createChooser(shareIntent, "分享图片")); 30 | } 31 | 32 | public static void shareUri(Context context, String path) { 33 | Intent intent = new Intent(); 34 | intent.setAction(Intent.ACTION_VIEW); 35 | intent.setData(Uri.parse(path)); 36 | context.startActivity(intent); 37 | } 38 | } -------------------------------------------------------------------------------- /app/src/main/res/drawable/ic_arrow_white_24dp.xml: -------------------------------------------------------------------------------- 1 | 6 | 9 | 10 | -------------------------------------------------------------------------------- /app/src/main/res/drawable/ic_done_white_24dp.xml: -------------------------------------------------------------------------------- 1 | 6 | 9 | 10 | -------------------------------------------------------------------------------- /app/src/main/res/drawable/ic_save_white_24dp.xml: -------------------------------------------------------------------------------- 1 | 6 | 9 | 10 | -------------------------------------------------------------------------------- /app/src/main/res/drawable/ic_share_white_24dp.xml: -------------------------------------------------------------------------------- 1 | 6 | 9 | 10 | -------------------------------------------------------------------------------- /app/src/main/res/drawable/photo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hugeterry/PloyFun/01dfae6b4752ec73d80bd8e1e517f253a51e7030/app/src/main/res/drawable/photo.png -------------------------------------------------------------------------------- /app/src/main/res/drawable/photos.xml: -------------------------------------------------------------------------------- 1 | 6 | 9 | 10 | -------------------------------------------------------------------------------- /app/src/main/res/drawable/view_shadow.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | -------------------------------------------------------------------------------- /app/src/main/res/layout/activity_about.xml: -------------------------------------------------------------------------------- 1 | 2 | 8 | 9 | 10 | 17 | 18 | 19 | 25 | 26 | 31 | 32 | 38 | 39 | 46 | 47 | 54 | 55 | 61 | 62 | 63 | 64 | 65 | 71 | 72 | 73 | 74 | 75 | -------------------------------------------------------------------------------- /app/src/main/res/layout/activity_main.xml: -------------------------------------------------------------------------------- 1 | 2 | 9 | 10 | 17 | 18 | 28 | 29 |