This is an automated email from the git hooks/post-receive script.
sebastic-guest pushed a commit to branch master
in repository prepair.
commit 2dab6bfcb6b6382dfffaaf61fa944c1cbdd18d71
Author: Bas Couwenberg <sebas...@xs4all.nl>
Date: Sat Nov 22 14:54:18 2014 +0100
Imported Upstream version 0.7
---
.gitignore | 20 +
CMakeLists.txt | 78 ++++
LICENSE.txt | 674 +++++++++++++++++++++++++++++++
PolygonRepair.cpp | 922 +++++++++++++++++++++++++++++++++++++++++++
PolygonRepair.h | 50 +++
README.md | 96 +++++
TriangleInfo.cpp | 66 ++++
TriangleInfo.h | 45 +++
data/CLC2006_180927.geojson | 8 +
data/CLC2006_2018418.geojson | 8 +
definitions.h | 84 ++++
icon.png | Bin 0 -> 16222 bytes
prepair.cpp | 214 ++++++++++
13 files changed, 2265 insertions(+)
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..d2f48d0
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,20 @@
+# Metadata
+.DS_Store
+
+# Subversion
+.svn
+
+# OS specific Makefile
+Makefile
+
+# Compiled sources
+*.o
+prepair
+
+# xcode project
+*.xcodeproj
+
+CMakeFiles
+cmake_install.cmake
+CMakeCache.txt
+libprepair.dylib
diff --git a/CMakeLists.txt b/CMakeLists.txt
new file mode 100644
index 0000000..730e8d6
--- /dev/null
+++ b/CMakeLists.txt
@@ -0,0 +1,78 @@
+# Copyright (c) 2009-2013,
+# Ken Arroyo Ohori g.a.k.arroyooh...@tudelft.nl
+# Hugo Ledoux h.led...@tudelft.nl
+# Martijn Meijers b.m.meij...@tudelft.nl
+# All rights reserved.
+#
+# This file is part of prepair: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# Licensees holding a valid commercial license may use this file in
+# accordance with the commercial license agreement provided with
+# the software.
+#
+# This file is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+#
+
+project( prepair )
+
+cmake_minimum_required(VERSION 2.6.2)
+if("${CMAKE_MAJOR_VERSION}.${CMAKE_MINOR_VERSION}" VERSION_GREATER 2.6)
+ if("${CMAKE_MAJOR_VERSION}.${CMAKE_MINOR_VERSION}.${CMAKE_PATCH_VERSION}"
VERSION_GREATER 2.8.3)
+ cmake_policy(VERSION 2.8.4)
+ else()
+ cmake_policy(VERSION 2.6)
+ endif()
+endif()
+
+set( CMAKE_ALLOW_LOOSE_LOOP_CONSTRUCTS true )
+
+if ( COMMAND cmake_policy )
+ cmake_policy( SET CMP0003 NEW )
+endif()
+
+# CGAL
+find_package( CGAL QUIET COMPONENTS )
+
+if ( NOT CGAL_FOUND )
+ message(SEND_ERROR "prepair requires the CGAL library")
+ return()
+endif()
+
+# include helper file
+include( ${CGAL_USE_FILE} )
+
+# Boost
+find_package( Boost REQUIRED )
+
+if ( NOT Boost_FOUND )
+ message(SEND_ERROR "prepair requires the Boost library")
+ return()
+endif()
+
+# GDAL
+find_package( GDAL )
+
+if ( NOT GDAL_FOUND )
+ message(SEND_ERROR "prepair requires the GDAL library")
+endif()
+
+include_directories( ${GDAL_INCLUDE_DIR} )
+
+# Creating entries for target: prepair
+# ############################
+
+if ( AS_LIBRARY )
+ add_library( prepair SHARED TriangleInfo.cpp PolygonRepair.cpp )
+else()
+ add_executable( prepair TriangleInfo.cpp PolygonRepair.cpp prepair.cpp )
+endif()
+
+add_to_cached_list( CGAL_EXECUTABLE_TARGETS prepair )
+
+# Link to CGAL and third-party libraries
+target_link_libraries(prepair ${CGAL_LIBRARIES} ${CGAL_3RD_PARTY_LIBRARIES}
${GDAL_LIBRARY})
\ No newline at end of file
diff --git a/LICENSE.txt b/LICENSE.txt
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/LICENSE.txt
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/PolygonRepair.cpp b/PolygonRepair.cpp
new file mode 100644
index 0000000..4aa948a
--- /dev/null
+++ b/PolygonRepair.cpp
@@ -0,0 +1,922 @@
+/*
+ Copyright (c) 2009-2013,
+ Ken Arroyo Ohori g.a.k.arroyooh...@tudelft.nl
+ Hugo Ledoux h.led...@tudelft.nl
+ Martijn Meijers b.m.meij...@tudelft.nl
+ All rights reserved.
+
+ // This file is part of prepair: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ Licensees holding a valid commercial license may use this file in
+ accordance with the commercial license agreement provided with
+ the software.
+
+ This file is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+#include "PolygonRepair.h"
+
+OGRMultiPolygon *PolygonRepair::repairOddEven(OGRGeometry *geometry, bool
timeResults) {
+ triangulation.clear();
+ time_t thisTime, totalTime;
+ thisTime = time(NULL);
+ insertConstraints(triangulation, geometry);
+ totalTime = time(NULL)-thisTime;
+ if (timeResults) std::cout << "Triangulation: " << totalTime/60 << " minutes
" << totalTime%60 << " seconds." << std::endl;
+ thisTime = time(NULL);
+ tagOddEven(triangulation);
+ totalTime = time(NULL)-thisTime;
+ if (timeResults) std::cout << "Tagging: " << totalTime/60 << " minutes " <<
totalTime%60 << " seconds." << std::endl;
+ thisTime = time(NULL);
+ OGRMultiPolygon *outPolygons = reconstruct(triangulation);
+ totalTime = time(NULL)-thisTime;
+ if (timeResults) std::cout << "Reconstruction: " << totalTime/60 << "
minutes " << totalTime%60 << " seconds." << std::endl;
+ return outPolygons;
+}
+
+OGRMultiPolygon *PolygonRepair::repairPointSet(OGRGeometry *geometry, bool
timeResults) {
+ triangulation.clear();
+ std::list<std::pair<bool, OGRMultiPolygon *> > repairedRings; // bool
indicates if outer/inner are flipped
+
+ time_t thisTime, totalTime;
+ thisTime = time(NULL);
+ switch (geometry->getGeometryType()) {
+
+ case wkbLineString: {
+ repairedRings.push_back(std::pair<bool, OGRMultiPolygon *>(false,
repairOddEven(geometry)));
+ break;
+ }
+
+ case wkbPolygon: {
+ OGRPolygon *polygon = static_cast<OGRPolygon *>(geometry);
+ if (polygon->getExteriorRing() != NULL) {
+ repairedRings.push_back(std::pair<bool, OGRMultiPolygon *>(false,
repairOddEven(polygon->getExteriorRing())));
+ } for (int currentRing = 0; currentRing <
polygon->getNumInteriorRings(); ++currentRing) {
+ repairedRings.push_back(std::pair<bool, OGRMultiPolygon *>(true,
repairOddEven(polygon->getInteriorRing(currentRing))));
+ } break;
+ }
+
+ case wkbMultiPolygon: {
+ OGRMultiPolygon *multipolygon = static_cast<OGRMultiPolygon *>(geometry);
+ for (int currentPolygon = 0; currentPolygon <
multipolygon->getNumGeometries(); ++currentPolygon) {
+ OGRPolygon *polygon = static_cast<OGRPolygon
*>(multipolygon->getGeometryRef(currentPolygon));
+ if (polygon->getExteriorRing() != NULL) {
+ repairedRings.push_back(std::pair<bool, OGRMultiPolygon *>(false,
repairOddEven(polygon->getExteriorRing())));
+ } for (int currentRing = 0; currentRing <
polygon->getNumInteriorRings(); ++currentRing) {
+ repairedRings.push_back(std::pair<bool, OGRMultiPolygon *>(true,
repairOddEven(polygon->getInteriorRing(currentRing))));
+ }
+ } break;
+ }
+
+ default:
+ std::cerr << "PolygonRepair::repairPointSet: Cannot understand input."
<< std::endl;
+ return new OGRMultiPolygon();
+ break;
+ } totalTime = time(NULL)-thisTime;
+ if (timeResults) std::cout << "Repairing individual rings: " << totalTime/60
<< " minutes " << totalTime%60 << " seconds." << std::endl;
+
+ thisTime = time(NULL);
+ for (std::list<std::pair<bool, OGRMultiPolygon *> >::iterator
currentMultipolygon = repairedRings.begin();
+ currentMultipolygon != repairedRings.end(); ++currentMultipolygon)
+ insertConstraints(triangulation, currentMultipolygon->second, false);
+ totalTime = time(NULL)-thisTime;
+ if (timeResults) std::cout << "Triangulation: " << totalTime/60 << " minutes
" << totalTime%60 << " seconds." << std::endl;
+ thisTime = time(NULL);
+ tagPointSet(triangulation, repairedRings);
+ totalTime = time(NULL)-thisTime;
+ if (timeResults) std::cout << "Tagging: " << totalTime/60 << " minutes " <<
totalTime%60 << " seconds." << std::endl;
+ thisTime = time(NULL);
+ OGRMultiPolygon *outPolygons = reconstruct(triangulation);
+ totalTime = time(NULL)-thisTime;
+ if (timeResults) std::cout << "Reconstruction: " << totalTime/60 << "
minutes " << totalTime%60 << " seconds." << std::endl;
+ return outPolygons;
+}
+
+void PolygonRepair::removeSmallPolygons(OGRMultiPolygon *outPolygons, double
minArea) {
+ //std::cout << "Removing polygons smaller than " << minArea << " unit^2." <<
std::endl;
+ for (int currentPolygon = outPolygons->getNumGeometries()-1; currentPolygon
>= 0; --currentPolygon) {
+ if (static_cast<OGRPolygon
*>(outPolygons->getGeometryRef(currentPolygon))->get_Area() < minArea) {
+ outPolygons->removeGeometry(currentPolygon);
+ }
+ }
+}
+
+OGRMultiPolygon *PolygonRepair::isr(OGRGeometry *geometry, double tolerance) {
+
+ // Convert to multipolygon
+ OGRMultiPolygon *multipolygon = new OGRMultiPolygon();
+ switch (geometry->getGeometryType()) {
+ case wkbLineString: {
+ OGRLineString *oldRing = static_cast<OGRLineString *>(geometry);
+ OGRPolygon *polygon = new OGRPolygon();
+ OGRLinearRing *ring = new OGRLinearRing();
+ OGRPoint lastPoint, point;
+ for (int currentPoint = 0; currentPoint < oldRing->getNumPoints();
++currentPoint) {
+ oldRing->getPoint(currentPoint, &point);
+ if (currentPoint > 0) {
+ if (!point.Equals(&lastPoint)) ring->addPoint(&point);
+ } lastPoint = point;
+ } polygon->addRingDirectly(ring);
+ multipolygon->addGeometryDirectly(polygon);
+ break;
+ }
+
+ case wkbPolygon: {
+ OGRPolygon *oldPolygon = static_cast<OGRPolygon *>(geometry);
+ OGRPolygon *polygon = new OGRPolygon();
+ OGRLinearRing *oldRing = oldPolygon->getExteriorRing();
+ OGRLinearRing *ring = new OGRLinearRing();
+ OGRPoint lastPoint, point;
+ for (int currentPoint = 0; currentPoint < oldRing->getNumPoints();
++currentPoint) {
+ oldRing->getPoint(currentPoint, &point);
+ if (currentPoint > 0) {
+ if (!point.Equals(&lastPoint)) ring->addPoint(&point);
+ } lastPoint = point;
+ } polygon->addRingDirectly(ring);
+ for (int currentRing = 0; currentRing <
oldPolygon->getNumInteriorRings(); ++currentRing) {
+ oldRing = oldPolygon->getInteriorRing(currentRing);
+ ring = new OGRLinearRing();
+ for (int currentPoint = 0; currentPoint < oldRing->getNumPoints();
++currentPoint) {
+ oldRing->getPoint(currentPoint, &point);
+ if (currentPoint > 0) {
+ if (!point.Equals(&lastPoint)) ring->addPoint(&point);
+ } lastPoint = point;
+ } polygon->addRingDirectly(ring);
+ } multipolygon->addGeometryDirectly(polygon);
+ break;
+ }
+
+ case wkbMultiPolygon: {
+ OGRMultiPolygon *oldMultipolygon = static_cast<OGRMultiPolygon
*>(geometry);
+ OGRPolygon *oldPolygon, *polygon;
+ OGRLinearRing *oldRing, *ring;
+ OGRPoint lastPoint, point;
+ for (int currentPolygon = 0; currentPolygon <
oldMultipolygon->getNumGeometries(); ++currentPolygon) {
+ oldPolygon = static_cast<OGRPolygon
*>(oldMultipolygon->getGeometryRef(currentPolygon));
+ polygon = new OGRPolygon();
+ oldRing = oldPolygon->getExteriorRing();
+ ring = new OGRLinearRing();
+ for (int currentPoint = 0; currentPoint < oldRing->getNumPoints();
++currentPoint) {
+ oldRing->getPoint(currentPoint, &point);
+ if (currentPoint > 0) {
+ if (!point.Equals(&lastPoint)) ring->addPoint(&point);
+ } lastPoint = point;
+ } polygon->addRingDirectly(ring);
+ for (int currentRing = 0; currentRing <
oldPolygon->getNumInteriorRings(); ++currentRing) {
+ oldRing = oldPolygon->getInteriorRing(currentRing);
+ ring = new OGRLinearRing();
+ for (int currentPoint = 0; currentPoint < oldRing->getNumPoints();
++currentPoint) {
+ oldRing->getPoint(currentPoint, &point);
+ if (currentPoint > 0) {
+ if (!point.Equals(&lastPoint)) ring->addPoint(&point);
+ } lastPoint = point;
+ } polygon->addRingDirectly(ring);
+ } multipolygon->addGeometryDirectly(polygon);
+ } break;
+ }
+
+ default:
+ std::cerr << "PolygonRepair::isr: Cannot understand input." << std::endl;
+ return new OGRMultiPolygon();
+ break;
+ } multipolygon->closeRings();
+
+ // Put all line segments in a list (in order)
+ // TODO: Only do point location once for segment.
+ std::list<Segment> inputSegments;
+ for (int currentPolygon = 0; currentPolygon <
multipolygon->getNumGeometries(); ++currentPolygon) {
+ OGRPolygon *polygon = static_cast<OGRPolygon
*>(multipolygon->getGeometryRef(currentPolygon));
+ for (int currentPoint = 1; currentPoint <
polygon->getExteriorRing()->getNumPoints(); ++currentPoint) {
+ Segment
thisSegment(Point(polygon->getExteriorRing()->getX(currentPoint-1),
polygon->getExteriorRing()->getY(currentPoint-1)),
+
Point(polygon->getExteriorRing()->getX(currentPoint),
polygon->getExteriorRing()->getY(currentPoint)));
+ if (thisSegment.is_degenerate()) {
+ std::cout << "This should not happen!!!" << std::endl;
+ return new OGRMultiPolygon();
+ } inputSegments.push_back(thisSegment);
+ } for (int currentRing = 0; currentRing < polygon->getNumInteriorRings();
++currentRing) {
+ for (int currentPoint = 1; currentPoint <
polygon->getInteriorRing(currentRing)->getNumPoints(); ++currentPoint) {
+ Segment
thisSegment(Point(polygon->getExteriorRing()->getX(currentPoint-1),
polygon->getExteriorRing()->getY(currentPoint-1)),
+
Point(polygon->getExteriorRing()->getX(currentPoint),
polygon->getExteriorRing()->getY(currentPoint)));
+ if (thisSegment.is_degenerate()) {
+ std::cout << "This should not happen!!!" << std::endl;
+ return new OGRMultiPolygon();
+ } std::cout << thisSegment << std::endl;
+ inputSegments.push_back(thisSegment);
+ }
+ }
+ }
+
+ // Snap
+ std::list<std::list<Point> > outputPolylines;
+ CGAL::snap_rounding_2<SRT, std::list<Segment>::const_iterator,
std::list<std::list<Point> > >(inputSegments.begin(), inputSegments.end(),
outputPolylines, tolerance, true, false, 2);
+
+ // Put it back into an OGRMultiPolygon
+ OGRMultiPolygon *snappedMultipolygon = new OGRMultiPolygon();
+ std::list<std::list<Point> >::iterator currentPolyline =
outputPolylines.begin();
+ for (int currentPolygon = 0; currentPolygon <
multipolygon->getNumGeometries(); ++currentPolygon) {
+ OGRPolygon *polygon = static_cast<OGRPolygon
*>(multipolygon->getGeometryRef(currentPolygon));
+ OGRPolygon *snappedPolygon = new OGRPolygon();
+ OGRLinearRing *snappedOuterRing = new OGRLinearRing();
+ for (int currentPoint = 1; currentPoint <
polygon->getExteriorRing()->getNumPoints(); ++currentPoint) {
+ std::list<Point>::iterator point = currentPolyline->begin();
+ ++point;
+ while (point != currentPolyline->end()) {
+ snappedOuterRing->addPoint(CGAL::to_double(point->x()),
CGAL::to_double(point->y()));
+ ++point;
+ } ++currentPolyline;
+ } snappedPolygon->addRingDirectly(snappedOuterRing);
+ for (int currentRing = 0; currentRing < polygon->getNumInteriorRings();
++currentRing) {
+ OGRLinearRing *snappedInnerRing = new OGRLinearRing();
+ for (int currentPoint = 1; currentPoint <
polygon->getInteriorRing(currentRing)->getNumPoints(); ++currentPoint) {
+ std::list<Point>::iterator point = currentPolyline->begin();
+ ++point;
+ while (point != currentPolyline->end()) {
+ snappedOuterRing->addPoint(CGAL::to_double(point->x()),
CGAL::to_double(point->y()));
+ ++point;
+ } ++currentPolyline;
+ } snappedPolygon->addRingDirectly(snappedInnerRing);
+ }
snappedMultipolygon->OGRGeometryCollection::addGeometryDirectly(snappedPolygon);
+ }
+
+ return snappedMultipolygon;
+}
+
+double PolygonRepair::computeRobustness(OGRGeometry *geometry) {
+ double smallestdist = 1e99;
+
+ if (geometry != NULL) insertConstraints(triangulation, geometry);
+
+ //-- vertex-vertex distances
+ Vector dist;
+ for (Triangulation::Finite_vertices_iterator curV =
triangulation.finite_vertices_begin(); curV !=
triangulation.finite_vertices_end(); curV++) {
+ // std::cout << "---" << curV->point() << "---" << std::endl;
+ Triangulation::Vertex_circulator vc =
triangulation.incident_vertices(curV);
+ Triangulation::Vertex_handle startv = vc;
+ vc++;
+ while (vc != startv) {
+ if (triangulation.is_infinite(vc) == false) {
+ // std::cout << vc->point() << std::endl;
+ dist = curV->point() - vc->point();
+ // std::cout << "distance: " << dist.squared_length() << std::endl;
+ if (dist.squared_length() < smallestdist)
+ smallestdist = CGAL::to_double(dist.squared_length());
+ }
+ vc++;
+ }
+ dist = curV->point() - startv->point();
+ if (dist.squared_length() < smallestdist)
+ smallestdist = CGAL::to_double(dist.squared_length());
+ }
+
+ //-- vertex-edge distances
+ for (Triangulation::Finite_vertices_iterator curV =
triangulation.finite_vertices_begin(); curV !=
triangulation.finite_vertices_end(); curV++) {
+ // std::cout << "---" << curV->point() << "---" << std::endl;
+ Triangulation::Face_circulator fc = triangulation.incident_faces(curV);
+ Triangulation::Face_handle startf = fc;
+ fc++;
+ while (fc != startf) {
+ if (triangulation.is_infinite(fc) == false) {
+ int i = fc->index(curV);
+ if (fc->is_constrained(i)) {
+ double d =
CGAL::to_double(squared_distance(triangulation.segment(fc, i),
fc->vertex(i)->point()));
+ if (d < smallestdist)
+ smallestdist = d;
+ }
+ }
+ fc++;
+ }
+ if (triangulation.is_infinite(startf) == false) {
+ int i = startf->index(curV);
+ if (startf->is_constrained(i)) {
+ double d =
CGAL::to_double(squared_distance(triangulation.segment(startf, i),
startf->vertex(i)->point()));
+ if (d < smallestdist)
+ smallestdist = d;
+ }
+ }
+ }
+ if (geometry != NULL) triangulation.clear();
+ return smallestdist;
+}
+
+bool PolygonRepair::saveToShp(OGRGeometry* geometry, const char *fileName) {
+ const char *driverName = "ESRI Shapefile";
+ OGRRegisterAll();
+ OGRSFDriver *driver =
OGRSFDriverRegistrar::GetRegistrar()->GetDriverByName(driverName);
+ if (driver == NULL) {
+ std::cout << "\tError: OGR Shapefile driver not found." <<
std::endl;
+ return false;
+ }
+ OGRDataSource *dataSource = driver->Open(fileName, false);
+ if (dataSource != NULL) {
+ std::cout << "\tOverwriting file..." << std::endl;
+ if (driver->DeleteDataSource(dataSource->GetName())!=
OGRERR_NONE) {
+ std::cout << "\tError: Couldn't erase file with same
name." << std::endl;
+ return false;
+ } OGRDataSource::DestroyDataSource(dataSource);
+ }
+ std::cout << "\tCreating " << fileName << std::endl;
+ dataSource = driver->CreateDataSource(fileName, NULL);
+ if (dataSource == NULL) {
+ std::cout << "\tError: Could not create file." << std::endl;
+ return false;
+ }
+ OGRLayer *layer = dataSource->CreateLayer("polygons", NULL, wkbPolygon,
NULL);
+ if (layer == NULL) {
+ std::cout << "\tError: Could not create layer." << std::endl;
+ return false;
+ }
+ OGRFeature *feature = OGRFeature::CreateFeature(layer->GetLayerDefn());
+ // feature->SetField("Name", szName);
+ feature->SetGeometry(geometry);
+ if (layer->CreateFeature(feature) != OGRERR_NONE) {
+ std::cout << "\tError: Could not create feature." << std::endl;
+ }
+ OGRFeature::DestroyFeature(feature);
+ OGRDataSource::DestroyDataSource(dataSource);
+ return true;
+}
+
+void PolygonRepair::insertConstraints(Triangulation &triangulation,
OGRGeometry* geometry, bool removeOverlappingConstraints) {
+ Triangulation::Vertex_handle va, vb;
+ Triangulation::Face_handle faceOfEdge;
+ int indexOfEdge;
+
+ switch (geometry->getGeometryType()) {
+
+ case wkbLineString: {
+ OGRLinearRing *ring = static_cast<OGRLinearRing *>(geometry);
+ ring->closeRings();
+
+ vb = triangulation.insert(Point(ring->getX(0), ring->getY(0)));
+ for (int currentPoint = 1; currentPoint < ring->getNumPoints();
++currentPoint) {
+ va = vb;
+ vb = triangulation.insert(Point(ring->getX(currentPoint),
+ ring->getY(currentPoint)),
+ triangulation.incident_faces(va));
+ if (removeOverlappingConstraints && triangulation.is_edge(va, vb,
faceOfEdge, indexOfEdge)) {
+ if
(triangulation.is_constrained(std::pair<Triangulation::Face_handle,
int>(faceOfEdge, indexOfEdge))) {
+ triangulation.insert_constraint(va, vb); // trick to remove a
partially overlapping constraint
+ triangulation.remove_constraint(va, vb);
+ } else triangulation.insert_constraint(va, vb);
+ } else triangulation.insert_constraint(va, vb);
+ } break;
+ }
+
+ case wkbPolygon: {
+ OGRPolygon *polygon = static_cast<OGRPolygon *>(geometry);
+
+ // Outer
+ vb = triangulation.insert(Point(polygon->getExteriorRing()->getX(0),
polygon->getExteriorRing()->getY(0)));
+ for (int currentPoint = 1; currentPoint <
polygon->getExteriorRing()->getNumPoints(); ++currentPoint) {
+ va = vb;
+ vb =
triangulation.insert(Point(polygon->getExteriorRing()->getX(currentPoint),
+
polygon->getExteriorRing()->getY(currentPoint)),
+ triangulation.incident_faces(va));
+ if (removeOverlappingConstraints && triangulation.is_edge(va, vb,
faceOfEdge, indexOfEdge)) {
+ if
(triangulation.is_constrained(std::pair<Triangulation::Face_handle,
int>(faceOfEdge, indexOfEdge))) {
+ triangulation.insert_constraint(va, vb);
+ triangulation.remove_constraint(va, vb);
+ //std::cout << "Removing constraint <" << va->point() << ", " <<
vb->point() << ">" << std::endl;
+ } else {
+ triangulation.insert_constraint(va, vb);
+ //std::cout << "Inserting constraint <" << va->point() << ", " <<
vb->point() << ">" << std::endl;
+ }
+ } else {
+ triangulation.insert_constraint(va, vb);
+ //std::cout << "Inserting constraint <" << va->point() << ", " <<
vb->point() << ">" << std::endl;
+ }
+ }
+
+ // Inner
+ for (int currentRing = 0; currentRing < polygon->getNumInteriorRings();
++currentRing) {
+ vb =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX(0),
+
polygon->getInteriorRing(currentRing)->getY(0)));
+ for (int currentPoint = 1; currentPoint <
polygon->getInteriorRing(currentRing)->getNumPoints(); ++currentPoint) {
+ va = vb;
+ vb =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX(currentPoint),
+
polygon->getInteriorRing(currentRing)->getY(currentPoint)),
+ triangulation.incident_faces(va));
+ if (removeOverlappingConstraints && triangulation.is_edge(va, vb,
faceOfEdge, indexOfEdge)) {
+ if
(triangulation.is_constrained(std::pair<Triangulation::Face_handle,
int>(faceOfEdge, indexOfEdge))) {
+ triangulation.insert_constraint(va, vb);
+ triangulation.remove_constraint(va, vb);
+ //std::cout << "Removing constraint <" << va->point() << ", " <<
vb->point() << ">" << std::endl;
+ } else {
+ triangulation.insert_constraint(va, vb);
+ //std::cout << "Inserting constraint <" << va->point() << ", "
<< vb->point() << ">" << std::endl;
+ }
+ } else {
+ triangulation.insert_constraint(va, vb);
+ //std::cout << "Inserting constraint <" << va->point() << ", " <<
vb->point() << ">" << std::endl;
+ }
+ }
+ } break;
+
+ }
+
+ case wkbMultiPolygon: {
+ OGRMultiPolygon *multipolygon = static_cast<OGRMultiPolygon *>(geometry);
+ for (int currentPolygon = 0; currentPolygon <
multipolygon->getNumGeometries(); ++currentPolygon) {
+ OGRPolygon *polygon = static_cast<OGRPolygon
*>(multipolygon->getGeometryRef(currentPolygon));
+
+ // Outer
+ vb = triangulation.insert(Point(polygon->getExteriorRing()->getX(0),
+ polygon->getExteriorRing()->getY(0)));
+ for (int currentPoint = 1; currentPoint <
polygon->getExteriorRing()->getNumPoints(); ++currentPoint) {
+ va = vb;
+ vb =
triangulation.insert(Point(polygon->getExteriorRing()->getX(currentPoint),
+
polygon->getExteriorRing()->getY(currentPoint)),
+ triangulation.incident_faces(va));
+ if (removeOverlappingConstraints && triangulation.is_edge(va, vb,
faceOfEdge, indexOfEdge)) {
+ if
(triangulation.is_constrained(std::pair<Triangulation::Face_handle,
int>(faceOfEdge, indexOfEdge))) {
+ triangulation.insert_constraint(va, vb);
+ triangulation.remove_constraint(va, vb);
+ } else triangulation.insert_constraint(va, vb);
+ } else triangulation.insert_constraint(va, vb);
+ }
+
+ // Inner
+ for (int currentRing = 0; currentRing <
polygon->getNumInteriorRings(); ++currentRing) {
+ vb =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX(0),
+
polygon->getInteriorRing(currentRing)->getY(0)));
+ for (int currentPoint = 1; currentPoint <
polygon->getInteriorRing(currentRing)->getNumPoints(); ++currentPoint) {
+ va = vb;
+ vb =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX(currentPoint),
+
polygon->getInteriorRing(currentRing)->getY(currentPoint)),
+ triangulation.incident_faces(va));
+ if (removeOverlappingConstraints && triangulation.is_edge(va, vb,
faceOfEdge, indexOfEdge)) {
+ if
(triangulation.is_constrained(std::pair<Triangulation::Face_handle,
int>(faceOfEdge, indexOfEdge))) {
+ triangulation.insert_constraint(va, vb);
+ triangulation.remove_constraint(va, vb);
+ } else triangulation.insert_constraint(va, vb);
+ } else triangulation.insert_constraint(va, vb);
+ }
+ }
+ } break;
+ }
+
+ default:
+ std::cerr << "PolygonRepair::insertConstraints: Cannot understand
input." << std::endl;
+ return;
+ break;
+ }
+
+ // Remove partially even-overlapping subconstraints
+ if (!removeOverlappingConstraints) return;
+ for (Triangulation::Subconstraint_iterator currentEdge =
triangulation.subconstraints_begin();
+ currentEdge != triangulation.subconstraints_end();
+ ++currentEdge) {
+ if
(triangulation.number_of_enclosing_constraints(currentEdge->first.first,
currentEdge->first.second) % 2 == 0) {
+ if (triangulation.is_edge(currentEdge->first.first,
currentEdge->first.second, faceOfEdge, indexOfEdge)) {
+ if (triangulation.is_constrained(std::pair<Triangulation::Face_handle,
int>(faceOfEdge, indexOfEdge))) {
+ //std::cout << "Removing constraint <" <<
currentEdge->first.first->point() << ", " << currentEdge->first.second->point()
<< ">" << std::endl;
+ triangulation.remove_constrained_edge(faceOfEdge, indexOfEdge);
+ }
+ }
+ }
+ }
+}
+
+void PolygonRepair::tagOddEven(Triangulation &triangulation) {
+
+ // Clean tags
+ for (Triangulation::Face_handle currentFace =
triangulation.all_faces_begin(); currentFace != triangulation.all_faces_end();
++currentFace)
+ currentFace->info().clear();
+
+ // Initialise tagging
+ std::stack<Triangulation::Face_handle> interiorStack, exteriorStack;
+ exteriorStack.push(triangulation.infinite_face());
+ std::stack<Triangulation::Face_handle> *currentStack = &exteriorStack;
+ std::stack<Triangulation::Face_handle> *dualStack = &interiorStack;
+ bool labellingInterior = false;
+
+
+ // Until we finish
+ while (!interiorStack.empty() || !exteriorStack.empty()) {
+
+ // Give preference to whatever we're already doing
+ while (!currentStack->empty()) {
+ Triangulation::Face_handle currentFace = currentStack->top();
+ currentStack->pop();
+ if (currentFace->info().beenTagged()) continue;
+ currentFace->info().isInInterior(labellingInterior);
+ for (int currentEdge = 0; currentEdge < 3; ++currentEdge) {
+ if (!currentFace->neighbor(currentEdge)->info().beenTagged()) {
+ if (currentFace->is_constrained(currentEdge))
+ dualStack->push(currentFace->neighbor(currentEdge));
+ else
+ currentStack->push(currentFace->neighbor(currentEdge));
+ }
+ }
+ }
+
+ // Flip
+ if (!labellingInterior) {
+ currentStack = &interiorStack;
+ dualStack = &exteriorStack;
+ } else {
+ currentStack = &exteriorStack;
+ dualStack = &interiorStack;
+ } labellingInterior = !labellingInterior;
+ }
+}
+
+void PolygonRepair::tagPointSet(Triangulation &triangulation,
std::list<std::pair<bool, OGRMultiPolygon *> > &geometries) {
+
+ // Clean tags
+ for (Triangulation::Face_handle currentFace =
triangulation.all_faces_begin(); currentFace != triangulation.all_faces_end();
++currentFace)
+ currentFace->info().clear();
+
+ std::stack<Triangulation::Face_handle> borderTriangles, taggingStack,
untaggingStack;
+ Triangulation::Vertices_in_constraint_iterator currentVertex, nextVertex,
lastVertex;
+ Triangulation::Vertex_handle va, vb;
+ Triangulation::Face_handle faceOfSubedge;
+ int indexOfSubedge;
+ bool sameOrder;
+
+ // Add all repaired outer rings
+ for (std::list<std::pair<bool, OGRMultiPolygon *> >::iterator multipolygon =
geometries.begin();
+ multipolygon != geometries.end(); ++multipolygon) {
+ for (int currentPolygon = 0; currentPolygon <
multipolygon->second->getNumGeometries(); ++currentPolygon) {
+ OGRPolygon *polygon = static_cast<OGRPolygon
*>(multipolygon->second->getGeometryRef(currentPolygon));
+ taggingStack = std::stack<Triangulation::Face_handle>();
+
+ // Outer
+ if (!multipolygon->first) for (int currentPoint = 0; currentPoint <
polygon->getExteriorRing()->getNumPoints(); ++currentPoint) {
+ va =
triangulation.insert(Point(polygon->getExteriorRing()->getX(currentPoint),
+
polygon->getExteriorRing()->getY(currentPoint)));
+ vb =
triangulation.insert(Point(polygon->getExteriorRing()->getX((currentPoint+1)%polygon->getExteriorRing()->getNumPoints()),
+
polygon->getExteriorRing()->getY((currentPoint+1)%polygon->getExteriorRing()->getNumPoints())));
+ if (va->point() == vb->point()) continue;
+ currentVertex = triangulation.vertices_in_constraint_begin(va, vb);
+ nextVertex = currentVertex;
+ ++nextVertex;
+ lastVertex = triangulation.vertices_in_constraint_end(va, vb);
+ if (*currentVertex == va) sameOrder = true;
+ else sameOrder = false;
+ while (nextVertex != lastVertex) {
+ if (!sameOrder) {
+ if (!triangulation.is_edge(*currentVertex, *nextVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!" <<
std::endl;
+ return;
+ }
+ } else {
+ if (!triangulation.is_edge(*nextVertex, *currentVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!" <<
std::endl;
+ return;
+ }
+ } if (triangulation.number_of_enclosing_constraints(*currentVertex,
*nextVertex) % 2 != 0)
+ taggingStack.push(faceOfSubedge);
+ currentVertex = nextVertex;
+ ++nextVertex;
+ }
+ }
+
+ // Inner
+ else for (int currentRing = 0; currentRing <
polygon->getNumInteriorRings(); ++currentRing) {
+ for (int currentPoint = 0; currentPoint <
polygon->getInteriorRing(currentRing)->getNumPoints(); ++currentPoint) {
+ va =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX(currentPoint),
+
polygon->getInteriorRing(currentRing)->getY(currentPoint)));
+ vb =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX((currentPoint+1)%polygon->getInteriorRing(currentRing)->getNumPoints()),
+
polygon->getInteriorRing(currentRing)->getY((currentPoint+1)%polygon->getInteriorRing(currentRing)->getNumPoints())));
+ if (va->point() == vb->point()) continue;
+ currentVertex = triangulation.vertices_in_constraint_begin(va, vb);
+ nextVertex = currentVertex;
+ ++nextVertex;
+ lastVertex = triangulation.vertices_in_constraint_end(va, vb);
+ if (*currentVertex == va) sameOrder = true;
+ else sameOrder = false;
+ while (nextVertex != lastVertex) {
+ if (sameOrder) {
+ if (!triangulation.is_edge(*currentVertex, *nextVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!"
<< std::endl;
+ return;
+ }
+ } else {
+ if (!triangulation.is_edge(*nextVertex, *currentVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!"
<< std::endl;
+ return;
+ }
+ } if
(triangulation.number_of_enclosing_constraints(*currentVertex, *nextVertex) % 2
!= 0)
+ taggingStack.push(faceOfSubedge);
+ currentVertex = nextVertex;
+ ++nextVertex;
+ }
+ }
+ }
+
+ // Expand the tags
+ untaggingStack = std::stack<Triangulation::Face_handle>();
+ while (!taggingStack.empty()) {
+ Triangulation::Face_handle currentFace = taggingStack.top();
+ taggingStack.pop();
+ if (currentFace->info().beenTagged()) continue;
+ currentFace->info().isInInterior(true);
+ untaggingStack.push(currentFace);
+ for (int currentEdge = 0; currentEdge < 3; ++currentEdge) {
+ if (!currentFace->neighbor(currentEdge)->info().beenTagged() &&
+ !currentFace->is_constrained(currentEdge)) {
+ taggingStack.push(currentFace->neighbor(currentEdge));
+ }
+ }
+ }
+
+ // Remove tagged tags
+ while (!untaggingStack.empty()) {
+ untaggingStack.top()->info().beenTagged(false);
+ untaggingStack.pop();
+ }
+ }
+ }
+
+ // Subtract all repaired inner rings
+ for (std::list<std::pair<bool, OGRMultiPolygon *> >::iterator multipolygon =
geometries.begin();
+ multipolygon != geometries.end(); ++multipolygon) {
+ for (int currentPolygon = 0; currentPolygon <
multipolygon->second->getNumGeometries(); ++currentPolygon) {
+ OGRPolygon *polygon = static_cast<OGRPolygon
*>(multipolygon->second->getGeometryRef(currentPolygon));
+ taggingStack = std::stack<Triangulation::Face_handle>();
+
+ // Outer
+ if (multipolygon->first) for (int currentPoint = 0; currentPoint <
polygon->getExteriorRing()->getNumPoints(); ++currentPoint) {
+ va =
triangulation.insert(Point(polygon->getExteriorRing()->getX(currentPoint),
+
polygon->getExteriorRing()->getY(currentPoint)));
+ vb =
triangulation.insert(Point(polygon->getExteriorRing()->getX((currentPoint+1)%polygon->getExteriorRing()->getNumPoints()),
+
polygon->getExteriorRing()->getY((currentPoint+1)%polygon->getExteriorRing()->getNumPoints())));
+ if (va->point() == vb->point()) continue;
+ currentVertex = triangulation.vertices_in_constraint_begin(va, vb);
+ nextVertex = currentVertex;
+ ++nextVertex;
+ lastVertex = triangulation.vertices_in_constraint_end(va, vb);
+ if (*currentVertex == va) sameOrder = true;
+ else sameOrder = false;
+ while (nextVertex != lastVertex) {
+ if (!sameOrder) {
+ if (!triangulation.is_edge(*currentVertex, *nextVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!" <<
std::endl;
+ return;
+ }
+ } else {
+ if (!triangulation.is_edge(*nextVertex, *currentVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!" <<
std::endl;
+ return;
+ }
+ } if (triangulation.number_of_enclosing_constraints(*currentVertex,
*nextVertex) % 2 != 0) {
+ borderTriangles.push(faceOfSubedge);
+ faceOfSubedge->info().isOnBorder(true);
+ taggingStack.push(faceOfSubedge);
+ } borderTriangles.push(faceOfSubedge->neighbor(indexOfSubedge));
+ faceOfSubedge->neighbor(indexOfSubedge)->info().isOnBorder(true);
+ currentVertex = nextVertex;
+ ++nextVertex;
+ }
+ }
+
+ // Inner
+ else for (int currentRing = 0; currentRing <
polygon->getNumInteriorRings(); ++currentRing) {
+ for (int currentPoint = 0; currentPoint <
polygon->getInteriorRing(currentRing)->getNumPoints(); ++currentPoint) {
+ va =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX(currentPoint),
+
polygon->getInteriorRing(currentRing)->getY(currentPoint)));
+ vb =
triangulation.insert(Point(polygon->getInteriorRing(currentRing)->getX((currentPoint+1)%polygon->getInteriorRing(currentRing)->getNumPoints()),
+
polygon->getInteriorRing(currentRing)->getY((currentPoint+1)%polygon->getInteriorRing(currentRing)->getNumPoints())));
+ if (va->point() == vb->point()) continue;
+ currentVertex = triangulation.vertices_in_constraint_begin(va, vb);
+ nextVertex = currentVertex;
+ ++nextVertex;
+ lastVertex = triangulation.vertices_in_constraint_end(va, vb);
+ if (*currentVertex == va) sameOrder = true;
+ else sameOrder = false;
+ while (nextVertex != lastVertex) {
+ if (sameOrder) {
+ if (!triangulation.is_edge(*currentVertex, *nextVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!"
<< std::endl;
+ return;
+ }
+ } else {
+ if (!triangulation.is_edge(*nextVertex, *currentVertex,
faceOfSubedge, indexOfSubedge)) {
+ std::cerr << "PolygonRepair::tagPointSet: Cannot find edge!"
<< std::endl;
+ return;
+ }
+ } if
(triangulation.number_of_enclosing_constraints(*currentVertex, *nextVertex) % 2
!= 0) {
+ borderTriangles.push(faceOfSubedge);
+ faceOfSubedge->info().isOnBorder(true);
+ taggingStack.push(faceOfSubedge);
+ } borderTriangles.push(faceOfSubedge->neighbor(indexOfSubedge));
+ faceOfSubedge->neighbor(indexOfSubedge)->info().isOnBorder(true);
+ currentVertex = nextVertex;
+ ++nextVertex;
+ }
+ }
+ }
+
+ // Expand the tags
+ untaggingStack = std::stack<Triangulation::Face_handle>();
+ while (!taggingStack.empty()) {
+ Triangulation::Face_handle currentFace = taggingStack.top();
+ taggingStack.pop();
+ if (currentFace->info().beenTagged()) continue;
+ currentFace->info().isInInterior(false);
+ untaggingStack.push(currentFace);
+ for (int currentEdge = 0; currentEdge < 3; ++currentEdge) {
+ if (!currentFace->neighbor(currentEdge)->info().isOnBorder() &&
+ !currentFace->neighbor(currentEdge)->info().beenTagged()) {
+ taggingStack.push(currentFace->neighbor(currentEdge));
+ }
+ }
+ }
+
+ // Remove border tags
+ while (!borderTriangles.empty()) {
+ borderTriangles.top()->info().isOnBorder(false);
+ borderTriangles.pop();
+ }
+
+ // Remove tagged tags
+ while (!untaggingStack.empty()) {
+ untaggingStack.top()->info().beenTagged(false);
+ untaggingStack.pop();
+ }
+ }
+ }
+}
+
+OGRMultiPolygon *PolygonRepair::reconstruct(Triangulation &triangulation) {
+ // std::cout << "Triangulation: " << triangulation.number_of_faces() << "
faces, " << triangulation.number_of_vertices() << " vertices." << std::endl;
+ if (triangulation.number_of_faces() < 1) {
+ return NULL;
+ }
+
+ // Reconstruct
+ OGRMultiPolygon *outPolygons = new OGRMultiPolygon();
+ for (Triangulation::Finite_faces_iterator seedingFace =
triangulation.finite_faces_begin(); seedingFace !=
triangulation.finite_faces_end(); ++seedingFace) {
+
+ if (!seedingFace->info().isInInterior() ||
seedingFace->info().beenReconstructed()) continue;
+ seedingFace->info().beenReconstructed(true);
+ if (!seedingFace->info().beenReconstructed()) {
+ std::cout << "ERROR! Should be marked as reconstructed!!!" << std::endl;
+ }
+
+ // Get boundary
+ std::list<Triangulation::Vertex_handle> *vertices = new
std::list<Triangulation::Vertex_handle>();
+ if (seedingFace->neighbor(2)->info().isInInterior() &&
!seedingFace->neighbor(2)->info().beenReconstructed()) {
+ seedingFace->neighbor(2)->info().beenReconstructed(true);
+ std::list<Triangulation::Vertex_handle> *l2 =
getBoundary(seedingFace->neighbor(2),
seedingFace->neighbor(2)->index(seedingFace));
+ vertices->splice(vertices->end(), *l2);
+ delete l2;
+ } vertices->push_back(seedingFace->vertex(0));
+ if (seedingFace->neighbor(1)->info().isInInterior() &&
!seedingFace->neighbor(1)->info().beenReconstructed()) {
+ seedingFace->neighbor(1)->info().beenReconstructed(true);
+ std::list<Triangulation::Vertex_handle> *l1 =
getBoundary(seedingFace->neighbor(1),
seedingFace->neighbor(1)->index(seedingFace));
+ vertices->splice(vertices->end(), *l1);
+ delete l1;
+ } vertices->push_back(seedingFace->vertex(2));
+ if (seedingFace->neighbor(0)->info().isInInterior() &&
!seedingFace->neighbor(0)->info().beenReconstructed()) {
+ seedingFace->neighbor(0)->info().beenReconstructed(true);
+ std::list<Triangulation::Vertex_handle> *l0 =
getBoundary(seedingFace->neighbor(0),
seedingFace->neighbor(0)->index(seedingFace));
+ vertices->splice(vertices->end(), *l0);
+ delete l0;
+ } vertices->push_back(seedingFace->vertex(1));
+
+ // Find cutting vertices
+ std::set<Triangulation::Vertex_handle> visitedVertices;
+ std::set<Triangulation::Vertex_handle> repeatedVertices;
+ for (std::list<Triangulation::Vertex_handle>::iterator currentVertex =
vertices->begin(); currentVertex != vertices->end(); ++currentVertex) {
+ if (!visitedVertices.insert(*currentVertex).second)
repeatedVertices.insert(*currentVertex);
+ } visitedVertices.clear();
+
+ // Cut and join rings in the correct order
+ std::list<std::list<Triangulation::Vertex_handle> *> rings;
+ std::stack<std::list<Triangulation::Vertex_handle> *> chainsStack;
+ std::map<Triangulation::Vertex_handle,
std::list<Triangulation::Vertex_handle> *> vertexChainMap;
+ std::list<Triangulation::Vertex_handle> *newChain = new
std::list<Triangulation::Vertex_handle>();
+ for (std::list<Triangulation::Vertex_handle>::iterator currentVertex =
vertices->begin(); currentVertex != vertices->end(); ++currentVertex) {
+
+ // New chain
+ if (repeatedVertices.count(*currentVertex) > 0) {
+ // Closed by itself
+ if (newChain->front() == *currentVertex) {
+ // Degenerate (insufficient vertices to be valid)
+ if (newChain->size() < 3) delete newChain;
+ else {
+ std::list<Triangulation::Vertex_handle>::iterator secondElement =
newChain->begin();
+ ++secondElement;
+ // Degenerate (zero area)
+ if (newChain->back() == *secondElement) delete newChain;
+ // Valid
+ else rings.push_back(newChain);
+ }
+ }
+ // Open by itself
+ else {
+ // Closed with others in stack
+ if (vertexChainMap.count(*currentVertex)) {
+
+ while (chainsStack.top() != vertexChainMap[*currentVertex]) {
+ newChain->splice(newChain->begin(), *chainsStack.top());
+ chainsStack.pop();
+ } newChain->splice(newChain->begin(), *chainsStack.top());
+ chainsStack.pop();
+ vertexChainMap.erase(*currentVertex);
+ // Degenerate (insufficient vertices to be valid)
+ if (newChain->size() < 3) delete newChain;
+ else {
+ std::list<Triangulation::Vertex_handle>::iterator secondElement
= newChain->begin();
+ ++secondElement;
+ // Degenerate (zero area)
+ if (newChain->back() == *secondElement) delete newChain;
+ // Valid
+ else rings.push_back(newChain);
+ }
+ }
+ // Open
+ else {
+ // Not first chain
+ if (repeatedVertices.count(newChain->front()) > 0)
vertexChainMap[newChain->front()] = newChain;
+ chainsStack.push(newChain);
+ }
+ } newChain = new std::list<Triangulation::Vertex_handle>();
+ } newChain->push_back(*currentVertex);
+ }
+ // Final ring
+ while (chainsStack.size() > 0) {
+ newChain->splice(newChain->begin(), *chainsStack.top());
+ chainsStack.pop();
+ }
+ // Degenerate (insufficient vertices to be valid)
+ if (newChain->size() < 3) delete newChain;
+ else {
+ std::list<Triangulation::Vertex_handle>::iterator secondElement =
newChain->begin();
+ ++secondElement;
+ // Degenerate (zero area)
+ if (newChain->back() == *secondElement) delete newChain;
+ // Valid
+ else rings.push_back(newChain);
+ }
+ // Make rings
+ std::list<OGRLinearRing *> ringsForPolygon;
+ for (std::list<std::list<Triangulation::Vertex_handle> *>::iterator
currentRing = rings.begin(); currentRing != rings.end(); ++currentRing) {
+ OGRLinearRing *newRing = new OGRLinearRing();
+ for (std::list<Triangulation::Vertex_handle>::reverse_iterator
currentVertex = (*currentRing)->rbegin(); currentVertex !=
(*currentRing)->rend(); ++currentVertex) {
+ newRing->addPoint(CGAL::to_double((*currentVertex)->point().x()),
CGAL::to_double((*currentVertex)->point().y()));
+ }
newRing->addPoint(CGAL::to_double((*currentRing)->back()->point().x()),
CGAL::to_double((*currentRing)->back()->point().y()));
+ ringsForPolygon.push_back(newRing);
+ } OGRPolygon *newPolygon = new OGRPolygon();
+ for (std::list<OGRLinearRing *>::iterator currentRing =
ringsForPolygon.begin(); currentRing != ringsForPolygon.end(); ++currentRing) {
+ if (!(*currentRing)->isClockwise()) {
+ newPolygon->addRingDirectly(*currentRing);
+ break;
+ }
+ } for (std::list<OGRLinearRing *>::iterator currentRing =
ringsForPolygon.begin(); currentRing != ringsForPolygon.end(); ++currentRing)
+ if ((*currentRing)->isClockwise())
newPolygon->addRingDirectly(*currentRing);
+ outPolygons->addGeometryDirectly(newPolygon);
+ } return outPolygons;
+}
+
+std::list<Triangulation::Vertex_handle>
*PolygonRepair::getBoundary(Triangulation::Face_handle face, int edge) {
+ std::list<Triangulation::Vertex_handle> *vertices = new
std::list<Triangulation::Vertex_handle>();
+
+ // Check clockwise edge
+ if (face->neighbor(face->cw(edge))->info().isInInterior() &&
!face->neighbor(face->cw(edge))->info().beenReconstructed()) {
+ face->neighbor(face->cw(edge))->info().beenReconstructed(true);
+ std::list<Triangulation::Vertex_handle> *v1 =
getBoundary(face->neighbor(face->cw(edge)),
face->neighbor(face->cw(edge))->index(face));
+ vertices->splice(vertices->end(), *v1);
+ delete v1;
+ }
+
+ // Add central vertex
+ vertices->push_back(face->vertex(edge));
+
+ // Check counterclockwise edge
+ if (face->neighbor(face->ccw(edge))->info().isInInterior() &&
!face->neighbor(face->ccw(edge))->info().beenReconstructed()) {
+ face->neighbor(face->ccw(edge))->info().beenReconstructed(true);
+ std::list<Triangulation::Vertex_handle> *v2 =
getBoundary(face->neighbor(face->ccw(edge)),
face->neighbor(face->ccw(edge))->index(face));
+ vertices->splice(vertices->end(), *v2);
+ delete v2;
+ }
+
+ return vertices;
+}
+
+void PolygonRepair::printEdges(Triangulation &triangulation) {
+ std::cout << "Edges:" << std::endl;
+ for (Triangulation::Finite_edges_iterator currentEdge =
triangulation.finite_edges_begin();
+ currentEdge != triangulation.finite_edges_end();
+ ++currentEdge) {
+ if (triangulation.is_constrained(*currentEdge))
+ std::cout << "\t<" <<
currentEdge->first->vertex((currentEdge->second+1)%3)->point() << ", " <<
currentEdge->first->vertex((currentEdge->second+2)%3)->point() << ">" <<
std::endl;
+ }
+}
+
+void PolygonRepair::printTriangle(Triangulation::Face_handle triangle) {
+ std::cout << "TRIANGLE(" << triangle->vertex(0)->point() << ", " <<
triangle->vertex(1)->point() << ", " << triangle->vertex(2)->point() << ")";
+}
+
+void PolygonRepair::printChain(std::list<Triangulation::Vertex_handle> &chain)
{
+ for (std::list<Triangulation::Vertex_handle>::iterator currentVertex =
chain.begin(); currentVertex != chain.end(); ++currentVertex) {
+ std::cout << (*currentVertex)->point() << ", ";
+ } std::cout << std::endl;
+}
diff --git a/PolygonRepair.h b/PolygonRepair.h
new file mode 100644
index 0000000..0f867c5
--- /dev/null
+++ b/PolygonRepair.h
@@ -0,0 +1,50 @@
+/*
+ Copyright (c) 2009-2013,
+ Ken Arroyo Ohori g.a.k.arroyooh...@tudelft.nl
+ Hugo Ledoux h.led...@tudelft.nl
+ Martijn Meijers b.m.meij...@tudelft.nl
+ All rights reserved.
+
+ // This file is part of prepair: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ Licensees holding a valid commercial license may use this file in
+ accordance with the commercial license agreement provided with
+ the software.
+
+ This file is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+#ifndef POLYGONREPAIR_H
+
+#include "definitions.h"
+
+class PolygonRepair {
+public:
+ OGRMultiPolygon *repairOddEven(OGRGeometry *geometry, bool timeResults =
false);
+ OGRMultiPolygon *repairPointSet(OGRGeometry *geometry, bool timeResults =
false);
+ void removeSmallPolygons(OGRMultiPolygon *outPolygons, double minArea);
+ OGRMultiPolygon *isr(OGRGeometry *geometry, double tolerance);
+ double computeRobustness(OGRGeometry *geometry = NULL);
+ bool saveToShp(OGRGeometry* geometry, const char *fileName);
+
+private:
+ Triangulation triangulation;
+
+ void insertConstraints(Triangulation &triangulation, OGRGeometry *geometry,
bool removeOverlappingConstraints = true);
+ void tagOddEven(Triangulation &triangulation);
+ void tagPointSet(Triangulation &triangulation, std::list<std::pair<bool,
OGRMultiPolygon *> > &geometries);
+ OGRMultiPolygon *reconstruct(Triangulation &triangulation);
+ std::list<Triangulation::Vertex_handle>
*getBoundary(Triangulation::Face_handle face, int edge);
+
+ // Debug functions
+ void printEdges(Triangulation &triangulation);
+ void printTriangle(Triangulation::Face_handle triangle);
+ void printChain(std::list<Triangulation::Vertex_handle> &chain);
+};
+
+#endif
\ No newline at end of file
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..7805c7f
--- /dev/null
+++ b/README.md
@@ -0,0 +1,96 @@
+## What is prepair?
+
+prepair -- pronounce 'pee-repair' as in 'polygon repair' -- permits us to
easily repair "broken" GIS polygons, and that according to the international
standards ISO 19107 (Geographic information -- Spatial schema). In brief, given
a polygon, it *automatically* repairs it and returns back a valid polygon
(actually a MultiPolygon if the input represents more than one polygon). Note
that this project is only concerned with single polygons, if you're interested
in validating how different po [...]
+
+Automated repair methods can be considered as interpreting ambiguous or
ill-defined polygons and giving a coherent and clearly defined output. Examples
of errors are: polygon has a dangling edge; polygon is not closed; polygon
self-intersects; an inner ring of the polygon is located outside the outer
ring; etc.
+
+prepair performs more or less the same as the new PostGIS 2.0's function
[ST_MakeValid()](http://postgis.org/documentation/manual-svn/ST_MakeValid.html),
but is faster, scales better to massive polygons, and predicting its behaviour
is simple (so one can guess how her polygons will be repaired).
+We have implemented two repair paradigms: an extension of the [odd-even
algorithm](https://en.wikipedia.org/wiki/Even-odd_rule) to handle GIS polygons
containing inner rings and degeneracies; and one where we follow a *set
difference* rule for the rings.
+
+prepair is based on a constrained triangulation ([CGAL](http://www.cgal.org)
is used) and [OGR](http://www.gdal.org/ogr/) is used to read/write WKT.
+
+It is available under a dual license scheme:
[GPLv3](http://www.gnu.org/copyleft/gpl.html) and commercial. If you are
interested in a commercial license, please contact [Ken Arroyo
Ohori](mailto:g.a.k.arroyooh...@tudelft.nl).
+
+## Details
+
+Details of how we automatically repair broken polygons, and what results you
can expect, are available in this scientific article:
+
+
+> Ledoux, H., Arroyo Ohori, K., and Meijers, M. (2014). A triangulation-based
approach to automatically repair GIS polygons. *Computers & Geosciences*
66:121-–131. [ [DOI] ](http://dx.doi.org/10.1016/j.cageo.2014.01.009) [ [PDF]
](http://homepage.tudelft.nl/23t4p/pdfs/14cgeo_prepair.pdf)
+
+If you use prepair for a scientific project, please cite this article.
+
+## How to compile?
+
+prepair is provided as source code, which is very easy to compile it on Linux
and Mac. We plan on offering binaries (including for Windows) in the future.
+
+To compile it, you first need to install the following three (free) libraries:
+
+1. [CGAL](http://www.cgal.org)
+2. [OGR](http://www.gdal.org/ogr/)
+3. [CMake](http://www.cmake.org)
+
+Afterwards run:
+
+ $ cmake .
+ $ make
+
+## It's a command-line program only
+
+A [WKT](http://en.wikipedia.org/wiki/Well-known_text) or an OGR dataset
(shapefile, geojson or GML for instance) is read as input, and a WKT or a
shapefile (a MultiPolygon) is given as output:
+
+ $ ./prepair --wkt 'POLYGON((0 0, 0 10, 10 0, 10 10, 0 0))'
+ MULTIPOLYGON (((0 10,0 0,5 5,0 10)),((5 5,10 0,10 10,5 5)))
+
+ $ ./prepair --ogr myfile.shp
+ MULTIPOLYGON (((0 10,0 0,5 5,0 10)),((5 5,10 0,10 10,5 5)))
+
+ $ ./prepair --shpOut --ogr data/CLC2006_180927.geojson
+ Creating out.shp
+
+[Snap
rounding](http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Snap_rounding_2/Chapter_main.html)
of the input segments can be performed:
+
+ $ /prepair --isr 2 --wkt "POLYGON((0 0, 10 0, 15 5, 10 0, 10 10, 0 10, 0
0))"
+ MULTIPOLYGON (((11 1,11 11,1 11,1 1,11 1)))
+
+It's possible to remove small (sliver) polygons in the output by giving the
smallest area allowed:
+
+ $ ./prepair --wkt 'POLYGON((0 0, 10 0, 10 11, 11 10, 0 10))'
+ MULTIPOLYGON (((10 0,10 10,0 10,0 0,10 0)),((11 10,10 11,10 10,11 10)))
+
+ $ ./prepair --wkt 'POLYGON((0 0, 10 0, 10 11, 11 10, 0 10))' --minarea 1
+ Removing polygons smaller than 1 unit^2.
+ MULTIPOLYGON (((10 0,10 10,0 10,0 0,10 0)))
+
+## Examples of invalid input you can try
+
+The folder 'data' contains examples of relatively big invalid polygons. These
are from the [Corine Land Cover 2006
dataset.](http://sia.eionet.europa.eu/CLC2006)
+
+A 'bowtie' polygon:
+
+ POLYGON((0 0, 0 10, 10 0, 10 10, 0 0))
+
+Square with wrong orientation:
+
+ POLYGON((0 0, 0 10, 10 10, 10 0, 0 0))
+
+Inner ring with one edge sharing part of an edge of the outer ring:
+
+ POLYGON((0 0, 10 0, 10 10, 0 10, 0 0),(5 2,5 7,10 7, 10 2, 5 2))
+
+Dangling edge:
+
+ POLYGON((0 0, 10 0, 15 5, 10 0, 10 10, 0 10, 0 0))
+
+Outer ring not closed:
+
+ POLYGON((0 0, 10 0, 10 10, 0 10))
+
+Two adjacent inner rings:
+
+ POLYGON((0 0, 10 0, 10 10, 0 10, 0 0), (1 1, 1 8, 3 8, 3 1, 1 1), (3 1, 3
8, 5 8, 5 1, 3 1))
+
+Polygon with an inner ring inside another inner ring:
+
+ POLYGON((0 0, 10 0, 10 10, 0 10, 0 0), (2 8, 5 8, 5 2, 2 2, 2 8), (3 3, 4
3, 3 4, 3 3))
+
diff --git a/TriangleInfo.cpp b/TriangleInfo.cpp
new file mode 100644
index 0000000..68cd6d4
--- /dev/null
+++ b/TriangleInfo.cpp
@@ -0,0 +1,66 @@
+/*
+ Copyright (c) 2009-2013,
+ Ken Arroyo Ohori g.a.k.arroyooh...@tudelft.nl
+ Hugo Ledoux h.led...@tudelft.nl
+ Martijn Meijers b.m.meij...@tudelft.nl
+ All rights reserved.
+
+ // This file is part of prepair: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ Licensees holding a valid commercial license may use this file in
+ accordance with the commercial license agreement provided with
+ the software.
+
+ This file is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+#include "TriangleInfo.h"
+
+TriangleInfo::TriangleInfo() {
+ info = 0x00;
+}
+
+void TriangleInfo::clear() {
+ info = 0x00;
+}
+
+bool TriangleInfo::beenTagged() {
+ return (info & 0x01) == 0x01;
+}
+
+void TriangleInfo::beenTagged(bool tagged) {
+ if (tagged) info |= 0x01;
+ else info &= 0xfe;
+}
+
+bool TriangleInfo::isInInterior() {
+ return (info & 0x02) == 0x02;
+}
+
+void TriangleInfo::isInInterior(bool inInterior) {
+ if (inInterior) info |= 0x03;
+ else info = (info & 0xfd) | 0x01;
+}
+
+bool TriangleInfo::isOnBorder() {
+ return (info & 0x04) == 0x04;
+}
+
+void TriangleInfo::isOnBorder(bool onBorder) {
+ if (onBorder) info |= 0x04;
+ else info &= 0xfb;
+}
+
+bool TriangleInfo::beenReconstructed() {
+ return (info & 0x08) == 0x08;
+}
+
+void TriangleInfo::beenReconstructed(bool reconstructed) {
+ if (reconstructed) info |= 0x08;
+ else info &= 0xf7;
+}
\ No newline at end of file
diff --git a/TriangleInfo.h b/TriangleInfo.h
new file mode 100644
index 0000000..df2045e
--- /dev/null
+++ b/TriangleInfo.h
@@ -0,0 +1,45 @@
+/*
+ Copyright (c) 2009-2013,
+ Ken Arroyo Ohori g.a.k.arroyooh...@tudelft.nl
+ Hugo Ledoux h.led...@tudelft.nl
+ Martijn Meijers b.m.meij...@tudelft.nl
+ All rights reserved.
+
+ // This file is part of prepair: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ Licensees holding a valid commercial license may use this file in
+ accordance with the commercial license agreement provided with
+ the software.
+
+ This file is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+#ifndef TRIANGLEINFO_H
+#define TRIANGLEINFO_H
+
+// TODO: Maybe create a marker manager in the future
+class TriangleInfo {
+public:
+ TriangleInfo();
+
+ void clear();
+ bool beenTagged();
+ void beenTagged(bool tagged);
+ bool isInInterior();
+ void isInInterior(bool inInterior);
+ bool isOnBorder();
+ void isOnBorder(bool onBorder);
+ bool beenReconstructed();
+ void beenReconstructed(bool reconstructed);
+
+private:
+ unsigned char info; // Bitset: unused unused
unused unused
+ // not reconstructed/reconstructed normal/border
exterior/interior untagged/tagged
+};
+
+#endif
diff --git a/data/CLC2006_180927.geojson b/data/CLC2006_180927.geojson
new file mode 100644
index 0000000..65cfc4a
--- /dev/null
+++ b/data/CLC2006_180927.geojson
@@ -0,0 +1,8 @@
+{
+"type": "FeatureCollection",
+
+"features": [
+{ "type": "Feature", "id": 1, "properties": { }, "geometry": { "type":
"Polygon", "coordinates": [ [ [ 20.334951393721923, 69.312059175453697 ], [
20.327375208667871, 69.312293026311792 ], [ 20.327485364246169,
69.312739485142785 ], [ 20.326222622420008, 69.312778428651612 ], [
20.326237341868506, 69.314127542415079 ], [ 20.325084634162735,
69.314612937857888 ], [ 20.324934098584368, 69.315292361724033 ], [
20.323067276254577, 69.315462362188399 ], [ 20.320568961428449,
69.31565179344124 [...]
+
+]
+}
diff --git a/data/CLC2006_2018418.geojson b/data/CLC2006_2018418.geojson
new file mode 100644
index 0000000..ad1018b
--- /dev/null
+++ b/data/CLC2006_2018418.geojson
@@ -0,0 +1,8 @@
+{
+"type": "FeatureCollection",
+
+"features": [
+{ "type": "Feature", "id": 1, "properties": { }, "geometry": { "type":
"Polygon", "coordinates": [ [ [ 22.716652616507279, 41.739391777210315 ], [
22.717590221328923, 41.739306431415358 ], [ 22.718575474468775,
41.739264303545092 ], [ 22.71858424200682, 41.739592533490146 ], [
22.718380460233906, 41.740170107222404 ], [ 22.718174484918258,
41.740665690567852 ], [ 22.717937147369661, 41.741353250284888 ], [
22.718630995087022, 41.741342854978051 ], [ 22.719237817489113,
41.740813893409765 [...]
+
+]
+}
diff --git a/definitions.h b/definitions.h
new file mode 100644
index 0000000..e2cb447
--- /dev/null
+++ b/definitions.h
@@ -0,0 +1,84 @@
+/*
+ Copyright (c) 2009-2013,
+ Ken Arroyo Ohori g.a.k.arroyooh...@tudelft.nl
+ Hugo Ledoux h.led...@tudelft.nl
+ Martijn Meijers b.m.meij...@tudelft.nl
+ All rights reserved.
+
+ // This file is part of prepair: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ Licensees holding a valid commercial license may use this file in
+ accordance with the commercial license agreement provided with
+ the software.
+
+ This file is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+// Compile-time options
+// * if the code crashes, try to compile with EXACT_CONSTRUCTIONS so that
+// robust arithmetic is used
+// * switch to the setdiff paradigm by defining SET_DIFF
+
+#define EXACT_CONSTRUCTIONS
+
+#ifndef DEFINITIONS_H
+#define DEFINITIONS_H
+
+#include "TriangleInfo.h"
+
+// STL
+#include <iostream>
+#include <stack>
+#include <set>
+#include <list>
+#include <fstream>
+#include <math.h>
+#include <time.h>
+
+// OGR
+#include <gdal/ogrsf_frmts.h>
+
+// CGAL
+#ifdef EXACT_CONSTRUCTIONS
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#else
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#endif
+#include <CGAL/Triangulation_face_base_with_info_2.h>
+#include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/Triangulation_hierarchy_2.h>
+#include <CGAL/Constrained_triangulation_plus_2.h>
+#include <CGAL/Snap_rounding_traits_2.h>
+#include <CGAL/Snap_rounding_2.h>
+
+// Kernel
+#ifdef EXACT_CONSTRUCTIONS
+typedef CGAL::Exact_predicates_exact_constructions_kernel K;
+#else
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+#endif
+
+typedef CGAL::Triangulation_vertex_base_2<K> TVB;
+typedef CGAL::Triangulation_hierarchy_vertex_base_2<TVB> VB;
+typedef CGAL::Constrained_triangulation_face_base_2<K> FB;
+typedef CGAL::Triangulation_face_base_with_info_2<TriangleInfo, K, FB> FBWI;
+typedef CGAL::Triangulation_data_structure_2<VB, FBWI> TDS;
+typedef CGAL::Exact_predicates_tag PT;
+typedef CGAL::Exact_intersections_tag IT;
+typedef CGAL::Constrained_Delaunay_triangulation_2<K, TDS, PT> CDT;
+typedef CGAL::Triangulation_hierarchy_2<CDT> CDTH;
+typedef CGAL::Constrained_triangulation_plus_2<CDTH> Triangulation;
+typedef CGAL::Snap_rounding_traits_2<K> SRT;
+
+typedef Triangulation::Point Point;
+typedef K::Segment_2 Segment;
+typedef K::Vector_2 Vector;
+
+// Non CGAL types
+typedef std::vector<std::pair<std::vector<Triangulation::Vertex_handle>,
std::vector<std::vector<Triangulation::Vertex_handle> > > > TaggingVector;
+#endif
diff --git a/icon.png b/icon.png
new file mode 100644
index 0000000..3d62edc
Binary files /dev/null and b/icon.png differ
diff --git a/prepair.cpp b/prepair.cpp
new file mode 100644
index 0000000..5528a5c
--- /dev/null
+++ b/prepair.cpp
@@ -0,0 +1,214 @@
+/*
+ Copyright (c) 2009-2013,
+ Ken Arroyo Ohori g.a.k.arroyooh...@tudelft.nl
+ Hugo Ledoux h.led...@tudelft.nl
+ Martijn Meijers b.m.meij...@tudelft.nl
+ All rights reserved.
+
+ // This file is part of prepair: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ Licensees holding a valid commercial license may use this file in
+ accordance with the commercial license agreement provided with
+ the software.
+
+ This file is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+#include "PolygonRepair.h"
+
+double minArea = 0;
+double isrTolerance = 0;
+bool shpOut = false;
+bool computeRobustness = false;
+bool pointSet = false;
+bool timeResults = false;
+
+void usage();
+bool savetoshp(OGRMultiPolygon* multiPolygon);
+
+
+int main (int argc, const char * argv[]) {
+
+ time_t startTime = time(NULL);
+
+ if (argc < 2 || strcmp(argv[1], "-h") == 0 || strcmp(argv[1], "--help") ==
0) {
+ usage();
+ return(0);
+ }
+
+ OGRGeometry *geometry;
+
+ for (int argNum = 1; argNum < argc; ++argNum) {
+ //-- whether to compute the robustness or not
+ if (strcmp(argv[argNum], "--robustness") == 0) {
+ computeRobustness = true;
+ }
+
+ //-- whether to use the point set topology paradigm or not
+ //-- if not, odd-even paradigm is used by default
+ else if (strcmp(argv[argNum], "--setdiff") == 0) {
+ pointSet = true;
+ }
+
+ //-- mininum area to keep in output
+ else if (strcmp(argv[argNum], "--minarea") == 0) {
+ minArea = atof(argv[argNum+1]);
+ ++argNum;
+ }
+
+ //-- ISR snapping tolerance
+ else if (strcmp(argv[argNum], "--isr") == 0) {
+ isrTolerance = atof(argv[argNum+1]);
+ ++argNum;
+ // TODO : scale dataset if tolerance < 1.0 because of CGAL bug
+ }
+
+ //-- output a shapefile (out.shp) instead of a WKT
+ else if (strcmp(argv[argNum], "--shpOut") == 0) {
+ shpOut = true;
+ }
+
+ //-- time the results
+ else if (strcmp(argv[argNum], "--time") == 0) {
+ timeResults = true;
+ }
+
+ //-- reading from WKT passed directly
+ else if (strcmp(argv[argNum], "--wkt") == 0) {
+ unsigned int bufferSize = 100000000;
+ char *inputWKT = (char *)malloc(bufferSize*sizeof(char *));
+ strcpy(inputWKT, argv[argNum+1]);
+ ++argNum;
+ OGRGeometryFactory::createFromWkt(&inputWKT, NULL, &geometry);
+ if (geometry == NULL) {
+ std::cout << "Error: WKT is not valid" << std::endl;
+ return 1;
+ }
+ }
+
+ //-- reading from WKT stored in first line of a text file
+ else if (strcmp(argv[argNum], "-f") == 0) {
+ unsigned int bufferSize = 100000000;
+ char *inputWKT = (char *)malloc(bufferSize*sizeof(char *));
+ if (argNum + 1 <= argc - 1 && argv[argNum+1][0] != '-') {
+ std::ifstream infile(argv[argNum+1], std::ifstream::in);
+ infile.getline(inputWKT, bufferSize);
+ ++argNum;
+ } else {
+ std::cerr << "Error: Missing input file name." << std::endl;
+ return 1;
+ }
+ OGRGeometryFactory::createFromWkt(&inputWKT, NULL, &geometry);
+ if (geometry == NULL) {
+ std::cout << "Error: WKT is not valid" << std::endl;
+ return 1;
+ }
+ }
+
+ //-- reading from a ogr dataset (most supported: shp, geojson, gml, etc)
+ else if (strcmp(argv[argNum], "--ogr") == 0) {
+ OGRRegisterAll();
+ OGRDataSource *dataSource = OGRSFDriverRegistrar::Open(argv[argNum+1],
false);
+ ++argNum;
+ if (dataSource == NULL) {
+ std::cerr << "Error: Could not open file." << std::endl;
+ return false;
+ }
+ OGRLayer *dataLayer = dataSource->GetLayer(0); //-- get first layer
+ dataLayer->ResetReading();
+ //-- Reads all features in this layer
+ OGRFeature *feature;
+ //-- get first feature
+ if (dataLayer->GetFeatureCount(true) > 1)
+ std::cout << "Reading only the first feature in the shapefile." <<
std::endl;
+ feature = dataLayer->GetNextFeature();
+ if (feature->GetGeometryRef()->getGeometryType() == wkbPolygon) {
+ geometry = static_cast<OGRPolygon
*>(feature->GetGeometryRef());feature->GetGeometryRef();
+ }
+ else {
+ std::cout << "First feature ain't a POLYGON." << std::endl;
+ return(0);
+ }
+
+ }
+
+ else {
+ usage();
+ return(0);
+ }
+ }
+
+ if (!timeResults) startTime = 0;
+
+ PolygonRepair prepair;
+
+ //-- compute robustness
+ if (computeRobustness == true)
+ std::cout << "Robustness of input polygon: " <<
sqrt(prepair.computeRobustness(geometry)) <<std::endl;
+
+ OGRGeometry *snappedGeometry;
+ if (isrTolerance != 0) {
+ snappedGeometry = prepair.isr(geometry, isrTolerance);
+ } else {
+ snappedGeometry = geometry;
+ }
+
+
+ OGRMultiPolygon *outPolygons;
+ if (pointSet) {
+ outPolygons = prepair.repairPointSet(snappedGeometry, startTime);
+ } else {
+ outPolygons = prepair.repairOddEven(snappedGeometry, startTime);
+ }
+
+ if (minArea > 0) {
+ prepair.removeSmallPolygons(outPolygons, minArea);
+ }
+
+ //-- output well known text
+ if (shpOut) {
+ prepair.saveToShp(outPolygons, "out.shp");
+ }
+ else {
+ char *outputWKT;
+ outPolygons->exportToWkt(&outputWKT);
+ std::cout << outputWKT << std::endl;
+ }
+
+
+ //-- compute robustness
+ if (computeRobustness == true)
+ std::cout << "Robustness of output polygon: " <<
sqrt(prepair.computeRobustness()) <<std::endl;
+
+ //-- time results
+ if (timeResults) {
+ time_t totalTime = time(NULL)-startTime;
+ std::cout << "Done! Process finished in " << totalTime/60 << " minutes "
<< totalTime%60 << " seconds." << std::endl;
+ }
+
+ return 0;
+}
+
+void usage() {
+ std::cout << "=== prepair Help ===\n" << std::endl;
+ std::cout << "Usage: prepair --wkt 'POLYGON(0 0, 1 0, 1 1, 0 0)'" <<
std::endl;
+ std::cout << "OR" << std::endl;
+ std::cout << "Usage: prepair -f infile.txt (infile.txt must contain one
WKT on the 1st line)" << std::endl;
+ std::cout << "OR" << std::endl;
+ std::cout << "Usage: prepair --ogr infile.shp (first polygon of infile.shp
is processed)" << std::endl;
+ std::cout <<
"================================================================================"
<< std::endl;
+ std::cout << "Additional options:" << std::endl;
+ std::cout << "--robustness Compute the robustness of the input/output" <<
std::endl;
+ std::cout << "--setdiff Uses the point set topology paradigm (default:
odd-even paradigm)" << std::endl;
+ std::cout << "--minarea AREA Only output polygons larger than AREA" <<
std::endl;
+ std::cout << "--isr GRIDSIZE Snap round the input before repairing" <<
std::endl;
+ std::cout << "--time Benchmark the different stages of the process"
<< std::endl;
+
+}
+
+
--
Alioth's /usr/local/bin/git-commit-notice on
/srv/git.debian.org/git/pkg-grass/prepair.git
_______________________________________________
Pkg-grass-devel mailing list
Pkg-grass-devel@lists.alioth.debian.org
http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-grass-devel
