[
{
"path": ".gitignore",
"content": "# Prerequisites\n*.d\n\n# Compiled Object files\n*.slo\n*.lo\n*.o\n\n# Precompiled Headers\n*.gch\n*.pch\n\n# Compiled Dynamic libraries\n*.so\n*.dylib\n*.dll\n*.dylib\n\n# Fortran module files\n*.mod\n*.smod\n\n# Compiled Static libraries\n*.lai\n*.la\n*.a\n*.lib\n\n# Executables\n*.exe\n*.out\n*.app\n\n# Qt creator\n*.pro.user\n*.qmake.stash\n\n# Build\n*Makefile\n*build*\n*Build*\n*build/*\n*Build/*\n"
},
{
"path": ".gitmodules",
"content": "[submodule \"libs/vcglib\"]\n\tpath = libs/vcglib\n\turl = ../../cnr-isti-vclab/vcglib\n[submodule \"libs/xfield_tracer\"]\n\tpath = libs/xfield_tracer\n\turl = https://github.com/nicopietroni/xfield_tracer\n"
},
{
"path": "LICENSE",
"content": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free Software Foundation, Inc. \n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The GNU General Public License is a free, copyleft license for\nsoftware and other kinds of works.\n\n The licenses for most software and other practical works are designed\nto take away your freedom to share and change the works. By contrast,\nthe GNU General Public License is intended to guarantee your freedom to\nshare and change all versions of a program--to make sure it remains free\nsoftware for all its users. We, the Free Software Foundation, use the\nGNU General Public License for most of our software; it applies also to\nany other work released this way by its authors. You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthem if you wish), that you receive source code or can get it if you\nwant it, that you can change the software or use pieces of it in new\nfree programs, and that you know you can do these things.\n\n To protect your rights, we need to prevent others from denying you\nthese rights or asking you to surrender the rights. Therefore, you have\ncertain responsibilities if you distribute copies of the software, or if\nyou modify it: responsibilities to respect the freedom of others.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must pass on to the recipients the same\nfreedoms that you received. You must make sure that they, too, receive\nor can get the source code. And you must show them these terms so they\nknow their rights.\n\n Developers that use the GNU GPL protect your rights with two steps:\n(1) assert copyright on the software, and (2) offer you this License\ngiving you legal permission to copy, distribute and/or modify it.\n\n For the developers' and authors' protection, the GPL clearly explains\nthat there is no warranty for this free software. For both users' and\nauthors' sake, the GPL requires that modified versions be marked as\nchanged, so that their problems will not be attributed erroneously to\nauthors of previous versions.\n\n Some devices are designed to deny users access to install or run\nmodified versions of the software inside them, although the manufacturer\ncan do so. This is fundamentally incompatible with the aim of\nprotecting users' freedom to change the software. The systematic\npattern of such abuse occurs in the area of products for individuals to\nuse, which is precisely where it is most unacceptable. Therefore, we\nhave designed this version of the GPL to prohibit the practice for those\nproducts. If such problems arise substantially in other domains, we\nstand ready to extend this provision to those domains in future versions\nof the GPL, as needed to protect the freedom of users.\n\n Finally, every program is threatened constantly by software patents.\nStates should not allow patents to restrict development and use of\nsoftware on general-purpose computers, but in those that do, we wish to\navoid the special danger that patents applied to a free program could\nmake it effectively proprietary. To prevent this, the GPL assures that\npatents cannot be used to render the program non-free.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n TERMS AND CONDITIONS\n\n 0. Definitions.\n\n \"This License\" refers to version 3 of the GNU General Public License.\n\n \"Copyright\" also means copyright-like laws that apply to other kinds of\nworks, such as semiconductor masks.\n\n \"The Program\" refers to any copyrightable work licensed under this\nLicense. Each licensee is addressed as \"you\". \"Licensees\" and\n\"recipients\" may be individuals or organizations.\n\n To \"modify\" a work means to copy from or adapt all or part of the work\nin a fashion requiring copyright permission, other than the making of an\nexact copy. The resulting work is called a \"modified version\" of the\nearlier work or a work \"based on\" the earlier work.\n\n A \"covered work\" means either the unmodified Program or a work based\non the Program.\n\n To \"propagate\" a work means to do anything with it that, without\npermission, would make you directly or secondarily liable for\ninfringement under applicable copyright law, except executing it on a\ncomputer or modifying a private copy. Propagation includes copying,\ndistribution (with or without modification), making available to the\npublic, and in some countries other activities as well.\n\n To \"convey\" a work means any kind of propagation that enables other\nparties to make or receive copies. Mere interaction with a user through\na computer network, with no transfer of a copy, is not conveying.\n\n An interactive user interface displays \"Appropriate Legal Notices\"\nto the extent that it includes a convenient and prominently visible\nfeature that (1) displays an appropriate copyright notice, and (2)\ntells the user that there is no warranty for the work (except to the\nextent that warranties are provided), that licensees may convey the\nwork under this License, and how to view a copy of this License. If\nthe interface presents a list of user commands or options, such as a\nmenu, a prominent item in the list meets this criterion.\n\n 1. Source Code.\n\n The \"source code\" for a work means the preferred form of the work\nfor making modifications to it. \"Object code\" means any non-source\nform of a work.\n\n A \"Standard Interface\" means an interface that either is an official\nstandard defined by a recognized standards body, or, in the case of\ninterfaces specified for a particular programming language, one that\nis widely used among developers working in that language.\n\n The \"System Libraries\" of an executable work include anything, other\nthan the work as a whole, that (a) is included in the normal form of\npackaging a Major Component, but which is not part of that Major\nComponent, and (b) serves only to enable use of the work with that\nMajor Component, or to implement a Standard Interface for which an\nimplementation is available to the public in source code form. A\n\"Major Component\", in this context, means a major essential component\n(kernel, window system, and so on) of the specific operating system\n(if any) on which the executable work runs, or a compiler used to\nproduce the work, or an object code interpreter used to run it.\n\n The \"Corresponding Source\" for a work in object code form means all\nthe source code needed to generate, install, and (for an executable\nwork) run the object code and to modify the work, including scripts to\ncontrol those activities. However, it does not include the work's\nSystem Libraries, or general-purpose tools or generally available free\nprograms which are used unmodified in performing those activities but\nwhich are not part of the work. For example, Corresponding Source\nincludes interface definition files associated with source files for\nthe work, and the source code for shared libraries and dynamically\nlinked subprograms that the work is specifically designed to require,\nsuch as by intimate data communication or control flow between those\nsubprograms and other parts of the work.\n\n The Corresponding Source need not include anything that users\ncan regenerate automatically from other parts of the Corresponding\nSource.\n\n The Corresponding Source for a work in source code form is that\nsame work.\n\n 2. Basic Permissions.\n\n All rights granted under this License are granted for the term of\ncopyright on the Program, and are irrevocable provided the stated\nconditions are met. This License explicitly affirms your unlimited\npermission to run the unmodified Program. The output from running a\ncovered work is covered by this License only if the output, given its\ncontent, constitutes a covered work. This License acknowledges your\nrights of fair use or other equivalent, as provided by copyright law.\n\n You may make, run and propagate covered works that you do not\nconvey, without conditions so long as your license otherwise remains\nin force. You may convey covered works to others for the sole purpose\nof having them make modifications exclusively for you, or provide you\nwith facilities for running those works, provided that you comply with\nthe terms of this License in conveying all material for which you do\nnot control copyright. Those thus making or running the covered works\nfor you must do so exclusively on your behalf, under your direction\nand control, on terms that prohibit them from making any copies of\nyour copyrighted material outside their relationship with you.\n\n Conveying under any other circumstances is permitted solely under\nthe conditions stated below. Sublicensing is not allowed; section 10\nmakes it unnecessary.\n\n 3. Protecting Users' Legal Rights From Anti-Circumvention Law.\n\n No covered work shall be deemed part of an effective technological\nmeasure under any applicable law fulfilling obligations under article\n11 of the WIPO copyright treaty adopted on 20 December 1996, or\nsimilar laws prohibiting or restricting circumvention of such\nmeasures.\n\n When you convey a covered work, you waive any legal power to forbid\ncircumvention of technological measures to the extent such circumvention\nis effected by exercising rights under this License with respect to\nthe covered work, and you disclaim any intention to limit operation or\nmodification of the work as a means of enforcing, against the work's\nusers, your or third parties' legal rights to forbid circumvention of\ntechnological measures.\n\n 4. Conveying Verbatim Copies.\n\n You may convey verbatim copies of the Program's source code as you\nreceive it, in any medium, provided that you conspicuously and\nappropriately publish on each copy an appropriate copyright notice;\nkeep intact all notices stating that this License and any\nnon-permissive terms added in accord with section 7 apply to the code;\nkeep intact all notices of the absence of any warranty; and give all\nrecipients a copy of this License along with the Program.\n\n You may charge any price or no price for each copy that you convey,\nand you may offer support or warranty protection for a fee.\n\n 5. Conveying Modified Source Versions.\n\n You may convey a work based on the Program, or the modifications to\nproduce it from the Program, in the form of source code under the\nterms of section 4, provided that you also meet all of these conditions:\n\n a) The work must carry prominent notices stating that you modified\n it, and giving a relevant date.\n\n b) The work must carry prominent notices stating that it is\n released under this License and any conditions added under section\n 7. This requirement modifies the requirement in section 4 to\n \"keep intact all notices\".\n\n c) You must license the entire work, as a whole, under this\n License to anyone who comes into possession of a copy. This\n License will therefore apply, along with any applicable section 7\n additional terms, to the whole of the work, and all its parts,\n regardless of how they are packaged. This License gives no\n permission to license the work in any other way, but it does not\n invalidate such permission if you have separately received it.\n\n d) If the work has interactive user interfaces, each must display\n Appropriate Legal Notices; however, if the Program has interactive\n interfaces that do not display Appropriate Legal Notices, your\n work need not make them do so.\n\n A compilation of a covered work with other separate and independent\nworks, which are not by their nature extensions of the covered work,\nand which are not combined with it such as to form a larger program,\nin or on a volume of a storage or distribution medium, is called an\n\"aggregate\" if the compilation and its resulting copyright are not\nused to limit the access or legal rights of the compilation's users\nbeyond what the individual works permit. Inclusion of a covered work\nin an aggregate does not cause this License to apply to the other\nparts of the aggregate.\n\n 6. Conveying Non-Source Forms.\n\n You may convey a covered work in object code form under the terms\nof sections 4 and 5, provided that you also convey the\nmachine-readable Corresponding Source under the terms of this License,\nin one of these ways:\n\n a) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by the\n Corresponding Source fixed on a durable physical medium\n customarily used for software interchange.\n\n b) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by a\n written offer, valid for at least three years and valid for as\n long as you offer spare parts or customer support for that product\n model, to give anyone who possesses the object code either (1) a\n copy of the Corresponding Source for all the software in the\n product that is covered by this License, on a durable physical\n medium customarily used for software interchange, for a price no\n more than your reasonable cost of physically performing this\n conveying of source, or (2) access to copy the\n Corresponding Source from a network server at no charge.\n\n c) Convey individual copies of the object code with a copy of the\n written offer to provide the Corresponding Source. This\n alternative is allowed only occasionally and noncommercially, and\n only if you received the object code with such an offer, in accord\n with subsection 6b.\n\n d) Convey the object code by offering access from a designated\n place (gratis or for a charge), and offer equivalent access to the\n Corresponding Source in the same way through the same place at no\n further charge. You need not require recipients to copy the\n Corresponding Source along with the object code. If the place to\n copy the object code is a network server, the Corresponding Source\n may be on a different server (operated by you or a third party)\n that supports equivalent copying facilities, provided you maintain\n clear directions next to the object code saying where to find the\n Corresponding Source. Regardless of what server hosts the\n Corresponding Source, you remain obligated to ensure that it is\n available for as long as needed to satisfy these requirements.\n\n e) Convey the object code using peer-to-peer transmission, provided\n you inform other peers where the object code and Corresponding\n Source of the work are being offered to the general public at no\n charge under subsection 6d.\n\n A separable portion of the object code, whose source code is excluded\nfrom the Corresponding Source as a System Library, need not be\nincluded in conveying the object code work.\n\n A \"User Product\" is either (1) a \"consumer product\", which means any\ntangible personal property which is normally used for personal, family,\nor household purposes, or (2) anything designed or sold for incorporation\ninto a dwelling. In determining whether a product is a consumer product,\ndoubtful cases shall be resolved in favor of coverage. For a particular\nproduct received by a particular user, \"normally used\" refers to a\ntypical or common use of that class of product, regardless of the status\nof the particular user or of the way in which the particular user\nactually uses, or expects or is expected to use, the product. A product\nis a consumer product regardless of whether the product has substantial\ncommercial, industrial or non-consumer uses, unless such uses represent\nthe only significant mode of use of the product.\n\n \"Installation Information\" for a User Product means any methods,\nprocedures, authorization keys, or other information required to install\nand execute modified versions of a covered work in that User Product from\na modified version of its Corresponding Source. The information must\nsuffice to ensure that the continued functioning of the modified object\ncode is in no case prevented or interfered with solely because\nmodification has been made.\n\n If you convey an object code work under this section in, or with, or\nspecifically for use in, a User Product, and the conveying occurs as\npart of a transaction in which the right of possession and use of the\nUser Product is transferred to the recipient in perpetuity or for a\nfixed term (regardless of how the transaction is characterized), the\nCorresponding Source conveyed under this section must be accompanied\nby the Installation Information. But this requirement does not apply\nif neither you nor any third party retains the ability to install\nmodified object code on the User Product (for example, the work has\nbeen installed in ROM).\n\n The requirement to provide Installation Information does not include a\nrequirement to continue to provide support service, warranty, or updates\nfor a work that has been modified or installed by the recipient, or for\nthe User Product in which it has been modified or installed. Access to a\nnetwork may be denied when the modification itself materially and\nadversely affects the operation of the network or violates the rules and\nprotocols for communication across the network.\n\n Corresponding Source conveyed, and Installation Information provided,\nin accord with this section must be in a format that is publicly\ndocumented (and with an implementation available to the public in\nsource code form), and must require no special password or key for\nunpacking, reading or copying.\n\n 7. Additional Terms.\n\n \"Additional permissions\" are terms that supplement the terms of this\nLicense by making exceptions from one or more of its conditions.\nAdditional permissions that are applicable to the entire Program shall\nbe treated as though they were included in this License, to the extent\nthat they are valid under applicable law. If additional permissions\napply only to part of the Program, that part may be used separately\nunder those permissions, but the entire Program remains governed by\nthis License without regard to the additional permissions.\n\n When you convey a copy of a covered work, you may at your option\nremove any additional permissions from that copy, or from any part of\nit. (Additional permissions may be written to require their own\nremoval in certain cases when you modify the work.) You may place\nadditional permissions on material, added by you to a covered work,\nfor which you have or can give appropriate copyright permission.\n\n Notwithstanding any other provision of this License, for material you\nadd to a covered work, you may (if authorized by the copyright holders of\nthat material) supplement the terms of this License with terms:\n\n a) Disclaiming warranty or limiting liability differently from the\n terms of sections 15 and 16 of this License; or\n\n b) Requiring preservation of specified reasonable legal notices or\n author attributions in that material or in the Appropriate Legal\n Notices displayed by works containing it; or\n\n c) Prohibiting misrepresentation of the origin of that material, or\n requiring that modified versions of such material be marked in\n reasonable ways as different from the original version; or\n\n d) Limiting the use for publicity purposes of names of licensors or\n authors of the material; or\n\n e) Declining to grant rights under trademark law for use of some\n trade names, trademarks, or service marks; or\n\n f) Requiring indemnification of licensors and authors of that\n material by anyone who conveys the material (or modified versions of\n it) with contractual assumptions of liability to the recipient, for\n any liability that these contractual assumptions directly impose on\n those licensors and authors.\n\n All other non-permissive additional terms are considered \"further\nrestrictions\" within the meaning of section 10. If the Program as you\nreceived it, or any part of it, contains a notice stating that it is\ngoverned by this License along with a term that is a further\nrestriction, you may remove that term. If a license document contains\na further restriction but permits relicensing or conveying under this\nLicense, you may add to a covered work material governed by the terms\nof that license document, provided that the further restriction does\nnot survive such relicensing or conveying.\n\n If you add terms to a covered work in accord with this section, you\nmust place, in the relevant source files, a statement of the\nadditional terms that apply to those files, or a notice indicating\nwhere to find the applicable terms.\n\n Additional terms, permissive or non-permissive, may be stated in the\nform of a separately written license, or stated as exceptions;\nthe above requirements apply either way.\n\n 8. Termination.\n\n You may not propagate or modify a covered work except as expressly\nprovided under this License. Any attempt otherwise to propagate or\nmodify it is void, and will automatically terminate your rights under\nthis License (including any patent licenses granted under the third\nparagraph of section 11).\n\n However, if you cease all violation of this License, then your\nlicense from a particular copyright holder is reinstated (a)\nprovisionally, unless and until the copyright holder explicitly and\nfinally terminates your license, and (b) permanently, if the copyright\nholder fails to notify you of the violation by some reasonable means\nprior to 60 days after the cessation.\n\n Moreover, your license from a particular copyright holder is\nreinstated permanently if the copyright holder notifies you of the\nviolation by some reasonable means, this is the first time you have\nreceived notice of violation of this License (for any work) from that\ncopyright holder, and you cure the violation prior to 30 days after\nyour receipt of the notice.\n\n Termination of your rights under this section does not terminate the\nlicenses of parties who have received copies or rights from you under\nthis License. If your rights have been terminated and not permanently\nreinstated, you do not qualify to receive new licenses for the same\nmaterial under section 10.\n\n 9. Acceptance Not Required for Having Copies.\n\n You are not required to accept this License in order to receive or\nrun a copy of the Program. Ancillary propagation of a covered work\noccurring solely as a consequence of using peer-to-peer transmission\nto receive a copy likewise does not require acceptance. However,\nnothing other than this License grants you permission to propagate or\nmodify any covered work. These actions infringe copyright if you do\nnot accept this License. Therefore, by modifying or propagating a\ncovered work, you indicate your acceptance of this License to do so.\n\n 10. Automatic Licensing of Downstream Recipients.\n\n Each time you convey a covered work, the recipient automatically\nreceives a license from the original licensors, to run, modify and\npropagate that work, subject to this License. You are not responsible\nfor enforcing compliance by third parties with this License.\n\n An \"entity transaction\" is a transaction transferring control of an\norganization, or substantially all assets of one, or subdividing an\norganization, or merging organizations. If propagation of a covered\nwork results from an entity transaction, each party to that\ntransaction who receives a copy of the work also receives whatever\nlicenses to the work the party's predecessor in interest had or could\ngive under the previous paragraph, plus a right to possession of the\nCorresponding Source of the work from the predecessor in interest, if\nthe predecessor has it or can get it with reasonable efforts.\n\n You may not impose any further restrictions on the exercise of the\nrights granted or affirmed under this License. For example, you may\nnot impose a license fee, royalty, or other charge for exercise of\nrights granted under this License, and you may not initiate litigation\n(including a cross-claim or counterclaim in a lawsuit) alleging that\nany patent claim is infringed by making, using, selling, offering for\nsale, or importing the Program or any portion of it.\n\n 11. Patents.\n\n A \"contributor\" is a copyright holder who authorizes use under this\nLicense of the Program or a work on which the Program is based. The\nwork thus licensed is called the contributor's \"contributor version\".\n\n A contributor's \"essential patent claims\" are all patent claims\nowned or controlled by the contributor, whether already acquired or\nhereafter acquired, that would be infringed by some manner, permitted\nby this License, of making, using, or selling its contributor version,\nbut do not include claims that would be infringed only as a\nconsequence of further modification of the contributor version. For\npurposes of this definition, \"control\" includes the right to grant\npatent sublicenses in a manner consistent with the requirements of\nthis License.\n\n Each contributor grants you a non-exclusive, worldwide, royalty-free\npatent license under the contributor's essential patent claims, to\nmake, use, sell, offer for sale, import and otherwise run, modify and\npropagate the contents of its contributor version.\n\n In the following three paragraphs, a \"patent license\" is any express\nagreement or commitment, however denominated, not to enforce a patent\n(such as an express permission to practice a patent or covenant not to\nsue for patent infringement). To \"grant\" such a patent license to a\nparty means to make such an agreement or commitment not to enforce a\npatent against the party.\n\n If you convey a covered work, knowingly relying on a patent license,\nand the Corresponding Source of the work is not available for anyone\nto copy, free of charge and under the terms of this License, through a\npublicly available network server or other readily accessible means,\nthen you must either (1) cause the Corresponding Source to be so\navailable, or (2) arrange to deprive yourself of the benefit of the\npatent license for this particular work, or (3) arrange, in a manner\nconsistent with the requirements of this License, to extend the patent\nlicense to downstream recipients. \"Knowingly relying\" means you have\nactual knowledge that, but for the patent license, your conveying the\ncovered work in a country, or your recipient's use of the covered work\nin a country, would infringe one or more identifiable patents in that\ncountry that you have reason to believe are valid.\n\n If, pursuant to or in connection with a single transaction or\narrangement, you convey, or propagate by procuring conveyance of, a\ncovered work, and grant a patent license to some of the parties\nreceiving the covered work authorizing them to use, propagate, modify\nor convey a specific copy of the covered work, then the patent license\nyou grant is automatically extended to all recipients of the covered\nwork and works based on it.\n\n A patent license is \"discriminatory\" if it does not include within\nthe scope of its coverage, prohibits the exercise of, or is\nconditioned on the non-exercise of one or more of the rights that are\nspecifically granted under this License. You may not convey a covered\nwork if you are a party to an arrangement with a third party that is\nin the business of distributing software, under which you make payment\nto the third party based on the extent of your activity of conveying\nthe work, and under which the third party grants, to any of the\nparties who would receive the covered work from you, a discriminatory\npatent license (a) in connection with copies of the covered work\nconveyed by you (or copies made from those copies), or (b) primarily\nfor and in connection with specific products or compilations that\ncontain the covered work, unless you entered into that arrangement,\nor that patent license was granted, prior to 28 March 2007.\n\n Nothing in this License shall be construed as excluding or limiting\nany implied license or other defenses to infringement that may\notherwise be available to you under applicable patent law.\n\n 12. No Surrender of Others' Freedom.\n\n If conditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot convey a\ncovered work so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you may\nnot convey it at all. For example, if you agree to terms that obligate you\nto collect a royalty for further conveying from those to whom you convey\nthe Program, the only way you could satisfy both those terms and this\nLicense would be to refrain entirely from conveying the Program.\n\n 13. Use with the GNU Affero General Public License.\n\n Notwithstanding any other provision of this License, you have\npermission to link or combine any covered work with a work licensed\nunder version 3 of the GNU Affero General Public License into a single\ncombined work, and to convey the resulting work. The terms of this\nLicense will continue to apply to the part which is the covered work,\nbut the special requirements of the GNU Affero General Public License,\nsection 13, concerning interaction through a network will apply to the\ncombination as such.\n\n 14. Revised Versions of this License.\n\n The Free Software Foundation may publish revised and/or new versions of\nthe GNU General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\n Each version is given a distinguishing version number. If the\nProgram specifies that a certain numbered version of the GNU General\nPublic License \"or any later version\" applies to it, you have the\noption of following the terms and conditions either of that numbered\nversion or of any later version published by the Free Software\nFoundation. If the Program does not specify a version number of the\nGNU General Public License, you may choose any version ever published\nby the Free Software Foundation.\n\n If the Program specifies that a proxy can decide which future\nversions of the GNU General Public License can be used, that proxy's\npublic statement of acceptance of a version permanently authorizes you\nto choose that version for the Program.\n\n Later license versions may give you additional or different\npermissions. However, no additional obligations are imposed on any\nauthor or copyright holder as a result of your choosing to follow a\nlater version.\n\n 15. Disclaimer of Warranty.\n\n THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY\nAPPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT\nHOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY\nOF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\nPURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM\nIS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF\nALL NECESSARY SERVICING, REPAIR OR CORRECTION.\n\n 16. Limitation of Liability.\n\n IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS\nTHE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY\nGENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE\nUSE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF\nDATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD\nPARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),\nEVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF\nSUCH DAMAGES.\n\n 17. Interpretation of Sections 15 and 16.\n\n If the disclaimer of warranty and limitation of liability provided\nabove cannot be given local legal effect according to their terms,\nreviewing courts shall apply local law that most closely approximates\nan absolute waiver of all civil liability in connection with the\nProgram, unless a warranty or assumption of liability accompanies a\ncopy of the Program in return for a fee.\n\n END OF TERMS AND CONDITIONS\n\n How to Apply These Terms to Your New Programs\n\n If you develop a new program, and you want it to be of the greatest\npossible use to the public, the best way to achieve this is to make it\nfree software which everyone can redistribute and change under these terms.\n\n To do so, attach the following notices to the program. It is safest\nto attach them to the start of each source file to most effectively\nstate the exclusion of warranty; and each file should have at least\nthe \"copyright\" line and a pointer to where the full notice is found.\n\n \n Copyright (C) \n\n This program is free software: you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see .\n\nAlso add information on how to contact you by electronic and paper mail.\n\n If the program does terminal interaction, make it output a short\nnotice like this when it starts in an interactive mode:\n\n Copyright (C) \n This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n This is free software, and you are welcome to redistribute it\n under certain conditions; type `show c' for details.\n\nThe hypothetical commands `show w' and `show c' should show the appropriate\nparts of the General Public License. Of course, your program's commands\nmight be different; for a GUI interface, you would use an \"about box\".\n\n You should also get your employer (if you work as a programmer) or school,\nif any, to sign a \"copyright disclaimer\" for the program, if necessary.\nFor more information on this, and how to apply and follow the GNU GPL, see\n.\n\n The GNU General Public License does not permit incorporating your program\ninto proprietary programs. If your program is a subroutine library, you\nmay consider it more useful to permit linking proprietary applications with\nthe library. If this is what you want to do, use the GNU Lesser General\nPublic License instead of this License. But first, please read\n.\n"
},
{
"path": "README.md",
"content": "# Reliable Feature-Line Driven Quad-Remeshing\n\n[Nico Pietroni](www.nicopietroni.com), Stefano Nuvoli, \n[Thomas Alderighi](http://vcg.isti.cnr.it/~alderighi/), [Paolo Cignoni](http://vcg.isti.cnr.it/~cignoni/), [Marco Tarini](https://tarini.di.unimi.it/)
\n*SIGGRAPH 2021*
\n\n\n\n## Abstract\nWe present a new algorithm for the semi-regular quadrangulation of an input surface, driven by its line features, such as sharp creases. We define a perfectly feature-aligned cross-field and a coarse layout of polygonal-shaped patches where we strictly ensure that all the feature-lines are represented as patch boundaries. To be able to consistently do so, we allow non-quadrilateral patches and T-junctions in the layout; the key is the ability to constrain the layout so that it still admits a globally consistent, T-junction-free, and pure-quad internal tessellation of its patches. This requires the insertion of additional irregular-vertices inside patches, but the regularity of the final- mesh is safeguarded by optimizing for both their number and for their reciprocal alignment. In total, our method guarantees the reproduction of feature-lines by construction, while still producing good quality, isometric, pure-quad, conforming meshes, making it an ideal candidate for CAD models. Moreover, the method is fully automatic, requiring no user intervention, and remarkably reliable, requiring little assumptions on the input mesh, as we demonstrate by batch processing the entire Thingi10K repository, with less than 0.5% of the attempted cases failing to produce a usable mesh.\n\nWebsite: [https://www.quadmesh.cloud/](https://www.quadmesh.cloud/)
\nDOI: [10.1145/3450626.3459941](https://doi.org/10.1145/3450626.3459941) ACM Transactions on Graphics (SIGGRAPH), 2021\n\n**BibTex**\n```\n@article{10.1145/3450626.3459941,\nauthor = {Pietroni, Nico and Nuvoli, Stefano and Alderighi, Thomas and Cignoni, Paolo and Tarini, Marco},\ntitle = {Reliable Feature-Line Driven Quad-Remeshing},\nyear = {2021},\nissue_date = {August 2021},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nvolume = {40},\nnumber = {4},\nissn = {0730-0301},\nurl = {https://doi.org/10.1145/3450626.3459941},\ndoi = {10.1145/3450626.3459941},\nabstract = {We present a new algorithm for the semi-regular quadrangulation of an input surface, driven by its line features, such as sharp creases. We define a perfectly feature-aligned cross-field and a coarse layout of polygonal-shaped patches where we strictly ensure that all the feature-lines are represented as patch boundaries. To be able to consistently do so, we allow non-quadrilateral patches and T-junctions in the layout; the key is the ability to constrain the layout so that it still admits a globally consistent, T-junction-free, and pure-quad internal tessellation of its patches. This requires the insertion of additional irregular-vertices inside patches, but the regularity of the final-mesh is safeguarded by optimizing for both their number and for their reciprocal alignment. In total, our method guarantees the reproduction of feature-lines by construction, while still producing good quality, isometric, pure-quad, conforming meshes, making it an ideal candidate for CAD models. Moreover, the method is fully automatic, requiring no user intervention, and remarkably reliable, requiring little assumptions on the input mesh, as we demonstrate by batch processing the entire Thingi10K repository, with less than 0.5% of the attempted cases failing to produce a usable mesh.},\njournal = {ACM Trans. Graph.},\nmonth = {jul},\narticleno = {155},\nnumpages = {17},\nkeywords = {geometry processing, quad-meshing, modelling}\n}\n```\n\n### Download\n```bash\ngit clone --recursive https://github.com/nicopietroni/quadwild\n```\n\n### Build\nInstall the libraries boost and gurobi. \nIn Ubuntu you can install boost easily with the following terminal commands:\n```\napt-get install libboost-dev\n```\nOpen the file libs/libs.pri and set the paths of the requested libraries and the gurobi parameters:\n```\n#External libraries\nBOOST_PATH = /usr/include/boost/\nGUROBI_PATH = /opt/gurobi950/linux64/\nGUROBI_COMPILER = gurobi_g++5.2\nGUROBI_LIB = gurobi95\n```\n\n
\n\nIf you do not need CoMISo, you can simply remove the define `COMISO_FIELD` in the file libs.pri:\n```\n#DEFINES += COMISO_FIELD\n```\nHowever, for organic meshes, we suggest to abilitate CoMISo. You need to compile it along with its dependencies (BLAS):\n```\napt install libblas-dev\ncd quadwild/libs/CoMISo\nmkdir build\ncd build\ncmake ..\nmake\n```\n\n
\n\nYou can now compile the project quadwild/quadwild.pro with qmake or QtCreator.\n\nIn case you have technical issues or building problems, please write to [stefano.nuvoli@gmail.com](mailto:stefano.nuvoli@gmail.com) or [nico.pietroni@uts.edu.au](mailto:nico.pietroni@uts.edu.au).\n\n### Run\nThe package is composed of the main command-line quad-remesher (quadwild) and three different components (field_computation, field_tracing, quad_from_patches) that perform different steps of the pipeline.\n\n---\n\n#### quadwild\nThis project has no visual interface and can be used via command-line. This can be helpful to batch run entire datasets of models. To run the project, once builded, execute the following terminal command:\n```\n./quadwild [.txt setup file] [.rosy file] [.sharp file]\n```\nThe command takes as input a mesh and three optional configuration files:\n\n- **``**: filename of the input triangle mesh. **The mesh can be either an obj or a ply.**\n \n- **`.txt setup file` (optional):** The txt setup file contains the parameters in the pipeline. By default, the executable loads the file basic_setup.txt and two other examples are included: basic_setup_mechanical.txt and basic_setup_organic.txt. Any setup parameter can be specified to control the output result. The setup file has the following fields:\n```\ndo_remesh 1 \t\t //remesh (1) or not (0) the input mesh\nsharp_feature_thr 35 //the dihedral angle of sharp features (-1 no features)\nalpha 0.02 //regularity vs isometry of the final tessellation. Close to zero -> more regular, Close to 1 -> more singularity are inserted\nscaleFact 1 //the scale of the final quadrangulation (the bigger the bigger the quads)\n```\n\n- **`.rosy file` (optional)**: This optional file contains parameters for the field computation of the field.\n```\nfn //number of faces of the mesh\n4 //directions of the field (always 4 for a cross-field)\nx0 y0 z0 //XYZ directions of one vector of the cross-field of the first face\n...\nxn yn zn //XYZ directions of one vector of the cross-field of the n-th face\n```\n\n- **`.sharp file` (optional)**: This optional file contains the informations of the sharp features. Note that, in the pipeline, border edges are considered sharp features by default.\n```\nsn //number of sharp features\nt0 f0 e0 //for each sharp edge: the first integer is 0 if the edge is concave 1 if convex, then the face and the index of the sharp edge\n...\ntn fn en //nth sharp edge\n```\n\nThe output of quadwild consists of several files:\n- **The output smooth quadrangulation (suffix quadrangulation_smooth.obj).**\n- The output quadrangulation before being smoothed (suffix quadrangulation.obj).\n- Other files:\n - The re-meshed triangulated mesh (suffix rem.obj), the relative field and the sharp features automatically computed (.rosy and .sharp files as above).\n - The mesh decomposed after the tracing (suffix rem_p0.obj).\n - The patch decomposition (.patch file) contains the patch index for each triangle of the rem_p0 mesh.\n - The files .corners, .c_feature, .feature files that contain per patch information (respectively corners of each patch, corners to be fixed and feature lines on the patches).\n\n---\n\n#### field_computation. \nThe program can be used either with a GUI or by command line (useful to batch run entire datasets of models).\n```\n./field_computation [.txt setup file] [.rosy file][.sharp file] [batch]\n```\nThe \"batch\" option makes the program run in the shell without the GUI. The setup file includes additional parameters. By default, the executable loads the file basic_setup.txt.\n\n---\n\n#### field_tracing\nThis program is used to trace fields and split the mesh into patches.\n```\n./field_tracing [.txt setup file] [batch]\n```\nIt requires having a .rosy and a .sharp file (with the same name of the mesh file). The \"batch\" option makes the program run in the shell without the GUI. The setup file includes additional parameters. By default, the executable loads the file basic_setup.txt.\n\n---\n\n#### quad_from_patches\nThis program is used to obtain a quadrangulation from a patch decomposition.\n```\n./quad_from_patches [.txt setup file]\n```\nIt requires to have in the same folder a .corners, .c_feature, .feature files (with the same name of the mesh file). The setup file includes additional parameters. By default, the executable loads the file basic_setup.txt.\n\n## Note\nThe code has slightly changed and the results could be different from the ones showed in the paper.\n\n## License\n[GPL3](LICENSE) licensed\n([FAQ](https://www.gnu.org/licenses/gpl-faq.html))\n\n\n\n"
},
{
"path": "components/field_computation/AutoRemesher.h",
"content": "/***************************************************************************/\r\n/* Copyright(C) 2021\r\n\r\n\r\nThe authors of\r\n\r\nReliable Feature-Line Driven Quad-Remeshing\r\nSiggraph 2021\r\n\r\n\r\n All rights reserved.\r\nThis program is free software: you can redistribute it and/or modify\r\nit under the terms of the GNU General Public License as published by\r\nthe Free Software Foundation, either version 3 of the License, or\r\n(at your option) any later version.\r\n\r\nThis program is distributed in the hope that it will be useful,\r\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\r\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\nGNU General Public License for more details.\r\n\r\nYou should have received a copy of the GNU General Public License\r\nalong with this program. If not, see .\r\n****************************************************************************/\r\n\r\n#ifndef AUTOREMESHER_H\r\n#define AUTOREMESHER_H\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \r\n\r\ntemplate \r\nclass AutoRemesher {\r\n\r\n typedef typename Mesh::ScalarType ScalarType;\r\n typedef typename Mesh::CoordType CoordType;\r\n\r\n typedef typename Mesh::VertexType VertexType;\r\n typedef typename Mesh::VertexPointer VertexPointer;\r\n\r\n typedef typename Mesh::FaceType FaceType;\r\n typedef typename Mesh::FacePointer FacePointer;\r\n\r\n typedef vcg::GridStaticPtr StaticGrid;\r\n\r\n static ScalarType computeAR(Mesh & m, const double perc = 0.05)\r\n {\r\n vcg::tri::ForEachFace(m, [] (FaceType & f) {\r\n f.Q() = vcg::QualityRadii(f.cP(0), f.cP(1), f.cP(2));\r\n //std::cout<<\"Q:\"< hist;\r\n vcg::tri::Stat::ComputePerFaceQualityHistogram(m, hist);\r\n\r\n //\t\t return hist.MinV();\r\n return hist.Percentile(perc);\r\n }\r\npublic:\r\n\r\n static bool collapseSurvivingMicroEdges(Mesh & m, const ScalarType qualityThr = 0.001, const ScalarType edgeRatio = 0.025, const int maxIter = 2)\r\n {\r\n typedef vcg::tri::BasicVertexPair VertexPair;\r\n typedef vcg::tri::EdgeCollapser Collapser;\r\n typedef typename vcg::face::Pos PosType;\r\n\r\n bool done=false;\r\n int count = 0; int iter = 0;\r\n do\r\n {\r\n count = 0;\r\n vcg::tri::UpdateTopology::VertexFace(m);\r\n\r\n for(auto fi=m.face.begin(); fi!=m.face.end(); ++fi)\r\n if(!(*fi).IsD())\r\n {\r\n if(vcg::QualityRadii(fi->cP(0), fi->cP(1), fi->cP(2)) <= qualityThr)\r\n {\r\n ScalarType minEdgeLength = std::numeric_limits::max();\r\n ScalarType maxEdgeLength = 0;\r\n\r\n int minEdge = 0, maxEdge = 0;\r\n for(auto i=0; i<3; ++i)\r\n {\r\n const ScalarType len = vcg::Distance(fi->cP0(i), fi->cP1(i)) ;\r\n if (len < minEdgeLength)\r\n {\r\n minEdge = i;\r\n minEdgeLength = len;\r\n }\r\n if (len > maxEdgeLength)\r\n {\r\n maxEdge = i;\r\n maxEdgeLength = len;\r\n }\r\n }\r\n\r\n // if (minEdgeLength <= maxEdgeLength * edgeRatio)\r\n // {\r\n PosType pi(&*fi, minEdge);\r\n\r\n // //select the vertices\r\n // (*fi).V(0)->SetS();\r\n // (*fi).V(1)->SetS();\r\n // (*fi).V(2)->SetS();\r\n // (*fi).FFp(minEdge)->V(0)->SetS();\r\n // (*fi).FFp(minEdge)->V(1)->SetS();\r\n // (*fi).FFp(minEdge)->V(2)->SetS();\r\n\r\n VertexPair bp = VertexPair(fi->V0(minEdge), fi->V1(minEdge));\r\n CoordType mp = (fi->cP0(minEdge) + fi->cP1(minEdge))/2.f;\r\n\r\n if(Collapser::LinkConditions(bp))\r\n {\r\n Collapser::Do(m, bp, mp, true);\r\n done=true;\r\n }\r\n // }\r\n }\r\n }\r\n } while (count > 0 && ++iter < maxIter);\r\n return done;\r\n }\r\nprivate:\r\n static void MakeEdgeSelConsistent(Mesh & m)\r\n {\r\n for (size_t i=0;iSetFaceEdgeS(EdgeI);\r\n }\r\n }\r\n }\r\n\r\n static void SelectAllBoundaryV(Mesh & m)\r\n {\r\n for (size_t i=0;iSetS();\r\n m.face[i].V1(j)->SetS();\r\n continue;\r\n }\r\n\r\n if (m.face[i].IsFaceEdgeS(j))\r\n {\r\n m.face[i].V0(j)->SetS();\r\n m.face[i].V1(j)->SetS();\r\n FaceType *f1=m.face[i].FFp(j);\r\n int EdgeI=m.face[i].FFi(j);\r\n f1->SetFaceEdgeS(EdgeI);\r\n }\r\n }\r\n }\r\n\r\npublic:\r\n\r\n typedef struct Params {\r\n int iterations = 15;\r\n ScalarType targetAspect = 0.35;\r\n int targetDeltaFN = 5000;\r\n int initialApproximateFN = 20000;\r\n ScalarType creaseAngle = 25.;\r\n //bool userSelectedCreases = true;\r\n bool surfDistCheck = true;\r\n int erodeDilate = 0;\r\n ScalarType minAdaptiveMult = 0.3;\r\n ScalarType maxAdaptiveMult = 3;\r\n ScalarType minAspectRatioThr = 0.05;\r\n ScalarType targetEdgeLen = 0;\r\n } Params;\r\n\r\n static size_t openNonManifoldEdges(Mesh & m, const ScalarType moveThreshold,\r\n bool debugMesg=false)\r\n {\r\n\r\n vcg::tri::UpdateTopology::FaceFace(m);\r\n vcg::tri::UpdateTopology::VertexFace(m);\r\n vcg::tri::UpdateFlags::VertexClearV(m);\r\n\r\n if (debugMesg)\r\n {\r\n std::cout << \"Opening non-manifold edges...\";\r\n std::cout << \"mesh starts with \" << vcg::tri::Clean::CountNonManifoldEdgeFF(m) << std::endl;\r\n }\r\n\r\n typedef typename vcg::face::Pos PosType;\r\n\r\n typedef std::vector > > VertexToFaceGroups;\r\n\r\n std::unordered_map map;\r\n\r\n vcg::tri::ForEachFacePos(m, [&](PosType & pos) {\r\n\r\n if (!pos.V()->IsV() && !pos.IsManifold())\r\n {\r\n pos.V()->SetV();\r\n\r\n std::vector faceVec;\r\n std::vector vIndices;\r\n vcg::face::VFStarVF(pos.V(), faceVec, vIndices);\r\n\r\n std::unordered_set inserted;\r\n\r\n VertexToFaceGroups faceGroups;\r\n\r\n for (size_t i = 0; i < faceVec.size(); ++i)\r\n {\r\n const FacePointer fp = faceVec[i];\r\n\r\n size_t fidx = vcg::tri::Index(m, fp);\r\n if (inserted.count(fidx) != 0)\r\n continue;\r\n\r\n std::vector > manifoldGroup;\r\n\r\n PosType cyclePos(fp, vIndices[i]);\r\n PosType beginPos = cyclePos;\r\n //get to a non manifold edge...\r\n do\r\n {\r\n manifoldGroup.push_back(std::make_pair(vcg::tri::Index(m, cyclePos.F()), cyclePos.VInd()));\r\n inserted.insert(vcg::tri::Index(m, cyclePos.F()));\r\n cyclePos.F()->Q() = faceGroups.size() + 1;\r\n cyclePos.FlipE();\r\n cyclePos.NextF();\r\n } while (cyclePos.IsManifold() && !cyclePos.IsBorder() && cyclePos != beginPos);\r\n\r\n if (cyclePos != beginPos)\r\n {\r\n cyclePos = beginPos;\r\n cyclePos.NextF();\r\n\r\n while (cyclePos.IsManifold() && !cyclePos.IsBorder())\r\n {\r\n manifoldGroup.push_back(std::make_pair(vcg::tri::Index(m, cyclePos.F()), cyclePos.VInd()));\r\n inserted.insert(vcg::tri::Index(m, cyclePos.F()));\r\n cyclePos.F()->Q() = faceGroups.size() + 1;\r\n cyclePos.FlipE();\r\n cyclePos.NextF();\r\n }\r\n }\r\n\r\n faceGroups.push_back(manifoldGroup);\r\n }\r\n\r\n map[vcg::tri::Index(m, pos.V())] = faceGroups;\r\n }\r\n });\r\n\r\n for (auto group : map)\r\n {\r\n const size_t vert = group.first;\r\n const VertexToFaceGroups & faceGroups = group.second;\r\n if (faceGroups.size() > 1)\r\n {\r\n auto vp = vcg::tri::Allocator::AddVertices(m, faceGroups.size()-1);\r\n\r\n for (size_t i = 1; i < faceGroups.size(); ++i)\r\n {\r\n vp->P() = m.vert[vert].cP();\r\n\r\n CoordType delta(0, 0, 0);\r\n for (std::pair faceVertIndex : faceGroups[i])\r\n {\r\n m.face[faceVertIndex.first].V(faceVertIndex.second) = &*vp;\r\n delta += vcg::Barycenter(m.face[faceVertIndex.first]) - vp->cP();\r\n }\r\n delta /= faceGroups[i].size();\r\n vp->P() += delta * moveThreshold;\r\n ++vp;\r\n }\r\n }\r\n }\r\n\r\n return map.size();\r\n }\r\n\r\n\r\n// static ScalarType ExpectedEdgeL(const Mesh & m,\r\n// size_t TargetSph=2000,\r\n// size_t MinFaces=15000)\r\n// {\r\n// ScalarType Vol=m.Volume();\r\n// ScalarType A=m.Area();\r\n// ScalarType FaceA=A/TargetSph;\r\n// //radius and volume of a sphere\r\n// ScalarType KScale=(Vol/A)*(3/(m.bbox.Diag()/3.4));\r\n// //ScalarType KScale=(A*(m.bbox.Diag()/3.4))/(3*Vol);\r\n// ScalarType IdealA=FaceA*KScale;\r\n// ScalarType IdealL0=sqrt(IdealA*2.309);\r\n// ScalarType IdealL1=sqrt((A*2.309)/MinFaces);\r\n// std::cout<<\"KScale\"< > Features;\r\n for (size_t i=0;iClearFaceEdgeS(m.face[i].FFi(j));\r\n }\r\n }\r\n\r\n m.InitFeatureCoordsTable();\r\n //MeshPrepocess::InitSharpFeatures(mesh,BPar.sharp_feature_thr,BPar.feature_erode_dilate);\r\n\r\n }\r\n\r\n //for big meshes disabling par.surfDistCheck provides big perf improvements, sacrificing result accuracy\r\n //static std::shared_ptr Remesh (Mesh & m, Params & par)\r\n static void RemeshAdapt(Mesh & m, Params & par)\r\n {\r\n\r\n vcg::tri::UpdateBounding::Box(m);\r\n vcg::tri::UpdateTopology::FaceFace(m);\r\n\r\n typename vcg::tri::IsotropicRemeshing::Params para;\r\n para.iter = par.iterations;\r\n //para.SetFeatureAngleDeg(par.creaseAngle);\r\n\r\n para.splitFlag = true;\r\n para.swapFlag = true;\r\n para.collapseFlag = true;\r\n para.smoothFlag = true;\r\n para.projectFlag = true;\r\n para.selectedOnly = false;\r\n para.adapt=false;\r\n para.aspectRatioThr = 0.3;\r\n para.cleanFlag = true;\r\n\r\n para.minAdaptiveMult = par.minAdaptiveMult;\r\n para.maxAdaptiveMult = par.maxAdaptiveMult;\r\n\r\n para.maxSurfDist = m.bbox.Diag() / 2500.;\r\n para.surfDistCheck = m.FN() < 400000 ? par.surfDistCheck : false;\r\n para.userSelectedCreases = true;\r\n\r\n\r\n\r\n ScalarType edgeL = ExpectedEdgeL(m);//,par.initialApproximateFN);//std::sqrt(2.309 * vcg::tri::Stat::ComputeMeshArea(m) / par.initialApproximateFN);//m.bbox.Diag() * 0.025;//std::sqrt(vcg::tri::Stat::ComputeMeshArea(m) * 2 / par.initialApproximateFN);\r\n\r\n if (par.targetEdgeLen == 0)\r\n par.targetEdgeLen = edgeL;\r\n\r\n para.SetTargetLen(par.targetEdgeLen);\r\n\r\n\r\n std::cout << \"Before Remeshing - faces: \" << m.FN() << \" quality: \" << computeAR(m) << std::endl;\r\n vcg::tri::IsotropicRemeshing::Do(m, para);\r\n std::cout << \"After Iter 0 - faces: \" << m.FN() << \" quality: \" << computeAR(m) << std::endl;\r\n\r\n\r\n const ScalarType thr = 0.01;\r\n\r\n //vcg::tri::UpdateSelection::VertexClear(m);\r\n collapseSurvivingMicroEdges(m,thr);\r\n\r\n UpdateCoherentSharp(m,par);\r\n\r\n para.adapt = true;\r\n para.smoothFlag = true;\r\n para.maxSurfDist = m.bbox.Diag() / 2500.;\r\n\r\n vcg::tri::IsotropicRemeshing::Do(m, para);\r\n\r\n m.UpdateDataStructures();\r\n\r\n std::cout << \"After Iter 1 - faces: \" << m.FN() << \" quality: \" << computeAR(m) << std::endl;\r\n\r\n// MakeEdgeSelConsistent(m);\r\n// SelectAllBoundaryV(m);\r\n// typename Local_Param_Smooth::UVSmoothParam UVP;\r\n// UVP.FixSel=true;\r\n\r\n// Local_Param_Smooth::Smooth(m,UVP);\r\n// m.UpdateDataStructures();\r\n// std::cout << \"After Iter 2 - faces: \" << m.FN() << \" quality: \" << computeAR(m) << std::endl;\r\n\r\n }\r\n\r\n\r\n // static int SelectToRemesh(Mesh & m,ScalarType minR=0.2,size_t dilate=3)\r\n // {\r\n // vcg::tri::UpdateSelection::FaceClear(m);\r\n // for (size_t i=0;i::VertexClear(m);\r\n //// for (size_t i=0;iSetS();\r\n //// m.face[i].V1(j)->SetS();\r\n //// }\r\n //// for (size_t i=0;iIsS())continue;\r\n //// if (!m.face[i].V1(j)->IsS())continue;\r\n //// m.face[i].SetS();\r\n //// }\r\n\r\n // vcg::tri::UpdateSelection::VertexClear(m);\r\n // for (size_t s=0;s::VertexFromFaceLoose(m);\r\n // vcg::tri::UpdateSelection::FaceFromVertexLoose(m);\r\n // }\r\n\r\n // int numS=0;\r\n // for (size_t i=0;i::Box(m);\r\n // vcg::tri::UpdateTopology::FaceFace(m);\r\n\r\n // typename vcg::tri::IsotropicRemeshing::Params para;\r\n // para.iter = par.iterations;\r\n // //para.SetFeatureAngleDeg(par.creaseAngle);\r\n\r\n // para.splitFlag = true;\r\n // para.swapFlag = true;\r\n // para.collapseFlag = true;\r\n // para.smoothFlag = false;\r\n // para.projectFlag = false;\r\n // para.selectedOnly = false;\r\n // para.adapt=false;\r\n // para.aspectRatioThr = 0.3;\r\n // para.cleanFlag = true;\r\n // para.minAdaptiveMult = par.minAdaptiveMult;\r\n // para.maxAdaptiveMult = par.maxAdaptiveMult;\r\n\r\n // para.maxSurfDist = m.bbox.Diag() / 2500.;\r\n // para.surfDistCheck = m.FN() < 400000 ? par.surfDistCheck : false;\r\n // para.userSelectedCreases = true;\r\n\r\n // ScalarType edgeL = ExpectedEdgeL(m);\r\n\r\n // //if (par.targetEdgeLen == 0)\r\n // par.targetEdgeLen = edgeL;\r\n\r\n // para.SetTargetLen(par.targetEdgeLen);\r\n\r\n // std::cout << \"Before Remeshing - faces: \" << m.FN() << \" quality: \" << computeAR(m) << std::endl;\r\n // vcg::tri::IsotropicRemeshing::Do(m, para);\r\n // std::cout << \"After Iter 0 - faces: \" << m.FN() << \" quality: \" << computeAR(m) << std::endl;\r\n\r\n\r\n // MakeEdgeSelConsistent(m);\r\n // SelectAllBoundaryV(m);\r\n // typename Local_Param_Smooth::UVSmoothParam UVP;\r\n // UVP.FixSel=true;\r\n\r\n // Local_Param_Smooth::Smooth(m,UVP);\r\n\r\n\r\n // //const ScalarType thr = 0.01;\r\n // collapseSurvivingMicroEdges(m, 0.01);\r\n\r\n // m.UpdateDataStructures();\r\n\r\n // int MaxS=3;\r\n // int currS=0;\r\n // int NumSel0=0;\r\n // int NumSel1=0;\r\n // do{\r\n // // MakeEdgeSelConsistent(m);\r\n // // SelectAllBoundaryV(m);\r\n // // typename Local_Param_Smooth::UVSmoothParam UVP;\r\n // // UVP.FixSel=true;\r\n\r\n // //Local_Param_Smooth::Smooth(m,UVP);\r\n\r\n // NumSel0=NumBadTris(m);\r\n // std::cout << \"Not Nice 0: \" << NumSel0 << \" Faces\"<0)\r\n // {\r\n // par.targetEdgeLen*=0.75;\r\n // para.SetTargetLen(par.targetEdgeLen);\r\n // para.maxSurfDist = m.bbox.Diag() / 2500.;\r\n // //para.selectedOnly=true;\r\n // para.adapt=true;\r\n // para.smoothFlag= true;\r\n // vcg::tri::IsotropicRemeshing::Do(m, para);\r\n // collapseSurvivingMicroEdges(m, 0.01);\r\n // m.UpdateDataStructures();\r\n // }\r\n\r\n // NumSel1=NumBadTris(m);\r\n // std::cout << \"Not Nice 1: \" << NumSel1 << \" Faces\"<::Box(m);\r\n //// vcg::tri::UpdateTopology::FaceFace(m);\r\n\r\n // typename vcg::tri::IsotropicRemeshing::Params para;\r\n // para.iter = par.iterations;\r\n // para.SetFeatureAngleDeg(par.creaseAngle);\r\n // para.splitFlag = true;\r\n // para.swapFlag = true;\r\n // para.collapseFlag = true;\r\n // para.smoothFlag = false;\r\n // para.projectFlag = true;\r\n // para.selectedOnly = false;\r\n // para.adapt=false;\r\n // para.aspectRatioThr = 0.3;\r\n // para.cleanFlag = false;\r\n\r\n // para.minAdaptiveMult = par.minAdaptiveMult;\r\n // para.maxAdaptiveMult = par.maxAdaptiveMult;\r\n\r\n // para.maxSurfDist = m.bbox.Diag() / 2500.;\r\n // para.surfDistCheck = m.FN() < 400000 ? par.surfDistCheck : false;\r\n // para.userSelectedCreases = true;//par.userSelectedCreases;\r\n\r\n //// ScalarType prevFN = m.FN();\r\n //// ScalarType deltaFN = m.FN();\r\n\r\n //// ScalarType aspect = 0;\r\n //// ScalarType edgeLow = 0;\r\n // ScalarType edgeL = std::sqrt(2.309 * vcg::tri::Stat::ComputeMeshArea(m) / par.initialApproximateFN);//m.bbox.Diag() * 0.025;//std::sqrt(vcg::tri::Stat::ComputeMeshArea(m) * 2 / par.initialApproximateFN);\r\n\r\n // if (par.targetEdgeLen == 0)\r\n // par.targetEdgeLen = edgeL;\r\n\r\n //// ScalarType edgeHigh = edgeL * 2.;\r\n\r\n //// para.SetTargetLen(par.targetEdgeLen);\r\n\r\n //// vcg::tri::Append::MeshCopy(*ret, m);\r\n\r\n //// ret->UpdateDataStructures();\r\n\r\n //// ret->InitSharpFeatures(par.creaseAngle);\r\n //// ret->ErodeDilate(par.erodeDilate);\r\n\r\n\r\n // vcg::tri::IsotropicRemeshing::Do(m, para);\r\n // std::cout << \"Iter: \"<< 0 << \" faces: \" <UpdateDataStructures();\r\n //// ret->InitSharpFeatures(par.creaseAngle);\r\n //// ret->ErodeDilate(par.erodeDilate);\r\n //// MP.InitSharpFeatures(par.creaseAngle);\r\n //// MP.ErodeDilate(par.erodeDilate);\r\n\r\n // //para.SetTargetLen(par.targetEdgeLen * 0.85);\r\n // para.adapt = true;\r\n // para.smoothFlag = true;\r\n // para.maxSurfDist = m.bbox.Diag() / 2500.;\r\n\r\n // vcg::tri::IsotropicRemeshing::Do(m, para);\r\n // auto quality = computeAR(m);\r\n // std::cout << \"Iter: \"<< 1 << \" faces: \" << m.FN() << \" quality: \" << quality << std::endl;\r\n\r\n // std::cerr << \"[REMESH] RemeshedFaces:\" << m.FN() << std::endl;\r\n // std::cerr << \"[REMESH] RemeshedAspect:\" << computeAR(m) << std::endl;\r\n\r\n // const ScalarType thr = 0.01;\r\n // collapseSurvivingMicroEdges(m, thr);\r\n\r\n // vcg::tri::UpdateSelection::FaceClear(m);\r\n // vcg::tri::UpdateTopology::FaceFace(m);\r\n\r\n // vcg::tri::ForEachFace(m, [&] (FaceType & f) {\r\n // if (!f.IsD() && vcg::QualityRadii(f.cP(0), f.cP(1), f.cP(2)) <= 0.01)\r\n // f.SetS();\r\n // });\r\n\r\n // int zeroArea = 0;\r\n // do\r\n // {\r\n // zeroArea = vcg::tri::Clean::RemoveZeroAreaFace(m);\r\n // std::cout << \"removed \" << zeroArea << \" zero area faces \" << std::endl;\r\n // }\r\n // while(zeroArea != 0);\r\n\r\n // vcg::tri::UpdateSelection::FaceDilate(m);\r\n // //\t\tvcg::tri::UpdateSelection::FaceDilate(*ret);\r\n // //\t\tvcg::tri::Smooth::VertexCoordLaplacian(*ret, 15, true);\r\n\r\n // vcg::tri::Allocator::CompactEveryVector(m);\r\n // std::cout << \"[REMESH] remeshing ends..\" << std::endl;\r\n // //return ret;\r\n // }\r\n};\r\n\r\n#endif // AUTOREMESHER_H\r\n"
},
{
"path": "components/field_computation/AutoRemesherMio.h",
"content": " typedef vcg::tri::EdgeCollapser Collapser;\r\n"
},
{
"path": "components/field_computation/basic_setup.txt",
"content": "do_remesh 1\nremesh_iterations 15\nremesh_target_aspect_ratio 0.35\nremesh_termination_delta 10000\nsharp_feature_thr 35\nsharp_feature_erode_dilate 4\nalpha 0.3\n"
},
{
"path": "components/field_computation/basic_setup_mechanical.txt",
"content": "do_remesh 1\nremesh_iterations 15\nremesh_target_aspect_ratio 0.35\nremesh_termination_delta 10000\nsharp_feature_thr 35\nsharp_feature_erode_dilate 4\nalpha 0.3\n"
},
{
"path": "components/field_computation/basic_setup_organic.txt",
"content": "do_remesh 1\nremesh_iterations 15\nremesh_target_aspect_ratio 0.35\nremesh_termination_delta 10000\nsharp_feature_thr -1\nsharp_feature_erode_dilate 4\nalpha 0.3\n"
},
{
"path": "components/field_computation/compute_field_300_mechanical.command",
"content": "#!/bin/bash\n\nfor i in ../../test/300/Mechanical/*.obj; do\n\n\n complete_file=\"${i}\"\n only_file_name=$(basename $complete_file)\n dir_name=\"${complete_file%.*}\"\n dir_name+=\"/\"\n\n\n new_filename=\"${dir_name}\"\"${only_file_name}\"\n\n ./field_computation \"${new_filename}\" basic_setup_mechanical.txt batch\ndone\n"
},
{
"path": "components/field_computation/compute_field_300_organic.command",
"content": "#!/bin/bash\n\nfor i in ../../test/300/Organic/*.obj; do\n\n\n complete_file=\"${i}\"\n only_file_name=$(basename $complete_file)\n dir_name=\"${complete_file%.*}\"\n dir_name+=\"/\"\n\n\n new_filename=\"${dir_name}\"\"${only_file_name}\"\n\n ./field_computation \"${new_filename}\" basic_setup_organic.txt batch\ndone\n"
},
{
"path": "components/field_computation/field_computation.pro",
"content": "############################ PROJECT FILES ############################\n\ninclude(../../libs/libs.pri)\n\nHEADERS = \\\n glwidget.h \\\n triangle_mesh_type.h\n\nSOURCES = \\\n glwidget.cpp \\\n main.cpp\n\nHEADERS += \\\n fields/field_smoother.h \\\n fields/n_polyvector.h \\\n fields/polyroots.h\nSOURCES += \\\n fields/n_polyvector.cpp \\\n fields/polyroots.cpp\n\nDEFINES += GLEW_STATIC\nDEFINES += INCLUDE_TEMPLATES\n\n\n############################ TARGET ############################\n\n#App config\nTARGET = field_computation\n\nTEMPLATE = app\nCONFIG += qt\nCONFIG += c++11\nCONFIG -= app_bundle\n\nQT += core gui opengl xml widgets\n\n#Debug/release optimization flags\nCONFIG(debug, debug|release){\n DEFINES += DEBUG\n}\nCONFIG(release, debug|release){\n DEFINES -= DEBUG\n #just uncomment next line if you want to ignore asserts and got a more optimized binary\n CONFIG += FINAL_RELEASE\n}\n\n#Final release optimization flag\nFINAL_RELEASE {\n unix:!macx{\n QMAKE_CXXFLAGS_RELEASE -= -g -O2\n QMAKE_CXXFLAGS += -O3 -DNDEBUG\n }\n}\n\nmacx {\n QMAKE_MACOSX_DEPLOYMENT_TARGET = 10.13\n QMAKE_MAC_SDK = macosx10.13\n}\n\n\n############################ INCLUDES ############################\n\n#vcglib\nINCLUDEPATH += $$VCGLIB_PATH\nSOURCES += $$VCGLIB_PATH/wrap/ply/plylib.cpp\nSOURCES += $$VCGLIB_PATH/wrap/gui/trackball.cpp\nSOURCES += $$VCGLIB_PATH/wrap/gui/trackmode.cpp\nSOURCES += $$VCGLIB_PATH/wrap/qt/anttweakbarMapperNew.cpp\n\n#eigen\nINCLUDEPATH += $$EIGEN_PATH\n\n#libigl\nINCLUDEPATH += $$LIBIGL_PATH/include\nHEADERS += \\\n $$LIBIGL_PATH/include/igl/principal_curvature.h\nSOURCES += \\\n $$LIBIGL_PATH/include/igl/principal_curvature.cpp\n\n#AntTweakBar\nINCLUDEPATH += $$ANTTWEAKBAR_PATH/include\nLIBS += -L$$ANTTWEAKBAR_PATH/lib -lAntTweakBar\nwin32{ # Awful problem with windows..\n DEFINES += NOMINMAX\n}\n\n#glew\nunix:!mac{\n LIBS += -lGLU\n}\nINCLUDEPATH += $$GLEW_PATH/include\nSOURCES += $$GLEW_PATH/src/glew.c\n\ncontains(DEFINES, COMISO_FIELD) {\n #comiso\n LIBS += -L$$COMISO_PATH/build/Build/lib/CoMISo/ -lCoMISo\n INCLUDEPATH += $$COMISO_PATH/..\n\n #gmm (we have to use comiso gmm)\n INCLUDEPATH += $$GMM_PATH/include\n\n HEADERS += \\\n $$LIBIGL_PATH/include/igl/copyleft/comiso/nrosy.h\n SOURCES += \\\n $$LIBIGL_PATH/include/igl/copyleft/comiso/nrosy.cpp\n}\n\n# Mac specific Config required to avoid to make application bundles\nmacx{\n# CONFIG -= app_bundle\n# LIBS += $$ANTTWEAKBAR_PATH/lib/libAntTweakBar.dylib\n QMAKE_POST_LINK +=\"cp -P ../../../code/lib/AntTweakBar1.16/lib/libAntTweakBar.dylib . ; \"\n QMAKE_POST_LINK +=\"install_name_tool -change ../lib/libAntTweakBar.dylib ./libAntTweakBar.dylib $$TARGET ; \"\n# QMAKE_POST_LINK +=\"install_name_tool -change libCoMISo.dylib $$COMISO_PATH/build/Build/lib/CoMISo/libCoMISo.dylib $$TARGET ;\"\n DEPENDPATH += .\n# DEPENDPATH += $$COMISO_PATH/build/Build/lib/CoMISo\n# INCLUDEPATH += $$COMISO_PATH/build/Build/lib/CoMISo\n}\n\n#Parallel computation\nunix:!mac {\n QMAKE_CXXFLAGS += -fopenmp\n LIBS += -fopenmp\n}\n#macx{\n# QMAKE_CXXFLAGS += -Xpreprocessor -fopenmp -lomp -I/usr/local/include\n# QMAKE_LFLAGS += -lomp\n# LIBS += -L /usr/local/lib /usr/local/lib/libomp.dylib\n#}\n\nwin32{\n DEFINES += NOMINMAX # Awful problem with windows..\n DEFINES *= _USE_MATH_DEFINES\n DEFINES *= _SCL_SECURE_NO_DEPRECATE\n QMAKE_CXXFLAGS *= /bigobj\n}\n"
},
{
"path": "components/field_computation/fields/field_smoother.h",
"content": "/****************************************************************************\n* VCGLib o o *\n* Visual and Computer Graphics Library o o *\n* _ O _ *\n* Copyright(C) 2014 \\/)\\/ *\n* Visual Computing Lab /\\/| *\n* ISTI - Italian National Research Council | *\n* \\ *\n* All rights reserved. *\n* *\n* This program is free software; you can redistribute it and/or modify *\n* it under the terms of the GNU General Public License as published by *\n* the Free Software Foundation; either version 2 of the License, or *\n* (at your option) any later version. *\n* *\n* This program is distributed in the hope that it will be useful, *\n* but WITHOUT ANY WARRANTY; without even the implied warranty of *\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *\n* for more details. *\n* *\n****************************************************************************/\n\n#ifndef QR_FIELD_SMOOTHER_H\n#define QR_FIELD_SMOOTHER_H\n\n//eigen stuff\n#include \n\n//vcg stuff\n#include \n#include \n#include \n#include \n\n//igl related stuff\n\n#include \"fields/n_polyvector.h\"\n#include \n#include \n\n#ifdef COMISO_FIELD\n#include \n#endif\n\nnamespace vcg {\nnamespace tri {\n\nenum SmoothMethod{SMMiq,SMNPoly,SMIterative};\n\ntemplate \nclass FieldSmoother\n{\n typedef typename MeshType::FaceType FaceType;\n typedef typename MeshType::VertexType VertexType;\n typedef typename MeshType::ScalarType ScalarType;\n typedef typename MeshType::CoordType CoordType;\n\n\n static void InitQualityByAnisotropyDir(MeshType &mesh)\n {\n ScalarType minV=0.00001;\n std::vector QVal;\n for (size_t i=0;i1)NMax=1;\n if (NMax<-1)NMax=-1;\n\n if (NMin>1)NMin=1;\n if (NMin<-1)NMin=-1;\n\n ScalarType CurvAni=(NMax-NMin)/2;\n CurvAni=std::max(CurvAni,minV);\n mesh.vert[i].Q()=CurvAni;\n }\n vcg::tri::UpdateQuality::FaceFromVertex(mesh);\n }\n\n static void SetEdgeDirection(FaceType *f,int edge)\n {\n CoordType dir=f->P0(edge)-f->P1(edge);\n dir.Normalize();\n ScalarType prod1=fabs(dir*f->PD1());\n ScalarType prod2=fabs(dir*f->PD2());\n if (prod1>prod2)\n {\n f->PD1()=dir;\n f->PD2()=f->N()^dir;\n }else\n {\n f->PD2()=dir;\n f->PD1()=f->N()^dir;\n }\n }\n\n static void AddSharpEdgesConstraints(MeshType & mesh,\n const ScalarType &thr=0.2)\n {\n for (size_t i=0;iFFp(j);\n if (f0==f1)continue;\n CoordType N0=f0->N();\n CoordType N1=f1->N();\n if ((N0*N1)>thr)continue;\n SetEdgeDirection(f0,j);\n f0->SetS();\n }\n }\n\n static void AddBorderConstraints(MeshType & mesh)\n {\n for (size_t i=0;iFFp(j);\n assert(f1!=NULL);\n if (f0!=f1)continue;\n SetEdgeDirection(f0,j);\n f0->SetS();\n }\n }\n\n static void AddCurvatureConstraints(MeshType & mesh,const ScalarType &thr=0.5)\n {\n for (size_t i=0;ithr)mesh.face[i].SetS();\n }\n\n //hard constraints have selected face\n static void CollectHardConstraints( MeshType & mesh,\n Eigen::VectorXi &HardI,\n Eigen::MatrixXd &HardD,\n SmoothMethod SMethod,\n int Ndir)\n {\n //count number of hard constraints\n int numS=vcg::tri::UpdateSelection::FaceCount(mesh);\n HardI=Eigen::MatrixXi(numS,1);\n if ((Ndir==2)||(SMethod==SMMiq))\n HardD=Eigen::MatrixXd(numS,3);\n else\n HardD=Eigen::MatrixXd(numS,6);\n //then update them\n int curr_index=0;\n for (size_t i=0;i::FaceCount(mesh);\n numS=mesh.fn-numS;\n //allocate eigen matrix\n SoftI=Eigen::MatrixXi(numS,1);\n SoftD=Eigen::MatrixXd(numS,3);\n SoftW=Eigen::MatrixXd(numS,1);\n\n //then update them\n int curr_index=0;\n for (size_t i=0;i::MatrixXm Vf;\n\n MeshToMatrix::GetTriMeshData(mesh,F,Vf);\n Eigen::MatrixXd V = Vf.template cast();\n\n Eigen::MatrixXd output_field;\n Eigen::VectorXd output_sing;\n\n igl::copyleft::comiso::nrosy(V,F,HardI,HardD,SoftI,SoftW,SoftD,Ndir,alpha_soft,output_field,output_sing);\n\n //finally update the principal directions\n for (size_t i=0;i::MatrixXm Vf;\n //Eigen::MatrixXd V;\n\n MeshToMatrix::GetTriMeshData(mesh,F,Vf);\n //then cast\n Eigen::MatrixXd V = Vf.template cast();\n Eigen::MatrixXd output_field;\n //Eigen::VectorXd output_sing;\n\n igl::n_polyvector(V,F,HardI,HardD,output_field);\n\n //finally update the principal directions\n for (size_t i=0;iN();\n dirN.Normalize();\n Dir=CoordType(1,0,0);\n if (fabs(Dir*dirN)>0.9)\n Dir=CoordType(0,1,0);\n if (fabs(Dir*dirN)>0.9)\n Dir=CoordType(0,0,1);\n\n Dir=dirN^Dir;\n Dir.Normalize();\n }\n\n\n static void GloballyOrient(MeshType &mesh)\n {\n vcg::tri::CrossField::MakeDirectionFaceCoherent(mesh,true);\n }\n\n\n\npublic:\n\n struct SmoothParam\n {\n //the 90° rotation independence while smoothing the direction field\n int Ndir;\n //the weight of curvature if doing the smoothing keeping the field close to the original one\n ScalarType alpha_curv;\n //align the field to border or not\n bool align_borders;\n //threshold to consider some edge as sharp feature and to use as hard constraint (0, not use)\n ScalarType sharp_thr;\n //threshold to consider some edge as high curvature anisotropyand to use as hard constraint (0, not use)\n ScalarType curv_thr;\n //the method used to smooth MIQ or \"Designing N-PolyVector Fields with Complex Polynomials\"\n SmoothMethod SmoothM;\n //the number of faces of the ring used ot esteem the curvature\n int curvRing;\n //this are additional hard constraints\n std::vector > AddConstr;\n //the number of iteration in case of iterative method\n size_t IteN;\n\n SmoothParam()\n {\n Ndir=4;\n curvRing=3;\n alpha_curv=0.0;\n align_borders=false;\n SmoothM=SMMiq;\n sharp_thr=0.0;\n curv_thr=0.4;\n IteN=20;\n }\n\n };\n\n static void InitByCurvature(MeshType & mesh,\n unsigned Nring,\n bool UpdateFaces=true)\n {\n\n tri::RequirePerVertexCurvatureDir(mesh);\n\n Eigen::MatrixXi F;\n typename vcg::tri::MeshToMatrix::MatrixXm Vf;\n\n Eigen::MatrixXd PD1,PD2,PV1,PV2;\n MeshToMatrix::GetTriMeshData(mesh,F,Vf);\n Eigen::MatrixXd V = Vf.template cast();\n\n igl::principal_curvature(V,F,PD1,PD2,PV1,PV2,Nring,true);\n\n //then copy curvature per vertex\n for (size_t i=0;i::SetFaceCrossVectorFromVert(mesh);\n InitQualityByAnisotropyDir(mesh);\n }\n\nprivate:\n\n static void SelectConstraints(MeshType &mesh,SmoothParam &SParam)\n {\n //clear all selected faces\n vcg::tri::UpdateFlags::FaceClear(mesh);\n\n //add curvature hard constraints\n //ScalarType Ratio=mesh.bbox.Diag()*0.01;\n\n if (SParam.curv_thr>0)\n AddCurvatureConstraints(mesh,SParam.curv_thr);///Ratio);\n\n //add alignment to sharp features\n if (SParam.sharp_thr>0)\n AddSharpEdgesConstraints(mesh,SParam.sharp_thr);\n\n //add border constraints\n if (SParam.align_borders)\n AddBorderConstraints(mesh);\n\n //aff final constraints\n for (size_t i=0;i0)&&(SMethod==SMMiq))\n CollectSoftConstraints(mesh,SoftI,SoftD,SoftW);\n\n //add some hard constraints if are not present\n int numC=3;\n if ((SoftI.rows()==0)&&(HardI.rows()==0))\n {\n printf(\"Add Forced Constraints \\n\");\n fflush(stdout);\n HardI=Eigen::MatrixXi(numC,1);\n\n if ((Ndir==4)&&(SMethod==SMNPoly))\n HardD=Eigen::MatrixXd(numC,6);\n else\n HardD=Eigen::MatrixXd(numC,3);\n\n for (int i=0;i0)||\n (SParam.sharp_thr>0)||\n (SParam.curv_thr>0))\n {\n InitByCurvature(mesh,SParam.curvRing);\n SelectConstraints(mesh,SParam);\n }\n else\n {\n SelectConstraints(mesh,SParam);\n vcg::tri::CrossField::PropagateFromSelF(mesh);\n }\n SmoothDirectionsIGL(mesh,SParam.Ndir,SParam.SmoothM,true,SParam.alpha_curv);\n }\n else\n {\n std::cout<<\"ITERATIVE\"<0)||(SParam.curv_thr>0))\n SelectConstraints(mesh,SParam);\n\n bool weightByAni=(SParam.alpha_curv>0);\n vcg::tri::CrossField::SmoothIterative(mesh,SParam.Ndir,(int)SParam.IteN,true,false,weightByAni);\n }\n }\n\n};\n\n} // end namespace tri\n} // end namespace vcg\n#endif // QR_FIELD_SMOOTHER_H\n"
},
{
"path": "components/field_computation/fields/n_polyvector.cpp",
"content": "// This file is part of libigl, a simple c++ geometry processing library.\n//\n// Copyright (C) 2014 Olga Diamanti \n//\n// This Source Code Form is subject to the terms of the Mozilla Public License\n// v. 2.0. If a copy of the MPL was not distributed with this file, You can\n// obtain one at http://mozilla.org/MPL/2.0/.\n\n#include \"n_polyvector.h\"\n\n#include \"igl/LinSpaced.h\"\n#include \"igl/edge_topology.h\"\n#include \"igl/local_basis.h\"\n#include \"igl/nchoosek.h\"\n#include \"igl/slice.h\"\n#include \"igl/igl_inline.h\"\n\n#include \"polyroots.h\"\n\n#include \n\n#include \n#include \n#include \n\nnamespace igl {\n template \n class PolyVectorFieldFinder\n {\n private:\n const Eigen::PlainObjectBase &V;\n const Eigen::PlainObjectBase &F; int numF;\n const int n;\n\n Eigen::MatrixXi EV; int numE;\n Eigen::MatrixXi F2E;\n Eigen::MatrixXi E2F;\n Eigen::VectorXd K;\n\n Eigen::VectorXi isBorderEdge;\n int numInteriorEdges;\n Eigen::Matrix E2F_int;\n Eigen::VectorXi indInteriorToFull;\n Eigen::VectorXi indFullToInterior;\n\n DerivedV B1, B2, FN;\n\n IGL_INLINE void computek();\n IGL_INLINE void setFieldFromGeneralCoefficients(const std::vector, Eigen::Dynamic,1> > &coeffs,\n std::vector > &pv);\n IGL_INLINE void computeCoefficientLaplacian(int n, Eigen::SparseMatrix > &D);\n IGL_INLINE void getGeneralCoeffConstraints(const Eigen::VectorXi &isConstrained,\n const Eigen::Matrix &cfW,\n int k,\n Eigen::Matrix, Eigen::Dynamic,1> &Ck);\n IGL_INLINE void precomputeInteriorEdges();\n\n\n IGL_INLINE void minQuadWithKnownMini(const Eigen::SparseMatrix > &Q,\n const Eigen::SparseMatrix > &f,\n const Eigen::VectorXi isConstrained,\n const Eigen::Matrix, Eigen::Dynamic, 1> &xknown,\n Eigen::Matrix, Eigen::Dynamic, 1> &x);\n\n public:\n IGL_INLINE PolyVectorFieldFinder(const Eigen::PlainObjectBase &_V,\n const Eigen::PlainObjectBase &_F,\n const int &_n);\n IGL_INLINE bool solve(const Eigen::VectorXi &isConstrained,\n const Eigen::Matrix &cfW,\n Eigen::Matrix &output);\n\n };\n}\n\ntemplate\nIGL_INLINE igl::PolyVectorFieldFinder::\n PolyVectorFieldFinder(const Eigen::PlainObjectBase &_V,\n const Eigen::PlainObjectBase &_F,\n const int &_n):\nV(_V),\nF(_F),\nnumF(_F.rows()),\nn(_n)\n{\n\n igl::edge_topology(V,F,EV,F2E,E2F);\n numE = EV.rows();\n\n\n precomputeInteriorEdges();\n\n igl::local_basis(V,F,B1,B2,FN);\n\n computek();\n\n};\n\n\ntemplate\nIGL_INLINE void igl::PolyVectorFieldFinder::\nprecomputeInteriorEdges()\n{\n // Flag border edges\n numInteriorEdges = 0;\n isBorderEdge.setZero(numE,1);\n indFullToInterior = -1*Eigen::VectorXi::Ones(numE,1);\n\n for(unsigned i=0; i\nIGL_INLINE void igl::PolyVectorFieldFinder::\nminQuadWithKnownMini(const Eigen::SparseMatrix > &Q,\n const Eigen::SparseMatrix > &f,\n const Eigen::VectorXi isConstrained,\n const Eigen::Matrix, Eigen::Dynamic, 1> &xknown,\n Eigen::Matrix, Eigen::Dynamic, 1> &x)\n{\n int N = Q.rows();\n\n int nc = xknown.rows();\n Eigen::VectorXi known; known.setZero(nc,1);\n Eigen::VectorXi unknown; unknown.setZero(N-nc,1);\n\n int indk = 0, indu = 0;\n for (int i = 0; i > Quu, Quk;\n\n igl::slice(Q,unknown, unknown, Quu);\n igl::slice(Q,unknown, known, Quk);\n\n\n std::vector > > tripletList;\n\n Eigen::SparseMatrix > fu(N-nc,1);\n\n igl::slice(f,unknown, Eigen::VectorXi::Zero(1,1), fu);\n\n Eigen::SparseMatrix > rhs = (Quk*xknown).sparseView()+.5*fu;\n\n Eigen::SparseLU< Eigen::SparseMatrix > > solver;\n solver.compute(-Quu);\n if(solver.info()!=Eigen::Success)\n {\n std::cerr<<\"Decomposition failed!\"< > b = solver.solve(rhs);\n if(solver.info()!=Eigen::Success)\n {\n std::cerr<<\"Solving failed!\"<\nIGL_INLINE bool igl::PolyVectorFieldFinder::\n solve(const Eigen::VectorXi &isConstrained,\n const Eigen::Matrix &cfW,\n Eigen::Matrix &output)\n{\n\n // polynomial is of the form:\n // (-1)^0 z^(2n) +\n // (-1)^1 c[0]z^(2n-2) +\n // (-1)^2 c[1]z^(2n-4) +\n // (-1)^3 c[2]z^(2n-6) +\n // ... +\n // (-1)^n c[n-1]\n\n std::vector, Eigen::Dynamic,1> > coeffs(n,Eigen::Matrix, Eigen::Dynamic,1>::Zero(numF, 1));\n\n for (int i =0; i, Eigen::Dynamic,1> Ck;\n getGeneralCoeffConstraints(isConstrained,\n cfW,\n i,\n Ck);\n\n Eigen::SparseMatrix > DD;\n computeCoefficientLaplacian(degree, DD);\n Eigen::SparseMatrix > f; f.resize(numF,1);\n\n minQuadWithKnownMini(DD, f, isConstrained, Ck, coeffs[i]);\n }\n\n std::vector > pv;\n setFieldFromGeneralCoefficients(coeffs, pv);\n\n output.setZero(numF,3*n);\n for (int fi=0; fi &b1 = B1.row(fi);\n const Eigen::Matrix &b2 = B2.row(fi);\n for (int i=0; i\nIGL_INLINE void igl::PolyVectorFieldFinder::setFieldFromGeneralCoefficients(const std::vector, Eigen::Dynamic,1> > &coeffs,\n std::vector > &pv)\n{\n pv.assign(n, Eigen::Matrix::Zero(numF, 2));\n for (int i = 0; i , Eigen::Dynamic,1> polyCoeff;\n polyCoeff.setZero(2*n+1,1);\n polyCoeff[0] = 1.;\n int sign = 1;\n for (int k =0; k, Eigen::Dynamic,1> roots;\n igl::polyRoots, typename DerivedV::Scalar >(polyCoeff,roots);\n\n Eigen::VectorXi done; done.setZero(2*n,1);\n\n Eigen::Matrix, Eigen::Dynamic,1> u(n,1);\n int ind =0;\n for (int k=0; k<2*n; ++k)\n {\n if (done[k])\n continue;\n u[ind] = roots[k];\n done[k] = 1;\n\n int mini = -1;\n double mind = 1e10;\n for (int l =k+1; l<2*n; ++l)\n {\n double dist = abs(roots[l]+u[ind]);\n if (dist\nIGL_INLINE void igl::PolyVectorFieldFinder::computeCoefficientLaplacian(int n, Eigen::SparseMatrix > &D)\n{\n std::vector > > tripletList;\n\n // For every non-border edge\n for (unsigned eid=0; eid >(fid0,\n fid0,\n std::complex(1.)));\n tripletList.push_back(Eigen::Triplet >(fid1,\n fid1,\n std::complex(1.)));\n tripletList.push_back(Eigen::Triplet >(fid0,\n fid1,\n -1.*std::polar(1.,-1.*n*K[eid])));\n tripletList.push_back(Eigen::Triplet >(fid1,\n fid0,\n -1.*std::polar(1.,1.*n*K[eid])));\n\n }\n }\n D.resize(numF,numF);\n D.setFromTriplets(tripletList.begin(), tripletList.end());\n\n\n}\n\ntemplate\nIGL_INLINE void igl::PolyVectorFieldFinder::getGeneralCoeffConstraints(const Eigen::VectorXi &isConstrained,\n const Eigen::Matrix &cfW,\n int k,\n Eigen::Matrix, Eigen::Dynamic,1> &Ck)\n{\n int numConstrained = isConstrained.sum();\n Ck.resize(numConstrained,1);\n int n = cfW.cols()/3;\n\n Eigen::MatrixXi allCombs;\n {\n Eigen::VectorXi V = igl::LinSpaced(n,0,n-1);\n igl::nchoosek(V,k+1,allCombs);\n }\n\n\n int ind = 0;\n for (int fi = 0; fi &b1 = B1.row(fi);\n const Eigen::Matrix &b2 = B2.row(fi);\n if(isConstrained[fi])\n {\n std::complex ck(0);\n\n for (int j = 0; j < allCombs.rows(); ++j)\n {\n std::complex tk(1.);\n //collect products\n for (int i = 0; i < allCombs.cols(); ++i)\n {\n int index = allCombs(j,i);\n\n const Eigen::Matrix &w = cfW.block(fi,3*index,1,3);\n typename DerivedV::Scalar w0 = w.dot(b1);\n typename DerivedV::Scalar w1 = w.dot(b2);\n std::complex u(w0,w1);\n tk*= u*u;\n }\n //collect sum\n ck += tk;\n }\n Ck(ind) = ck;\n ind ++;\n }\n }\n\n\n}\n\ntemplate\nIGL_INLINE void igl::PolyVectorFieldFinder::computek()\n{\n K.setZero(numE);\n // For every non-border edge\n for (unsigned eid=0; eid N0 = FN.row(fid0);\n Eigen::Matrix N1 = FN.row(fid1);\n\n // find common edge on triangle 0 and 1\n int fid0_vc = -1;\n int fid1_vc = -1;\n for (unsigned i=0;i<3;++i)\n {\n if (F2E(fid0,i) == eid)\n fid0_vc = i;\n if (F2E(fid1,i) == eid)\n fid1_vc = i;\n }\n assert(fid0_vc != -1);\n assert(fid1_vc != -1);\n\n Eigen::Matrix common_edge = V.row(F(fid0,(fid0_vc+1)%3)) - V.row(F(fid0,fid0_vc));\n common_edge.normalize();\n\n // Map the two triangles in a new space where the common edge is the x axis and the N0 the z axis\n Eigen::Matrix P;\n Eigen::Matrix o = V.row(F(fid0,fid0_vc));\n Eigen::Matrix tmp = -N0.cross(common_edge);\n P << common_edge, tmp, N0;\n// P.transposeInPlace();\n\n\n Eigen::Matrix V0;\n V0.row(0) = V.row(F(fid0,0)) -o;\n V0.row(1) = V.row(F(fid0,1)) -o;\n V0.row(2) = V.row(F(fid0,2)) -o;\n\n V0 = (P*V0.transpose()).transpose();\n\n// assert(V0(0,2) < 1e-10);\n// assert(V0(1,2) < 1e-10);\n// assert(V0(2,2) < 1e-10);\n\n Eigen::Matrix V1;\n V1.row(0) = V.row(F(fid1,0)) -o;\n V1.row(1) = V.row(F(fid1,1)) -o;\n V1.row(2) = V.row(F(fid1,2)) -o;\n V1 = (P*V1.transpose()).transpose();\n\n// assert(V1(fid1_vc,2) < 10e-10);\n// assert(V1((fid1_vc+1)%3,2) < 10e-10);\n\n // compute rotation R such that R * N1 = N0\n // i.e. map both triangles to the same plane\n double alpha = -atan2(V1((fid1_vc+2)%3,2),V1((fid1_vc+2)%3,1));\n\n Eigen::Matrix R;\n R << 1, 0, 0,\n 0, cos(alpha), -sin(alpha) ,\n 0, sin(alpha), cos(alpha);\n V1 = (R*V1.transpose()).transpose();\n\n// assert(V1(0,2) < 1e-10);\n// assert(V1(1,2) < 1e-10);\n// assert(V1(2,2) < 1e-10);\n\n // measure the angle between the reference frames\n // k_ij is the angle between the triangle on the left and the one on the right\n Eigen::Matrix ref0 = V0.row(1) - V0.row(0);\n Eigen::Matrix ref1 = V1.row(1) - V1.row(0);\n\n ref0.normalize();\n ref1.normalize();\n\n double ktemp = atan2(ref1(1),ref1(0)) - atan2(ref0(1),ref0(0));\n\n // just to be sure, rotate ref0 using angle ktemp...\n Eigen::Matrix R2;\n R2 << cos(ktemp), -sin(ktemp), sin(ktemp), cos(ktemp);\n\n Eigen::Matrix tmp1 = R2*(ref0.head(2)).transpose();\n\n// assert(tmp1(0) - ref1(0) < 1e-10);\n// assert(tmp1(1) - ref1(1) < 1e-10);\n\n K[eid] = ktemp;\n }\n }\n\n}\n\n\nIGL_INLINE void igl::n_polyvector(const Eigen::MatrixXd &V,\n const Eigen::MatrixXi &F,\n const Eigen::VectorXi& b,\n const Eigen::MatrixXd& bc,\n Eigen::MatrixXd &output)\n{\n Eigen::VectorXi isConstrained = Eigen::VectorXi::Constant(F.rows(),0);\n Eigen::MatrixXd cfW = Eigen::MatrixXd::Constant(F.rows(),bc.cols(),0);\n\n for(unsigned i=0; i pvff(V,F,n);\n pvff.solve(isConstrained, cfW, output);\n}\n\n\n#ifdef IGL_STATIC_LIBRARY\n// Explicit template instantiation\n#endif\n"
},
{
"path": "components/field_computation/fields/n_polyvector.h",
"content": "// This file is part of libigl, a simple c++ geometry processing library.\n//\n// Copyright (C) 2014 Olga Diamanti \n//\n// This Source Code Form is subject to the terms of the Mozilla Public License\n// v. 2.0. If a copy of the MPL was not distributed with this file, You can\n// obtain one at http://mozilla.org/MPL/2.0/.\n\n#ifndef IGL_N_POLYVECTOR\n#define IGL_N_POLYVECTOR\n#include \"igl/igl_inline.h\"\n\n#include \n#include \n\nnamespace igl {\n //todo\n /// Given 2 vectors centered on origin calculate the rotation matrix from first to the second\n\n // Inputs:\n // v0, v1 the two #3 by 1 vectors\n // normalized boolean, if false, then the vectors are normalized prior to the calculation\n // Output:\n // 3 by 3 rotation matrix that takes v0 to v1\n //\n\n IGL_INLINE void n_polyvector(const Eigen::MatrixXd& V,\n const Eigen::MatrixXi& F,\n const Eigen::VectorXi& b,\n const Eigen::MatrixXd& bc,\n Eigen::MatrixXd &output);\n\n};\n\n\n#ifndef IGL_STATIC_LIBRARY\n#include \"n_polyvector.cpp\"\n#endif\n\n\n#endif /* defined(IGL_N_POLYVECTOR) */\n"
},
{
"path": "components/field_computation/fields/polyroots.cpp",
"content": "// This file is part of libigl, a simple c++ geometry processing library.\n//\n// Copyright (C) 2014 Olga Diamanti \n//\n// This Source Code Form is subject to the terms of the Mozilla Public License\n// v. 2.0. If a copy of the MPL was not distributed with this file, You can\n// obtain one at http://mozilla.org/MPL/2.0/.\n\n#include \"polyroots.h\"\n#include \n\ntemplate \nIGL_INLINE void igl::polyRoots(Eigen::Matrix &polyCoeff, //real or comples coefficients\n Eigen::Matrix, Eigen::Dynamic,1> &roots // complex roots (double or float)\n)\n{\n // degree\n int n = polyCoeff.rows() - 1;\n\n Eigen::Matrix d (n,1);\n d = polyCoeff.tail(n)/polyCoeff(0);\n\n Eigen::Matrix I; I.setIdentity(n-1,n-1);\n Eigen::Matrix z; z.setZero(n-1,1);\n\n Eigen::Matrix a(n,n);\n a<<-d.transpose(),I,z;\n roots = a.eigenvalues();\n\n}\n\n\n\n#ifdef IGL_STATIC_LIBRARY\n// Explicit template instantiation\ntemplate void igl::polyRoots, double>(Eigen::Matrix, -1, 1, 0, -1, 1>&, Eigen::Matrix, -1, 1, 0, -1, 1>&);\ntemplate void igl::polyRoots(Eigen::Matrix&, Eigen::Matrix, -1, 1, 0, -1, 1>&);\n#endif\n"
},
{
"path": "components/field_computation/fields/polyroots.h",
"content": "// This file is part of libigl, a simple c++ geometry processing library.\n//\n// Copyright (C) 2014 Olga Diamanti \n//\n// This Source Code Form is subject to the terms of the Mozilla Public License\n// v. 2.0. If a copy of the MPL was not distributed with this file, You can\n// obtain one at http://mozilla.org/MPL/2.0/.\n\n#ifndef IGL_POLYROOTS\n#define IGL_POLYROOTS\n#include \"igl/igl_inline.h\"\n\n#include \n\nnamespace igl {\n //todo\n /// Given 2 vectors centered on origin calculate the rotation matrix from first to the second\n\n // Inputs:\n // v0, v1 the two #3 by 1 vectors\n // normalized boolean, if false, then the vectors are normalized prior to the calculation\n // Output:\n // 3 by 3 rotation matrix that takes v0 to v1\n //\n template \n IGL_INLINE void polyRoots(Eigen::Matrix &polyCoeff, //real or comples coefficients\n Eigen::Matrix, Eigen::Dynamic,1> &roots // complex roots (double or float)\n );\n}\n\n\n#ifndef IGL_STATIC_LIBRARY\n#include \"polyroots.cpp\"\n#endif\n\n\n#endif /* defined(IGL_NCHOOSEK) */\n"
},
{
"path": "components/field_computation/gl_utils.h",
"content": "/***************************************************************************/\n/* Copyright(C) 2021\n\n\nThe authors of\n\nReliable Feature-Line Driven Quad-Remeshing\nSiggraph 2021\n\n\n All rights reserved.\nThis program is free software: you can redistribute it and/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program. If not, see .\n****************************************************************************/\n\n#ifndef GL_UTILS\n#define GL_UTILS\n\n\n#include \n\ntemplate \nvoid GLDrawSharpEdges(MeshType &mesh)\n{\n typedef typename MeshType::CoordType CoordType;\n\n glPushAttrib(GL_ALL_ATTRIB_BITS);\n glDisable(GL_LIGHTING);\n glDepthRange(0,0.9999);\n glLineWidth(5);\n glBegin(GL_LINES);\n for (size_t i=0;i.\n****************************************************************************/\n\n#include \n#include