pax_global_header00006660000000000000000000000064142260153030014506gustar00rootroot0000000000000052 comment=c9859161f471fbb3d2b611e550abca7561870d07 libnest2d-5.0.0/000077500000000000000000000000001422601530300133765ustar00rootroot00000000000000libnest2d-5.0.0/.gitignore000066400000000000000000000037751422601530300154020ustar00rootroot00000000000000### C++ template # Prerequisites *.d # Compiled Object files *.slo *.lo *.o *.obj # Precompiled Headers *.gch *.pch # Compiled Dynamic libraries *.so *.dylib *.dll # Fortran module files *.mod *.smod # Compiled Static libraries *.lai *.la *.a *.lib # Executables *.exe *.out *.app ### CMake template CMakeLists.txt.user CMakeCache.txt CMakeFiles CMakeScripts Testing Makefile cmake_install.cmake install_manifest.txt compile_commands.json CTestTestfile.cmake _deps ### JetBrains template # Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio, WebStorm and Rider # Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 # User-specific stuff .idea/**/workspace.xml .idea/**/tasks.xml .idea/**/usage.statistics.xml .idea/**/dictionaries .idea/**/shelf # Generated files .idea/**/contentModel.xml # Sensitive or high-churn files .idea/**/dataSources/ .idea/**/dataSources.ids .idea/**/dataSources.local.xml .idea/**/sqlDataSources.xml .idea/**/dynamic.xml .idea/**/uiDesigner.xml .idea/**/dbnavigator.xml # Gradle .idea/**/gradle.xml .idea/**/libraries # Gradle and Maven with auto-import # When using Gradle or Maven with auto-import, you should exclude module files, # since they will be recreated, and may cause churn. Uncomment if using # auto-import. # .idea/artifacts # .idea/compiler.xml # .idea/jarRepositories.xml # .idea/modules.xml # .idea/*.iml # .idea/modules # *.iml # *.ipr # CMake cmake-build-*/ # Mongo Explorer plugin .idea/**/mongoSettings.xml # File-based project format *.iws # IntelliJ out/ # mpeltonen/sbt-idea plugin .idea_modules/ # JIRA plugin atlassian-ide-plugin.xml # Cursive Clojure plugin .idea/replstate.xml # Crashlytics plugin (for Android Studio and IntelliJ) com_crashlytics_export_strings.xml crashlytics.properties crashlytics-build.properties fabric.properties # Editor-based Rest Client .idea/httpRequests # Android studio 3.1+ serialized cache file .idea/caches/build_file_checksums.ser .idea/ tmp/* test_package/buildlibnest2d-5.0.0/.gitlab-ci.yml000066400000000000000000000063611422601530300160400ustar00rootroot00000000000000# use the official gcc image, based on debian # can use verions as well, like gcc:5.2 # see https://hub.docker.com/_/gcc/ # image: meszarosq/phoenix:latest stages: - build - test build-clang: image: registry.gitlab.com/meszaros.q/libnest2d/ubuntu-clang stage: build tags: - linux - clang # instead of calling g++ directly you can also use some build toolkit like make # install the necessary build tools when needed # before_script: # - apt update && apt -y install cmake ninja-build git clang-7 # libpolyclipping-dev libnlopt-cxx-dev libboost-dev script: - mkdir -p build-clang - cd build-clang - cmake .. -GNinja -DCMAKE_CXX_COMPILER=clang++-7 -DCMAKE_C_COMPILER=clang-7 -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=./dist -DLIBNEST2D_BUILD_UNITTESTS=ON -DRP_ENABLE_DOWNLOADING=ON -DLIBNEST2D_HEADER_ONLY=OFF -DLIBNEST2D_THREADING=tbb - cmake --build . --target install - cd .. - mkdir -p build_example_dist && cd build_example_dist - cmake ../examples -GNinja -DCMAKE_CXX_COMPILER=clang++-7 -DCMAKE_C_COMPILER=clang-7 -DCMAKE_PREFIX_PATH="../build-clang/dist;../build-clang/dependencies" - cmake --build . artifacts: paths: - build-clang/tests/tests_clipper_nlopt # depending on your build setup it's most likely a good idea to cache outputs to reduce the build time # cache: # key: "$CI_JOB_ID" # paths: # - "build-clang/dependencies/*" build-gcc: image: registry.gitlab.com/meszaros.q/libnest2d/ubuntu-gcc stage: build tags: - linux - gcc # instead of calling g++ directly you can also use some build toolkit like make # install the necessary build tools when needed # before_script: #- apt update && apt -y install cmake ninja-build git g++ # libpolyclipping-dev libnlopt-cxx-dev libboost-dev script: - mkdir -p build-gcc - cd build-gcc - cmake .. -GNinja -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=./dist -DLIBNEST2D_BUILD_UNITTESTS=ON -DRP_ENABLE_DOWNLOADING=ON -DLIBNEST2D_HEADER_ONLY=OFF - cmake --build . --target install - cd .. - mkdir -p build_example_dist && cd build_example_dist - cmake ../examples -GNinja -DCMAKE_PREFIX_PATH="../build-gcc/dist;../build-gcc/dependencies" - cmake --build . artifacts: paths: - build-gcc/tests/tests_clipper_nlopt # depending on your build setup it's most likely a good idea to cache outputs to reduce the build time # cache: # key: "$CI_JOB_ID" # paths: # - "build-gcc/dependencies/*" # run tests using the binary built before test-clang: image: registry.gitlab.com/meszaros.q/libnest2d/ubuntu-clang stage: test tags: - linux #before_script: # - apt update && apt -y install libpolyclipping22 libnlopt-cxx0 libnlopt0 script: - cd build-clang/tests && ./tests_clipper_nlopt -r "junit" --out report-clang.xml artifacts: reports: junit: build-clang/tests/report-clang.xml test-gcc: image: registry.gitlab.com/meszaros.q/libnest2d/ubuntu-gcc stage: test tags: - linux #before_script: # - apt update && apt -y install libpolyclipping22 libnlopt-cxx0 libnlopt0 script: - cd build-gcc/tests && ./tests_clipper_nlopt -r "junit" --out report-gcc.xml artifacts: reports: junit: build-gcc/tests/report-gcc.xml libnest2d-5.0.0/CMakeLists.txt000066400000000000000000000134471422601530300161470ustar00rootroot00000000000000cmake_minimum_required(VERSION 3.20) project(Libnest2D) # Use C++17 Standard set(CMAKE_CXX_STANDARD 17) set(CMAKE_CXX_EXTENSIONS OFF) set(CMAKE_CXX_STANDARD_REQUIRED ON) # Add our own cmake module path. list(APPEND CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake_modules/) option(LIBNEST2D_BUILD_UNITTESTS "If enabled, googletest framework will be downloaded and the provided unit tests will be included in the build." OFF) option(BUILD_SHARED_LIBS "Build shared libs instead of static (applies for dependencies as well)" OFF) option(LIBNEST2D_HEADER_ONLY "If enabled static library will not be built." ON) set(GEOMETRY_BACKENDS clipper boost eigen) set(LIBNEST2D_GEOMETRIES clipper CACHE STRING "Geometry backend") set_property(CACHE LIBNEST2D_GEOMETRIES PROPERTY STRINGS ${GEOMETRY_BACKENDS}) list(FIND GEOMETRY_BACKENDS ${LIBNEST2D_GEOMETRIES} GEOMETRY_TYPE) if(${GEOMETRY_TYPE} EQUAL -1) message(FATAL_ERROR "Option ${LIBNEST2D_GEOMETRIES} not supported, valid entries are ${GEOMETRY_BACKENDS}") endif() set(OPTIMIZERS nlopt optimlib) set(LIBNEST2D_OPTIMIZER nlopt CACHE STRING "Optimization backend") set_property(CACHE LIBNEST2D_OPTIMIZER PROPERTY STRINGS ${OPTIMIZERS}) list(FIND OPTIMIZERS ${LIBNEST2D_OPTIMIZER} OPTIMIZER_TYPE) if(${OPTIMIZER_TYPE} EQUAL -1) message(FATAL_ERROR "Option ${LIBNEST2D_OPTIMIZER} not supported, valid entries are ${OPTIMIZERS}") endif() set(THREADING std tbb omp none) set(LIBNEST2D_THREADING std CACHE STRING "Multithreading") set_property(CACHE LIBNEST2D_THREADING PROPERTY STRINGS ${THREADING}) list(FIND THREADING ${LIBNEST2D_THREADING} THREADING_TYPE) if(${THREADING_TYPE} EQUAL -1) message(FATAL_ERROR "Option ${LIBNEST2D_THREADING} not supported, valid entries are ${THREADING}") endif() add_library(libnest2d_headeronly INTERFACE) set(SRC_DIR ${PROJECT_SOURCE_DIR}/include) set(LIBNEST2D_SRCFILES include/libnest2d/libnest2d.hpp include/libnest2d/nester.hpp include/libnest2d/geometry_traits.hpp include/libnest2d/geometry_traits_nfp.hpp include/libnest2d/common.hpp include/libnest2d/parallel.hpp include/libnest2d/optimizer.hpp include/libnest2d/utils/metaloop.hpp include/libnest2d/utils/rotfinder.hpp include/libnest2d/utils/rotcalipers.hpp include/libnest2d/utils/bigint.hpp include/libnest2d/utils/rational.hpp include/libnest2d/utils/boost_alg.hpp include/libnest2d/placers/placer_boilerplate.hpp include/libnest2d/placers/bottomleftplacer.hpp include/libnest2d/placers/nfpplacer.hpp include/libnest2d/selections/selection_boilerplate.hpp include/libnest2d/selections/filler.hpp include/libnest2d/selections/firstfit.hpp include/libnest2d/selections/djd_heuristic.hpp ) set(LIBNEST2D_PUBLIC_PACKAGES "" CACHE INTERNAL "") if(NOT ${LIBNEST2D_THREADING} STREQUAL "none") include(threading_${LIBNEST2D_THREADING}) target_link_libraries(libnest2d_headeronly INTERFACE ${LIBNEST2D_THREADING}Threading) target_compile_definitions(libnest2d_headeronly INTERFACE LIBNEST2D_THREADING_${LIBNEST2D_THREADING}) endif() add_subdirectory(${SRC_DIR}/libnest2d/backends/${LIBNEST2D_GEOMETRIES}) target_link_libraries(libnest2d_headeronly INTERFACE ${LIBNEST2D_GEOMETRIES}Backend) target_compile_definitions(libnest2d_headeronly INTERFACE LIBNEST2D_GEOMETRIES_${LIBNEST2D_GEOMETRIES}) add_subdirectory(${SRC_DIR}/libnest2d/optimizers/${LIBNEST2D_OPTIMIZER}) target_link_libraries(libnest2d_headeronly INTERFACE ${LIBNEST2D_OPTIMIZER}Optimizer) target_compile_definitions(libnest2d_headeronly INTERFACE LIBNEST2D_OPTIMIZER_${LIBNEST2D_OPTIMIZER}) target_include_directories(libnest2d_headeronly INTERFACE $) set(CMAKE_WINDOWS_EXPORT_ALL_SYMBOLS ON) add_library(libnest2d INTERFACE) if(NOT LIBNEST2D_HEADER_ONLY) set(LIBNAME libnest2d_${LIBNEST2D_GEOMETRIES}_${LIBNEST2D_OPTIMIZER}) add_library(${LIBNAME} ${PROJECT_SOURCE_DIR}/src/libnest2d.cpp) set_target_properties(${LIBNAME} PROPERTIES PREFIX "") set_target_properties(${LIBNAME} PROPERTIES DEBUG_POSTFIX "d") target_link_libraries(${LIBNAME} PUBLIC libnest2d_headeronly) target_compile_definitions(${LIBNAME} PUBLIC LIBNEST2D_STATIC) target_sources(${LIBNAME} PRIVATE ${LIBNEST2D_SRCFILES}) target_link_libraries(libnest2d INTERFACE ${LIBNAME}) else() target_link_libraries(libnest2d INTERFACE libnest2d_headeronly) endif() if(LIBNEST2D_BUILD_UNITTESTS) enable_testing() add_subdirectory(${PROJECT_SOURCE_DIR}/tests) endif() include(CMakePackageConfigHelpers) write_basic_package_version_file( "${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}ConfigVersion.cmake" VERSION 1.0 COMPATIBILITY AnyNewerVersion ) export(EXPORT ${PROJECT_NAME}Targets FILE "${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}Targets.cmake" NAMESPACE ${PROJECT_NAME}::) install(TARGETS libnest2d libnest2d_headeronly ${LIBNAME} EXPORT ${PROJECT_NAME}Targets RUNTIME DESTINATION bin ARCHIVE DESTINATION lib LIBRARY DESTINATION lib INCLUDES DESTINATION include) configure_file(cmake_modules/Config.cmake.in "${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}Config.cmake" @ONLY ) set(ConfigPackageLocation lib/cmake/${PROJECT_NAME}) install(EXPORT ${PROJECT_NAME}Targets FILE ${PROJECT_NAME}Targets.cmake NAMESPACE ${PROJECT_NAME}:: DESTINATION ${ConfigPackageLocation} ) foreach (srcfile IN ITEMS ${LIBNEST2D_SRCFILES}) get_filename_component(srcfile_dir ${srcfile} DIRECTORY) install( FILES ${PROJECT_SOURCE_DIR}/${srcfile} DESTINATION ${srcfile_dir} COMPONENT Devel ) endforeach() install( FILES "${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}Config.cmake" "${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}ConfigVersion.cmake" "${CMAKE_CURRENT_SOURCE_DIR}/cmake_modules/FindTBB.cmake" DESTINATION ${ConfigPackageLocation} COMPONENT Devel ) libnest2d-5.0.0/LICENSE.txt000066400000000000000000000167231422601530300152320ustar00rootroot00000000000000 GNU LESSER GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. This version of the GNU Lesser General Public License incorporates the terms and conditions of version 3 of the GNU General Public License, supplemented by the additional permissions listed below. 0. Additional Definitions. As used herein, "this License" refers to version 3 of the GNU Lesser General Public License, and the "GNU GPL" refers to version 3 of the GNU General Public License. "The Library" refers to a covered work governed by this License, other than an Application or a Combined Work as defined below. An "Application" is any work that makes use of an interface provided by the Library, but which is not otherwise based on the Library. Defining a subclass of a class defined by the Library is deemed a mode of using an interface provided by the Library. A "Combined Work" is a work produced by combining or linking an Application with the Library. The particular version of the Library with which the Combined Work was made is also called the "Linked Version". The "Minimal Corresponding Source" for a Combined Work means the Corresponding Source for the Combined Work, excluding any source code for portions of the Combined Work that, considered in isolation, are based on the Application, and not on the Linked Version. The "Corresponding Application Code" for a Combined Work means the object code and/or source code for the Application, including any data and utility programs needed for reproducing the Combined Work from the Application, but excluding the System Libraries of the Combined Work. 1. Exception to Section 3 of the GNU GPL. You may convey a covered work under sections 3 and 4 of this License without being bound by section 3 of the GNU GPL. 2. Conveying Modified Versions. If you modify a copy of the Library, and, in your modifications, a facility refers to a function or data to be supplied by an Application that uses the facility (other than as an argument passed when the facility is invoked), then you may convey a copy of the modified version: a) under this License, provided that you make a good faith effort to ensure that, in the event an Application does not supply the function or data, the facility still operates, and performs whatever part of its purpose remains meaningful, or b) under the GNU GPL, with none of the additional permissions of this License applicable to that copy. 3. Object Code Incorporating Material from Library Header Files. The object code form of an Application may incorporate material from a header file that is part of the Library. You may convey such object code under terms of your choice, provided that, if the incorporated material is not limited to numerical parameters, data structure layouts and accessors, or small macros, inline functions and templates (ten or fewer lines in length), you do both of the following: a) Give prominent notice with each copy of the object code that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the object code with a copy of the GNU GPL and this license document. 4. Combined Works. You may convey a Combined Work under terms of your choice that, taken together, effectively do not restrict modification of the portions of the Library contained in the Combined Work and reverse engineering for debugging such modifications, if you also do each of the following: a) Give prominent notice with each copy of the Combined Work that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the Combined Work with a copy of the GNU GPL and this license document. c) For a Combined Work that displays copyright notices during execution, include the copyright notice for the Library among these notices, as well as a reference directing the user to the copies of the GNU GPL and this license document. d) Do one of the following: 0) Convey the Minimal Corresponding Source under the terms of this License, and the Corresponding Application Code in a form suitable for, and under terms that permit, the user to recombine or relink the Application with a modified version of the Linked Version to produce a modified Combined Work, in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source. 1) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (a) uses at run time a copy of the Library already present on the user's computer system, and (b) will operate properly with a modified version of the Library that is interface-compatible with the Linked Version. e) Provide Installation Information, but only if you would otherwise be required to provide such information under section 6 of the GNU GPL, and only to the extent that such information is necessary to install and execute a modified version of the Combined Work produced by recombining or relinking the Application with a modified version of the Linked Version. (If you use option 4d0, the Installation Information must accompany the Minimal Corresponding Source and Corresponding Application Code. If you use option 4d1, you must provide the Installation Information in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source.) 5. Combined Libraries. You may place library facilities that are a work based on the Library side by side in a single library together with other library facilities that are not Applications and are not covered by this License, and convey such a combined library under terms of your choice, if you do both of the following: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities, conveyed under the terms of this License. b) Give prominent notice with the combined library that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 6. Revised Versions of the GNU Lesser General Public License. The Free Software Foundation may publish revised and/or new versions of the GNU Lesser 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 Library as you received it specifies that a certain numbered version of the GNU Lesser General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that published version or of any later version published by the Free Software Foundation. If the Library as you received it does not specify a version number of the GNU Lesser General Public License, you may choose any version of the GNU Lesser General Public License ever published by the Free Software Foundation. If the Library as you received it specifies that a proxy can decide whether future versions of the GNU Lesser General Public License shall apply, that proxy's public statement of acceptance of any version is permanent authorization for you to choose that version for the Library.libnest2d-5.0.0/README.md000066400000000000000000000200431422601530300146540ustar00rootroot00000000000000# Notice ## This library was developed as part of the [PrusaSlicer](https://github.com/prusa3d/PrusaSlicer) project. **You can find the original version [here](https://github.com/prusa3d/PrusaSlicer/tree/master/src/libnest2d).** This repository is a continuation of the original project (effectively a fork) that contains backported stable changes and is open to experimental new features. # Introduction Libnest2D is a library and framework for the 2D bin packaging problem. Inspired from the [SVGNest](svgnest.com) Javascript library the project is built from scratch in C++11. The library is written with a policy that it should be usable out of the box with a very simple interface but has to be customizable to the very core as well. The algorithms are defined in a header only fashion with templated geometry types. These geometries can have custom or already existing implementation to avoid copying or having unnecessary dependencies. A default backend is provided if the user of the library just wants to use it out of the box without additional integration. This backend is reasonably fast and robust, being built on top of boost geometry and the [polyclipping](http://www.angusj.com/delphi/clipper.php) library. Usage of this default backend implies the dependency on these packages but its header only as well. This software is currently under construction and lacks a throughout documentation and some essential algorithms as well. At this stage it works well for rectangles and convex closed polygons without considering holes and concavities. Holes and non-convex polygons will be usable in the near future as well. The no fit polygon based placer module combined with the first fit selection strategy is now used in the [PrusaSlicer](https://github.com/prusa3d/PrusaSlicer) application's arrangement feature. It uses local optimization techniques to find the best placement of each new item based on some features of the arrangement. In the near future I would like to use machine learning to evaluate the placements and (or) the order if items in which they are placed and see what results can be obtained. This is a different approach than that of SVGnest which uses genetic algorithms to find better and better selection orders. Maybe the two approaches can be combined as well. # Integration Using libnest2d in its current state implies the following dependencies: * [Clipper](http://www.angusj.com/delphi/clipper.php) * [NLopt](https://nlopt.readthedocs.io/en/latest/) * [Boost Geometry](https://www.boost.org/doc/libs/1_65_1/libs/geometry/doc/html/index.html) Integrating the library can be done in at least two ways. Use whichever suits your project the most. 1. The project source tree can be used as a subdirectory (or git submodule) in any other CMake based C++ project by using ```add_subdirectory()``` command in the parent level ```CMakeLists.txt``` file. This method ensures that the appropriate dependencies are detected or (optionally) downloaded and built if not found. This means that by default, if Clipper and NLopt are not installed, they will be downloaded into the CMake binary directory, built there and linked with your project if `RP_ENABLE_DOWNLOADING` is ON. Just add the ```target_link_library( libnest2d_headeronly)``` line to your CMake build script. You can also compile the library with the selected dependencies into a static or shared library. To do this just disable the ```LIBNEST2D_HEADER_ONLY``` option in the CMake config. 2. Copying source files directly into a target project: The library can be header only and it is enough to just copy the content of the ```include``` directory or specify the location of these headers to the compiler. Be aware that in this case you are on your own regarding the geometry backend and optimizer selection. To keep things simple just define ```LIBNEST2D_GEOMETRIES_clipper``` and ```LIBNEST2D_OPTIMIZER_nlopt``` before including ```libnest2d.hpp```. You will also need to link to these libraries manually. 3. *(Recommended)* Install the library after it was configured and "built" using cmake. An example how to do this in a bash command line in the checked out source dir: ``` bash mkdir build cd build cmake .. -DLIBNEST2D_HEADER_ONLY=OFF -DCMAKE_INSTALL_PREFIX= cmake --build . --target install ``` Substitute `` with your preferred location. If you don't have the required dependencies installed, you can add `-DRP_ENABLE_DOWNLOADING=ON` and make it download and build everything in the configure step. The built dependencies will be shared or static depending on `BUILD_SHARED_LIBS`. You can also specify the install location of the dependencies by setting `RP_INSTALL_PREFIX` variable. Alternatively you can (and should) install the dependencies first e.g. on Ubuntu: ``` sudo apt install libboost-dev libpolyclipping-dev libnlopt-dev ``` Please note that the clipper backend still uses some algorithms from ```boost::geometry``` (header only). Later releases will probably get rid of the direct dependency. The goal is to provide more geometry backends (e.g. boost only) and optimizer engines (e.g. optimlib) in the future. This would make it possible to use the already available dependencies in your project tree without including new ones. # Example A simple example may be the best way to demonstrate the usage of the library. ``` c++ #include #include // Here we include the libnest2d library #include int main(int argc, const char* argv[]) { using namespace libnest2d; // Example polygons std::vector input1(23, { {-5000000, 8954050}, {5000000, 8954050}, {5000000, -45949}, {4972609, -568550}, {3500000, -8954050}, {-3500000, -8954050}, {-4972609, -568550}, {-5000000, -45949}, {-5000000, 8954050}, }); std::vector input2(15, { {-11750000, 13057900}, {-9807860, 15000000}, {4392139, 24000000}, {11750000, 24000000}, {11750000, -24000000}, {4392139, -24000000}, {-9807860, -15000000}, {-11750000, -13057900}, {-11750000, 13057900}, }); std::vector input; input.insert(input.end(), input1.begin(), input1.end()); input.insert(input.end(), input2.begin(), input2.end()); // Perform the nesting with a box shaped bin size_t bins = nest(input, Box(150000000, 150000000)); // Retrieve resulting geometries for(Item& r : input) { auto polygon = r.transformedShape(); // render polygon... } return EXIT_SUCCESS; } ``` It is worth to note that the type of the polygon carried by the Item objects is the type defined as a polygon by the geometry backend. In the example we use the clipper backend and clipper works with integer coordinates. Of course it is possible to configure the nesting in every possible way. The ```nest``` function can take placer and selection algorithms as template arguments and their configuration as runtime arguments. It is also possible to pass a progress indication functor and a stop condition predicate to control the nesting process. For more details see the ```libnest2d.h``` header file. ## Example output ![Alt text](doc/img/example.svg) ## Screenshot from Slic3r PE For the record, **Slic3r PE** version 2.0 is now known as **PrusaSlicer 2.0**. ![Alt text](doc/img/slic3r_screenshot.png) # References - [SVGNest](https://github.com/Jack000/SVGnest) - [An effective heuristic for the two-dimensional irregular bin packing problem](http://www.cs.stir.ac.uk/~goc/papers/EffectiveHueristic2DAOR2013.pdf) - [Complete and robust no-fit polygon generation for the irregular stock cutting problem](https://www.sciencedirect.com/science/article/abs/pii/S0377221706001639) - [Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising the No Fit Polygon](http://www.graham-kendall.com/papers/k2001.pdf) - [A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums](https://www.sciencedirect.com/science/article/pii/S0305054806000669) libnest2d-5.0.0/_config.yml000066400000000000000000000000321422601530300155200ustar00rootroot00000000000000theme: jekyll-theme-caymanlibnest2d-5.0.0/cmake_modules/000077500000000000000000000000001422601530300162065ustar00rootroot00000000000000libnest2d-5.0.0/cmake_modules/Config.cmake.in000066400000000000000000000014601422601530300210230ustar00rootroot00000000000000include(CMakeFindDependencyMacro) if(EXISTS ${CMAKE_CURRENT_LIST_DIR}/RPPackageVersions.cmake) include(${CMAKE_CURRENT_LIST_DIR}/RPPackageVersions.cmake) endif() set(USED_PACKAGES @LIBNEST2D_PUBLIC_PACKAGES@) list(APPEND CMAKE_MODULE_PATH ${CMAKE_CURRENT_LIST_DIR}) set(TBB_STATIC @TBB_STATIC@) foreach(package ${USED_PACKAGES}) if(NOT ${CMAKE_FIND_PACKAGE_NAME}_FIND_QUIETLY) if(${${package}_VERSION}) set(_verstr "requested version: ${${package}_VERSION}") endif() message(STATUS "Using dependent package: ${package} ${_verstr}") endif() find_dependency(${package} ${${package}_VERSION}) endforeach() unset(USED_PACKAGES) if (EXISTS ${CMAKE_CURRENT_LIST_DIR}/Libnest2DTargets.cmake) include("${CMAKE_CURRENT_LIST_DIR}/Libnest2DTargets.cmake") endif() libnest2d-5.0.0/cmake_modules/FindTBB.cmake000066400000000000000000000311751422601530300204270ustar00rootroot00000000000000# The MIT License (MIT) # # Copyright (c) 2015 Justus Calvin # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal # in the Software without restriction, including without limitation the rights # to use, copy, modify, merge, publish, distribute, sublicense, and/or sell # copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in all # copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE # SOFTWARE. # # FindTBB # ------- # # Find TBB include directories and libraries. # # Usage: # # find_package(TBB [major[.minor]] [EXACT] # [QUIET] [REQUIRED] # [[COMPONENTS] [components...]] # [OPTIONAL_COMPONENTS components...]) # # where the allowed components are tbbmalloc and tbb_preview. Users may modify # the behavior of this module with the following variables: # # * TBB_ROOT_DIR - The base directory the of TBB installation. # * TBB_INCLUDE_DIR - The directory that contains the TBB headers files. # * TBB_LIBRARY - The directory that contains the TBB library files. # * TBB__LIBRARY - The path of the TBB the corresponding TBB library. # These libraries, if specified, override the # corresponding library search results, where # may be tbb, tbb_debug, tbbmalloc, tbbmalloc_debug, # tbb_preview, or tbb_preview_debug. # * TBB_USE_DEBUG_BUILD - The debug version of tbb libraries, if present, will # be used instead of the release version. # * TBB_STATIC - Static linking of libraries with a _static suffix. # For example, on Windows a tbb_static.lib will be searched for # instead of tbb.lib. # # Users may modify the behavior of this module with the following environment # variables: # # * TBB_INSTALL_DIR # * TBBROOT # * LIBRARY_PATH # # This module will set the following variables: # # * TBB_FOUND - Set to false, or undefined, if we haven’t found, or # don’t want to use TBB. # * TBB__FOUND - If False, optional part of TBB sytem is # not available. # * TBB_VERSION - The full version string # * TBB_VERSION_MAJOR - The major version # * TBB_VERSION_MINOR - The minor version # * TBB_INTERFACE_VERSION - The interface version number defined in # tbb/tbb_stddef.h. # * TBB__LIBRARY_RELEASE - The path of the TBB release version of # , where may be tbb, tbb_debug, # tbbmalloc, tbbmalloc_debug, tbb_preview, or # tbb_preview_debug. # * TBB__LIBRARY_DEGUG - The path of the TBB release version of # , where may be tbb, tbb_debug, # tbbmalloc, tbbmalloc_debug, tbb_preview, or # tbb_preview_debug. # # The following varibles should be used to build and link with TBB: # # * TBB_INCLUDE_DIRS - The include directory for TBB. # * TBB_LIBRARIES - The libraries to link against to use TBB. # * TBB_LIBRARIES_RELEASE - The release libraries to link against to use TBB. # * TBB_LIBRARIES_DEBUG - The debug libraries to link against to use TBB. # * TBB_DEFINITIONS - Definitions to use when compiling code that uses # TBB. # * TBB_DEFINITIONS_RELEASE - Definitions to use when compiling release code that # uses TBB. # * TBB_DEFINITIONS_DEBUG - Definitions to use when compiling debug code that # uses TBB. # # This module will also create the "tbb" target that may be used when building # executables and libraries. unset(TBB_FOUND CACHE) unset(TBB_INCLUDE_DIRS CACHE) unset(TBB_LIBRARIES) unset(TBB_LIBRARIES_DEBUG) unset(TBB_LIBRARIES_RELEASE) include(FindPackageHandleStandardArgs) find_package(Threads QUIET REQUIRED) if(NOT TBB_FOUND) ################################## # Check the build type ################################## if(NOT DEFINED TBB_USE_DEBUG_BUILD) if(CMAKE_BUILD_TYPE MATCHES "(Debug|DEBUG|debug)") set(TBB_BUILD_TYPE DEBUG) else() set(TBB_BUILD_TYPE RELEASE) endif() elseif(TBB_USE_DEBUG_BUILD) set(TBB_BUILD_TYPE DEBUG) else() set(TBB_BUILD_TYPE RELEASE) endif() ################################## # Set the TBB search directories ################################## # Define search paths based on user input and environment variables set(TBB_SEARCH_DIR ${TBB_ROOT_DIR} $ENV{TBB_INSTALL_DIR} $ENV{TBBROOT}) # Define the search directories based on the current platform if(CMAKE_SYSTEM_NAME STREQUAL "Windows") set(TBB_DEFAULT_SEARCH_DIR "C:/Program Files/Intel/TBB" "C:/Program Files (x86)/Intel/TBB") # Set the target architecture if(CMAKE_SIZEOF_VOID_P EQUAL 8) set(TBB_ARCHITECTURE "intel64") else() set(TBB_ARCHITECTURE "ia32") endif() # Set the TBB search library path search suffix based on the version of VC if(WINDOWS_STORE) set(TBB_LIB_PATH_SUFFIX "lib/${TBB_ARCHITECTURE}/vc11_ui") elseif(MSVC14) set(TBB_LIB_PATH_SUFFIX "lib/${TBB_ARCHITECTURE}/vc14") elseif(MSVC12) set(TBB_LIB_PATH_SUFFIX "lib/${TBB_ARCHITECTURE}/vc12") elseif(MSVC11) set(TBB_LIB_PATH_SUFFIX "lib/${TBB_ARCHITECTURE}/vc11") elseif(MSVC10) set(TBB_LIB_PATH_SUFFIX "lib/${TBB_ARCHITECTURE}/vc10") endif() # Add the library path search suffix for the VC independent version of TBB list(APPEND TBB_LIB_PATH_SUFFIX "lib/${TBB_ARCHITECTURE}/vc_mt") elseif(CMAKE_SYSTEM_NAME STREQUAL "Darwin") # OS X set(TBB_DEFAULT_SEARCH_DIR "/opt/intel/tbb") # TODO: Check to see which C++ library is being used by the compiler. if(NOT ${CMAKE_SYSTEM_VERSION} VERSION_LESS 13.0) # The default C++ library on OS X 10.9 and later is libc++ set(TBB_LIB_PATH_SUFFIX "lib/libc++" "lib") else() set(TBB_LIB_PATH_SUFFIX "lib") endif() elseif(CMAKE_SYSTEM_NAME STREQUAL "Linux") # Linux set(TBB_DEFAULT_SEARCH_DIR "/opt/intel/tbb") # TODO: Check compiler version to see the suffix should be /gcc4.1 or # /gcc4.1. For now, assume that the compiler is more recent than # gcc 4.4.x or later. if(CMAKE_SYSTEM_PROCESSOR STREQUAL "x86_64") set(TBB_LIB_PATH_SUFFIX "lib/intel64/gcc4.4") elseif(CMAKE_SYSTEM_PROCESSOR MATCHES "^i.86$") set(TBB_LIB_PATH_SUFFIX "lib/ia32/gcc4.4") endif() endif() ################################## # Find the TBB include dir ################################## find_path(TBB_INCLUDE_DIRS tbb/tbb.h HINTS ${TBB_INCLUDE_DIR} ${TBB_SEARCH_DIR} PATHS ${TBB_DEFAULT_SEARCH_DIR} PATH_SUFFIXES include) ################################## # Set version strings ################################## if(TBB_INCLUDE_DIRS) file(READ "${TBB_INCLUDE_DIRS}/tbb/tbb_stddef.h" _tbb_version_file) string(REGEX REPLACE ".*#define TBB_VERSION_MAJOR ([0-9]+).*" "\\1" TBB_VERSION_MAJOR "${_tbb_version_file}") string(REGEX REPLACE ".*#define TBB_VERSION_MINOR ([0-9]+).*" "\\1" TBB_VERSION_MINOR "${_tbb_version_file}") string(REGEX REPLACE ".*#define TBB_INTERFACE_VERSION ([0-9]+).*" "\\1" TBB_INTERFACE_VERSION "${_tbb_version_file}") set(TBB_VERSION "${TBB_VERSION_MAJOR}.${TBB_VERSION_MINOR}") endif() ################################## # Find TBB components ################################## if(TBB_VERSION VERSION_LESS 4.3) set(TBB_SEARCH_COMPOMPONENTS tbb_preview tbbmalloc tbb) else() set(TBB_SEARCH_COMPOMPONENTS tbb_preview tbbmalloc_proxy tbbmalloc tbb) endif() if(TBB_STATIC) set(TBB_STATIC_SUFFIX "_static") endif() # Find each component foreach(_comp ${TBB_SEARCH_COMPOMPONENTS}) if(";${TBB_FIND_COMPONENTS};tbb;" MATCHES ";${_comp};") unset(TBB_${_comp}_LIBRARY_DEBUG CACHE) unset(TBB_${_comp}_LIBRARY_RELEASE CACHE) # Search for the libraries find_library(TBB_${_comp}_LIBRARY_RELEASE ${_comp}${TBB_STATIC_SUFFIX} HINTS ${TBB_LIBRARY} ${TBB_SEARCH_DIR} PATHS ${TBB_DEFAULT_SEARCH_DIR} ENV LIBRARY_PATH PATH_SUFFIXES ${TBB_LIB_PATH_SUFFIX}) find_library(TBB_${_comp}_LIBRARY_DEBUG ${_comp}${TBB_STATIC_SUFFIX}_debug HINTS ${TBB_LIBRARY} ${TBB_SEARCH_DIR} PATHS ${TBB_DEFAULT_SEARCH_DIR} ENV LIBRARY_PATH PATH_SUFFIXES ${TBB_LIB_PATH_SUFFIX}) if(TBB_${_comp}_LIBRARY_DEBUG) list(APPEND TBB_LIBRARIES_DEBUG "${TBB_${_comp}_LIBRARY_DEBUG}") endif() if(TBB_${_comp}_LIBRARY_RELEASE) list(APPEND TBB_LIBRARIES_RELEASE "${TBB_${_comp}_LIBRARY_RELEASE}") endif() if(TBB_${_comp}_LIBRARY_${TBB_BUILD_TYPE} AND NOT TBB_${_comp}_LIBRARY) set(TBB_${_comp}_LIBRARY "${TBB_${_comp}_LIBRARY_${TBB_BUILD_TYPE}}") endif() if(TBB_${_comp}_LIBRARY AND EXISTS "${TBB_${_comp}_LIBRARY}") set(TBB_${_comp}_FOUND TRUE) else() set(TBB_${_comp}_FOUND FALSE) endif() # Mark internal variables as advanced mark_as_advanced(TBB_${_comp}_LIBRARY_RELEASE) mark_as_advanced(TBB_${_comp}_LIBRARY_DEBUG) mark_as_advanced(TBB_${_comp}_LIBRARY) endif() endforeach() ################################## # Set compile flags and libraries ################################## set(TBB_DEFINITIONS_RELEASE "") set(TBB_DEFINITIONS_DEBUG "TBB_USE_DEBUG=1") if(TBB_LIBRARIES_${TBB_BUILD_TYPE}) set(TBB_LIBRARIES "${TBB_LIBRARIES_${TBB_BUILD_TYPE}}") endif() if(NOT MSVC AND NOT TBB_LIBRARIES) set(TBB_LIBRARIES ${TBB_LIBRARIES_RELEASE}) endif() set(TBB_DEFINITIONS "") if (MSVC AND TBB_STATIC) set(TBB_DEFINITIONS __TBB_NO_IMPLICIT_LINKAGE) endif () unset (TBB_STATIC_SUFFIX) find_package_handle_standard_args(TBB REQUIRED_VARS TBB_INCLUDE_DIRS TBB_LIBRARIES FAIL_MESSAGE "TBB library cannot be found. Consider set TBBROOT environment variable." HANDLE_COMPONENTS VERSION_VAR TBB_VERSION) ################################## # Create targets ################################## if(NOT CMAKE_VERSION VERSION_LESS 3.0 AND TBB_FOUND) add_library(TBB::tbb UNKNOWN IMPORTED) set_target_properties(TBB::tbb PROPERTIES INTERFACE_COMPILE_DEFINITIONS "${TBB_DEFINITIONS}" INTERFACE_LINK_LIBRARIES "Threads::Threads;${CMAKE_DL_LIBS}" INTERFACE_INCLUDE_DIRECTORIES ${TBB_INCLUDE_DIRS} IMPORTED_LOCATION ${TBB_LIBRARIES}) if(TBB_LIBRARIES_RELEASE AND TBB_LIBRARIES_DEBUG) set_target_properties(TBB::tbb PROPERTIES INTERFACE_COMPILE_DEFINITIONS "${TBB_DEFINITIONS};$<$,$>:${TBB_DEFINITIONS_DEBUG}>;$<$:${TBB_DEFINITIONS_RELEASE}>" IMPORTED_LOCATION_DEBUG ${TBB_LIBRARIES_DEBUG} IMPORTED_LOCATION_RELWITHDEBINFO ${TBB_LIBRARIES_RELEASE} IMPORTED_LOCATION_RELEASE ${TBB_LIBRARIES_RELEASE} IMPORTED_LOCATION_MINSIZEREL ${TBB_LIBRARIES_RELEASE} ) endif() endif() mark_as_advanced(TBB_INCLUDE_DIRS TBB_LIBRARIES) unset(TBB_ARCHITECTURE) unset(TBB_BUILD_TYPE) unset(TBB_LIB_PATH_SUFFIX) unset(TBB_DEFAULT_SEARCH_DIR) if(TBB_DEBUG) message(STATUS " TBB_FOUND = ${TBB_FOUND}") message(STATUS " TBB_INCLUDE_DIRS = ${TBB_INCLUDE_DIRS}") message(STATUS " TBB_DEFINITIONS = ${TBB_DEFINITIONS}") message(STATUS " TBB_LIBRARIES = ${TBB_LIBRARIES}") message(STATUS " TBB_DEFINITIONS_DEBUG = ${TBB_DEFINITIONS_DEBUG}") message(STATUS " TBB_LIBRARIES_DEBUG = ${TBB_LIBRARIES_DEBUG}") message(STATUS " TBB_DEFINITIONS_RELEASE = ${TBB_DEFINITIONS_RELEASE}") message(STATUS " TBB_LIBRARIES_RELEASE = ${TBB_LIBRARIES_RELEASE}") endif() endif() libnest2d-5.0.0/cmake_modules/threading_omp.cmake000066400000000000000000000004561422601530300220350ustar00rootroot00000000000000find_package(OpenMP REQUIRED) add_library(ompThreading INTERFACE) target_link_libraries(ompThreading INTERFACE OpenMP::OpenMP_CXX) install(TARGETS ompThreading EXPORT Libnest2DTargets INCLUDES DESTINATION include) set(LIBNEST2D_PUBLIC_PACKAGES "${LIBNEST2D_PUBLIC_PACKAGES};OpenMP" CACHE INTERNAL "") libnest2d-5.0.0/cmake_modules/threading_std.cmake000066400000000000000000000004571422601530300220350ustar00rootroot00000000000000find_package(Threads REQUIRED) add_library(stdThreading INTERFACE) target_link_libraries(stdThreading INTERFACE Threads::Threads) install(TARGETS stdThreading EXPORT Libnest2DTargets INCLUDES DESTINATION include) set(LIBNEST2D_PUBLIC_PACKAGES "${LIBNEST2D_PUBLIC_PACKAGES};Threads" CACHE INTERNAL "") libnest2d-5.0.0/cmake_modules/threading_tbb.cmake000066400000000000000000000006571422601530300220140ustar00rootroot00000000000000add_library(tbbThreading INTERFACE) if(NOT BUILD_SHARED_LIBS) set(TBB_STATIC TRUE) endif() require_package(TBB REQUIRED) target_link_libraries(tbbThreading INTERFACE TBB::tbb) target_compile_definitions(tbbThreading INTERFACE -DTBB_USE_CAPTURED_EXCEPTION) install(TARGETS tbbThreading EXPORT Libnest2DTargets INCLUDES DESTINATION include) set(LIBNEST2D_PUBLIC_PACKAGES "${LIBNEST2D_PUBLIC_PACKAGES};TBB" CACHE INTERNAL "") libnest2d-5.0.0/conanfile.py000066400000000000000000000057531422601530300157200ustar00rootroot00000000000000from pathlib import Path from conan import ConanFile from conan.tools.cmake import CMakeToolchain, CMakeDeps, CMake from conans.errors import ConanInvalidConfiguration from conans.tools import Version from conan.tools.files import files required_conan_version = ">=1.46.2" class Libnest2DConan(ConanFile): name = "libnest2d" description = "2D irregular bin packaging and nesting library written in modern C++" topics = ("conan", "cura", "prusaslicer", "nesting", "c++", "bin packaging") settings = "os", "compiler", "build_type", "arch" build_policy = "missing" options = { "shared": [True, False], "fPIC": [True, False], "tests": [True, False], "header_only": [True, False], "geometries": ["clipper", "boost", "eigen"], "optimizer": ["nlopt", "optimlib"], "threading": ["std", "tbb", "omp", "none"] } default_options = { "shared": True, "tests": False, "fPIC": True, "header_only": False, "geometries": "clipper", "optimizer": "nlopt", "threading": "std" } scm = { "type": "git", "subfolder": ".", "url": "auto", "revision": "auto" } def configure(self): if self.options.shared or self.settings.compiler == "Visual Studio": del self.options.fPIC if self.options.geometries == "clipper": self.options["clipper"].shared = self.options.shared self.options["boost"].shared = self.options.shared if self.options.optimizer == "nlopt": self.options["nlopt"].shared = self.options.shared def build_requirements(self): if self.options.tests: self.build_requires("catch2/2.13.6", force_host_context=True) def requirements(self): if self.options.geometries == "clipper": self.requires("clipper/6.4.2") self.requires("boost/1.78.0") elif self.options.geometries == "eigen": self.requires("eigen/3.3.7") if self.options.optimizer == "nlopt": self.requires("nlopt/2.7.0") def generate(self): cmake = CMakeDeps(self) cmake.generate() tc = CMakeToolchain(self) # Don't use Visual Studio as the CMAKE_GENERATOR if self.settings.compiler == "Visual Studio": tc.blocks["generic_system"].values["generator_platform"] = None tc.blocks["generic_system"].values["toolset"] = None tc.variables["LIBNEST2D_HEADER_ONLY"] = self.options.header_only if self.options.header_only: tc.variables["BUILD_SHARED_LIBS"] = False else: tc.variables["BUILD_SHARED_LIBS"] = self.options.shared tc.variables["LIBNEST2D_BUILD_UNITTESTS"] = self.options.tests tc.variables["LIBNEST2D_GEOMETRIES"] = self.options.geometries tc.variables["LIBNEST2D_OPTIMIZER"] = self.options.optimizer tc.variables["LIBNEST2D_THREADING"] = self.options.threading tc.generate() libnest2d-5.0.0/doc/000077500000000000000000000000001422601530300141435ustar00rootroot00000000000000libnest2d-5.0.0/doc/img/000077500000000000000000000000001422601530300147175ustar00rootroot00000000000000libnest2d-5.0.0/doc/img/example.svg000066400000000000000000000541741422601530300171060ustar00rootroot00000000000000 image/svg+xml libnest2d-5.0.0/doc/img/slic3r_screenshot.png000066400000000000000000006150321422601530300210700ustar00rootroot00000000000000PNG  IHDR]sRGBgAMA a pHYsodIDATx^|$I~߉VPp]{;wvά%9K\9ԇ:=wN';q%j53ӳz[@ὩBʻ'@{wr#"##M!aaY6Ԃ 0 0 0j2 0 0 aaY^2 0 0 6Taafy0 0 ,/Paa*0 0 Paaɼ aaYFU~aafy0 0 ,/Paa*0 0 `Ceaa& 0 0 ,aaY^2 0 0 6Taafy0 0 ,/LuSaaf} 0 0Gbaa܇0 0 ,/Paa*0 0 `Ceaal 0 0 aaY^ׂ 0 0 0x 0 023 0 0 %?Ђ 0MfuYqag~-`8݈|\1 h2 ympS-Wi+atPan.o}7v)*ҢYg R 07 _~Ǐmٴ\(/WZKNCϴ0 sC;aŹZ믵ݤ%1 I2 ,%dn*)(P.wK K*0w"l 0K wޠbn ] @0 s2 (k+G-i)hk=z 0w܇0 xG?|hK[KZjw2 sa2eCeY0M_n 2ݧnTa afahn릒HEit&zh0dcF7x܍0m߇0 3ug䭨`wGG]]Zz.\}Ԕ@4jrZt7*<0*0na) %uNz#z7A[[ mA~*0l 0s7~ibZ4׮x(ԛݨ &2 ̣gzn̩E;t=?Dbh,TnTanPa inBa##ZtLNF#ٜ)w2 1ޣa)QQS =(栥EFvYn[}HKbYikx)a9QQKe\ܰS6tfF PPr#}U<6*0+0 臝Bahn6ȤSj{BKJ aUA-af0 HDTcqK)P̅ZKVWR ìTPa908E?/uʶmEJ剧kk|-%wFFf3 b?` 0<ȰSW+۷/LR6֮U 11!:P1{[aVl 0)ߊ nd5k|EyÎZJ:** <O}祖ݔaF†0 H7QoP3ɓ q2 d"孨w`YR7eI *0L&bsKAOշź? 00WhS 0i:ǜ  O?NY.h ))%'@5Q+#0̊PaVTv:q%FSaw:obiU3 ì,PaI;ch\C1G0Rah<q4q0 6Ta,d~h#TT$< 0`Ceɂx^?#_"|J7BIf7e?)0 !L)46f|YtNLDϐ/`|\DO0tw#x*Ci ,I)9R^~aV$Ԃ 0L*k>D:ѨW)=tr7TETaafy0 0 ,/LU|0L&ZJVU~o?)0 Paa*0 0 `Ceaa<0LV}<0+Ceaal 0 0 aaY^2 0 0 6Taafy0 0 ,/LU<0L&hSe+s)/60̊S 2 0P uxj-0 3 , K'0 6Taafy0 0 ,/Paa*0 0 `Ceaa<0LZJsm "?j0̊Paa*0 0 0*?0L&Z+* a 2 0 0 6Taafy0 ~՞aɊɼjdaRZMhS ìPaaY^2 0 0 6Taafy0 0 ,/PaaSa& -+RZ~0+*60 Sa<0+0 0 ,/Paa*0 0 `Ceaal 0 0 aaY^m۵ 0 u8T 60 Paa*0 0 0[R 0XWgR ìTaaY^2 0 0 6Ta.3 07*0 0 PaI(]d[TaYQp*0 0 `Ceaal 0 0 aaY^̭0L&ēR+I~0+Ceaa&s6-0 äBEhS ìPaC0 *0̭Ua&Paa*0 0 `Ceaal 0 0GbOQj*Ci hS ܁p*0 0 0[a&-e+S34P5TMZa;Cea#o<[ko}EKb掁 aY^]on+w_<|Ba;~Ra& +* |RjCST_~c9xtpSţX4t)W\man_`wiAa&fpʬJCznPWMZ?;t}/\뙞ALŞ/bc.^=dIeCeŠ5އ*'YU=|nF;nj4 ~KOpO*2 da l'[S:xSEc)LK]S#Sn3an;Y~a7Wywd'{Chf> hTW5և޾IaCe^wf*_~⑍͇NgO]ꘘ`۰g2o<}_{ϳ]r0 sbɂ^iR~lS3? W'\HTuSȩl~ꗭώtxGjW]d/3eev a& +6Uǟغs?d\nMYb2=cou`SMp4D^GwKp]eIe *60 7T|*BC" U9y>wQꦴK`1kfIqO=`0&W`F`gosn-w\ s0 %1T}[h_@꺆{gv?u>wIWx!nz5ݷ'97 Ƽеvm,+= sdaRتמM䝘"(hTL,P-C83Cegh9>|ɑ[7{+J8~r/RINrj6wknxqG ݏe(JRSVaV2l 0Y`C ir8qܴh&7ͨ:wn/M8O]zRǘs:M%u ^ƚfkxKc(TE˵HRK Q?:}0Jdga2R6ږón%eH*XȳK_{>{Q0 "pտl?|ܩK#S.i7Gp4v}pxksM[cQ3aV0ԭZaIEK4_|#>uRl2(mmzN^&|C H4=8vإ}0dj>TaL>T uiPwL|z䵾a1@iLlm`LF_{vt }#/N<42j2,h #( ;f){,ƻF >z , 0Y no~ΨccQQ*~gx}:?DƢdZf)ƕwMFbb-񡉩Ws״Y 2 d4|CǮ xo&poӏ?0:#ύMMG||j1ͦI]IE ([]0Mpw?= b`Cefj?!/cWܾ@4g7r}/ 5!9>տhI%7ϳT5ԎO^?~߁Z>a7ohAa&>s锉s965G~ !ߧGN^^씃B +/=vƵ;zOt?f]jfao dW9PdZK*&\bՆ8m6ٱ}eYp*0L>TΖ` z]^ojgD'z'_8ة)%3*mLr?H$sJE&ٔg*+]Xt;{ p0:5G]c.00ma& +P6%^U:y97T2_b;Jy_z^| }|اGO MNEBBhd2ZTq+!>L]>4MmʲҶiwp PhlޫOtM2r a& nhOݷ#'{ծ)"GzeJR\#~K#OH{D(]JFFc&bجx$5ykyJG tnKX3 |էG, laCeg\߸>;pI*df$Qg}yKѠ:VEFT$K*txTI{h7T_ge *0Ln'C]7}ɇ7:qꗟh117ͷZǯb2`fyXaCeɄ0u+PM}G\ کZ2b5޾8y.׌Ot%ج X:$5j3Ӟqذzamk&7kuTD닏?TcIee*0LVzO}{k ;u@5M!pn]glp.gF4QHz\ZZI5yyrGcMU0x}fKMR͑1SY)iE[(0 kZaIjWϏ:uaH"NHlwӚ7_|ftb+gtNNMWa4[k}H${RF[X_[Q nlVMI릧NŇ boXbϘLVW֭˾'XR a& +PC'vw!D5pӝ۾cS W\pTj1lVH*R~v#u{|٫Zt 3ST_[YQc-GuSkq ;42?~[j&}/tܿ+XTVO{fǏ"+9Ts aCyLKuwV OjqkFt6W2 dajDTX6Mn]O- O\T/䲮3wfE1*yVknZX7<::DX˯msޗM8$U1Z_0@F1'7k~Xa_g ZkZ$ fᛯDN]z•)udST;'LdTKKGPiPf5l5e&ohuϺig >P9tWHg0[S-Y_>EYjPaR xWZCm3̧/u<i`tB}в-HjcMeUEٵ/t>pSnj" 7h͘4][id&Pkj v=B;;g|?tUY TU6cQχy[cBj.ȷWUT;FƂ7q1s}; )6FF WS|dkdCYCzf-a@>U-0 ä5WljMT]sO9.t^?qb(T<>o,gV4v fQRRh̽Om{Zktؘ}h6 L-w'ZaPaRPልUe=pO:tEbb8*jaAA+[*EE9@0mXZVRTW]946=8H]}%A+ӧn7~X)(2,942R0 jCWyF;|ܘsT QHIGx$[i5MUBnNj{[ky3 "WcQ=Z!Pm OT.:&#yGQ(y LI᝝q MM!7+4rժ <l 0YXNJy&14'Ml@0twsӗ\[6P6 MP8j1:3T ?3Ik (*P׮544[ ޹)^VUT6uia *0LLrN Da*PTELp8j)+"zopzæ!Ӭ>')%0ߗ, ?.$u蜡_oXn.tSx'(*3T _Y Ot2 a252 dbԍ*P%U0?^ykCm4tgNSF׿)TIŹ*%{Qf ۾]ٲEٴIٰA')`=ݔΑ0ba!S%5n47U_{bq}/~xJ̻oc" $Rp1!/ӧB@1!J"i*a2 da`h̳YK5U(odL@(mY0 =<ʻ5WMYp ފ 7%)M]+^IE76 ߔdPY=x/3QaTDt\%a*…kǸ!IPC/HI 5Ud(<禠f} w\&qk'y2.;._^B:;aի(A(2K*,6Tߋp}oKJ5ԉ➱JGi$ 'I* Q28:>46 E=QSݶ8 F;;#ee!I .M 2T.>R;vNS)(Rd8w7E ;'ee K*,6Tx煋ו{YRo+I"HgyiI4S߭iA nZ]R)A#08Iz57-M ttnJ>M>JvSyazpYRfL 0+)@ԱPYTCOvJ"4(3RC,*Dp8Jb)ȳWUUNpS!ڲzETttC.Z,"n (a!Zŗ4nhl\;}=9ffCe?k܇{Rkb~BHUfV4VO !Q)?=4T$u8 ni9HQ8?҂sSkA"yfIŗOy/k"3w.l y煋(.aI]ZV*bmhus'7ުC9H*i,M/2s†0+w^J m tGKͧ|KzjE$2E h2Qf3t Mz>`^`1Ij:C$5. /mjnnM 2@@LħrsS-/n^RW%FYR`CexJm9ݫ?;xw^wXKt[[DHM@& P[:l Q@(ThϷY,`vI` ARg4 8MiA쐔nR׻)@Xࠖ(%0P[+G$Q(Ԃ |s_"5ctY^7y(]CSHTx|'v H Ezg4*&%R:&Ð7uahKeʔtFQ#5KcԴiBcgZ$k֘W6l:7ধNe{nidDLsqnJL",L b`(մRy]Z|+ܽDz2=d:9!2rb_sjnp߿~@9|ծP$J&umq HLB  A$J*fTĦjE!|̗M 5 ZL ;rY8 -}k|7Nw2jgz_~ԥiO4&iqīb-"3wl \h|#ڍmXT7}tsᓧɾ W]n|nOCnjZ K*jYN߯#M "vSJ7ܔR" @iHt:Ů۲E>Z(Efn{ \ CE`ђ#nCoff> mUwp[m?8wiF'9m@0hX'* %BTק8Q?PjԜ&,yAAڳ:7}QaYǐZU~DMq8b'Y44dhܞ2rA*XKH/^c=g|Y4sՕ{wMھ?g.9Ѹ@|> UC!\lx,**"jTXlDY mh}FiB30)8 n9E97M"nJK-T6 a zCK*={@hVP6.KI+9ݨ>kCGO_rdI^9]d)(d̰\ I5L%vbZ5*‚h,:469PZk;5 E`~F/ fߡ)rq(DGyn*aIenW`ڸ6 $yza=1PA&Ej8iB[(C$4O}O?w/>u~hb*7{D,&㽛f6;B}&)eel`8l2*Ep(Q=yJn}>,8$V ** O>9oOUMIV7c.MQ ST Mt 29QEYI! Ce ?\dCTL8}:NPHͧlDeHm9\6n5Oxֳ.W:uNq׈tMwmXOfMUՁgFWL%LʦN Da* #pòP(g4T!:<>uS"PVll?{%u宻͛ 湭ɚMuSdF:M%gn'PRW{^JgojYLgQIhMh1ыl)L& 7}WvgF'C^2`6m}ɳ{>?tl6ua8YۚG'f⥩]ޛ4gJIM&7#~ta(7Eiq"If@: fw qSpB ȝus9s{XxC 2 sxKGH0_{s-2to"tv˗E%L|Bhd5YM}8}k}>z$wLl4nlkk/yS`UoEpZ,fT;"Ѩ/,.,p: @uwصI{lᦧNid;v8%& $bNJDJF7$rd,Jh1CL7pA *cZaV>l ssSI5` n&TKJEGG}>eC{m"~5O9z|gn)4Bioƫ/FS44ޮJwJKPpSƝI2畕OL9΍w臡Kh $K*MB漣C07'3ʅ an"  _JEJIE.txX4RRg sa(]Õ}ݍpçuO{}9ɩɨi+ϕ]ɾ`8ⷱb5KQOi$%>L)ȳ=vOO\ؾ%sڼx)!nWM8{ Bׂ(AؘS̓ٵK an;׎i$5! W@c.ZJj ݼٰfR <4?qbWM|% j4G'PC=x UlHSnZgWkN-M%SSEA 87MƧ2;v̋>D SY$zPy$&ʬPP&'Z+[>( q P" I"{H4Tَu 6(yǞ=BدZ%'DJl~ YMO]=BܴKO=vtSd(3̣S45ʼ䵦P pS{A=JwvB90<, I87ȆrS@ۨp9y-QW'(ɰ2+6Tɉ/ҥt{- hB^ݤ=YURS*hho?'D gΝ>JQEl&Krb`8<͆o=p4׺ P(\Q]vy(> M%&aZ!H-+P[?BLo7EL"X5AÔ(9( QQ[Un- IűgO 09Z1^b]KKu@{lB j;ш&+Ej4?oDM 9B[>H C!C[oo=tg돪Y.ܴgN̯{]_ȭ@˗٬GqQ jr֬wJK.)jXnؤ3QGJ_~||&It߾8~@8v/#SɆ#'o8 D(Ds-B9arc|LBINQeT%taz-k6?g{ ]si nՉ(>wbaO"".A4{3qƯP-aVl 0qś'h\$dqAnkZnZ,~Xr3 ͵V}v{^즆/?ț/ɥG*@%{MNM9{hQt;a&wCMpS=l:sF-"LȩRhi$(2\D::14\"(}Mӓ覒fbY5,T ܍OomϞ8`CeVl d,ZRx{#G݆>Fn5+$dq4K&hN4֋ZdFoz5>v0R(WIJV%ptA- Pb5-0Lzv{]z^A S☣$SĜNaH׏|=(SS hVCVvz0:y5nX m$Tu@ʟ_"Tg.0+:~D("[=Gwp :{A5O k8إ 5~#BP"@ >Bn}':Ollm߱am/ڞϩBO++jx;gȆ OXP. 7"r蘷#@ADX O&a{?@X;r¿%gx~hp\o}[*pDkAϿ?m=>T Ua1'ݘ(ZCVƵJ}#cCwnr靌.zŏ͛(r"*OTD)22AUڱS)ѯDL ]6Sua[ UU)7{::r_ իby5p*`CeH0TʦE4{vҜZ5BRQlP8QOBw*pXO.hᵈR8/Pܣ[V:~kpeb!no<}x5ّ:>86D"Z"=%m:^zdX٬ꑉ2/,\Z:pr:XYo_@h =u >*M)n eȨ "Z\n4ڥb EOp)ʯd *yzOkch444[س' l̊djೖaZh RqBD-(ͩ)(>)ʻ $eEfjheڑaғME,3T|9y;qsZ{ Jb}϶M[^#'?>xZߠ7 fIQFQ- E Zn[yZj*CrG( ^3ݯ U#]XZ7G8E.(4SE@UAD!$LnE?b&SXhQ::zQUc{;Pg*>jV`h{E_L2 Oɉ~n*DDekńdT5NhDVT$zAqGB@ERC$Y􆊶nE4ZDjSjwkX;?u~ű)nJlzt[Ϗ~ Dr‘l6M./ u*n8!0 57TBR4~[LPz [{Bn DQJRmGU)ͥ-k㉳~GΜtm~ݯ;G\oT6Hb2CQTZ B ܶ m`Nkm_9v{MV)R*Lv;y:7]ԚWT[)5u\X:^,j*ߊ/ ="i`CeVl +_JCh0%@sʎ d*+D4ת ,d4%XrSu)KZL&emc׾|II. kf]<3?*{;SXc==iqD)@Ga `yZZ*捍BP/ 'OWYRg@RON'0N0Q(7E0@ UOǡ;vh78᝹8.d7%;-۶oOxzRD9Ea t*:dIE %hK3jz!>#bmo-8a#X2$ -=`PL(s&5ɴ"=z-@fi(N0|I)T좯=^?xedT^~sy O_20<= FA¢X_|. %zRk+)J.-8L(+3ldUUK^(Y),SϻU|w`ut Tea:cD >N'^@-(eaUAH$hgҞA~[FO/~(݌AiJJnMy3)?M#?EV}_ۏ&6T Ͼ{erTj5I$vB|!1?Vq|\4TF҂BZ[kxA1` =\L+ң7T:PP8A9 B =]h꛻Wv}za1@RNn#M4:?< Pq [g5>.$5P"0fґ'` 6D# |*+/W&<,:A/-.wE'ddpSSHFQ2`Ai/C7mo;'TdF$5 ۞NOKIb(K*,0kAa2{vZL[$@j;G_pX䯪P/^z"dUmlkP`YIJCŜւ=Ե~A|홇|#8|vxgVh) æY>{}5SӞ {k5j*=3>-0d)3PL{3.k 76TW!D9Ui4TPQa,(P0GxllK.冻2l*HP8p4qRX# ?Dn :w#,nl0KKl}Dׇ P'(9Mt,7|֎NM$oOɢ%57%)VZ|%}' e2LHCh2H*Ɇ6 S>xHwD~|J٨E{QpS}V^TWkP  hx)2D5=9v=wY( Y<nPU\ o$ٹɃO^= M/N$I]eCX[U_S5᜾77J 76 S4ñyB `ZJv!F!%bQ8spz )p̩OlJ>XذNR^Zoy>_ Dv#Kp8gnMB3AЉGQeTEQ Nlu(Ed06f8r$/ ł$O]F, rwSM557XJN06Tɕy Ԏ4T@!pX<т0Z^RP(s )/5`Fހ X X Aڣw~#>iOIqQtdl< ⺖:]+N^,x}~5UT͜BA;n5 jkG&F'`DIJEC-(P`~3QKP*LLtn mGvv]C.̴88p]08ArbUV8FQR%Qe6J 󰇽T<27HϲВ'.|2Lh*H' ҉b6Zqdл#Ƞ7T, ͶPQJZKfCR_}(G?CzG\6bt|"J*V z*G/>[oMz4$U?jF/h-fs~^^uE٪憱k}LUt8J$X:Q WTẢ(-p' P$JL bc.n1wYDeqni8+~# n D7*vLnTgH4TA,7BnJ?P77TL_dz_RLpӔ/M TtS>#Yh8^xAyɾ/c8 *Jj$Q4z(|=71lrG2T`@?TJIŔ)|Ksi0\OxĆf Zk?=p^3=㏪/SNR_[XS IE]6 ([EI>O?󹻑vJ$ՠckcQ.Y7Unt:{|_0Fm6+h4jfI9OCa Y6v:EyT$0IߒALw447 1ŁcM"3-Na$ҩEO!O)%Ǘ5kD%#PU|pQQݯCE 89Af78Gn |Z2 4K;J+}!DexlhHV_ohm_%X|S y$uݔ5<)yQ1|E-&ܥ|!2L4T5t?!)@HNx&yyMN=:h)eDFTokAVaɒ7T"BmPQTcH{nokM|.nzUpx鲘MU- 㓾lT BkO=ƋOySg'uJ ë 1dMnh%ALf%U)"Uw$ nEJ0(\@8$ Dba8d0HEA=N288(~ԤyyƮ"y%ErUogAvqO"tQaUAh.-%wSPW'4UꔇVZ[Jq6W*zM;v,G0%TP2]}326TGR}N*ж%H*]h"l /< PĄCd$K* E A/HkAeОQ7*op}v9O:7!f969i1#o7+hU(I C`pMsfT|f6*J=3pZYh4fLF8HM̕Pi)|hT|>cDw'Ċ 1mhصK).#'&Z@r& Qpp)@l@ŪSTe+|t^K *$.m)+8]QZUF:{t&ς\O%wSy{K1mߞZ:7IRoMΝBRs!vK}D%T2Ld5TmbICR(Ĕ3*cbB@[Ed}KJ2A_ i-6sсc'~ɾӗ;&=Qݓ4Yṃ͖ig={+S[vQRBRR׷>(T5I nZ^ 7M=^2oRzpʨJ꼅29nS7b$mQKji͈ʫDaD@ʈÇ()Υt@`0eNϼC14O)i-0Y VDN:KX;)*SdTEN($+Mv"ѤtT͑dsSfzPՉ&6TV†09[QpzЮGUFRIJm訚IGƘ{jS#Rji׃bsjP7-RP&"LM17ͷZ~`;o+{>?tU(X?195=}t[;P%P8lm~1Pĥ<. ugjsqS*ԓj4jr) j0T ,VT{6?84^;(:PƱjÑ*ԍ(7? gTE jyVR "r7⦓GSޭl,n3ErM)9nJd5E ({Hkį=zPdQ^.<3lݪ~CCbVmsAE4nA duubMpx^ujѓzxĄȆvYz^ kDk?>We/7 ۞s_A6iۺam~CǾOizjP~nNݹ)G\,?r&V:kײ&S]\F`( OO<`0"kb":$B8m$u@KCS@mlե#N?l}` 7 \ӕ D65>U)yW(,B;8]M}|3-BXVqcڕ˂%S4vuVR ʄ&S\, Lɤ,XP%q!wy[O&Wvߎ}M/M#찲R C:#j@|!"jP';xNJٲENNj*@ Z' )h-;w7u/͏;~^ɏCP9ؤ3 9J^i3_c7U]Uz9&-i>Uܐw aBP pj1M&WYCr) ƢJbO)0WDYS pVVQ O8Tyv✡3@@UAD6Y ȑ'NuځՆ^7֯7{ݯ~GvA&N]Npm҂PULL9v6jUDzݯ>{ G"l*Id7T/$z˥(=cEdAgJO'\ )sD%ލJb6T*WÜaҁe! ܹbࠫg֣Ң47;;E :gDxmHjfJJ$cÓO*81mi1<Ҹ)bP&W\89}7T ZGHˬ']Zhj%P2=*^ @kKkZP>'= lo2>rWOiSLmmU J* V8*lXLV1/d4#qSO^(OQiT O5UOֺik΍9aCRo>Ja*'aB)rL@Fƚ%pdF$Mei%UnM2*iv߾82gԅ==wN d޴Ix۴Irt.Vabrn* Cń nM Cen1l 2*ڛE"aJwDc)  jJw$CzIE .9LX4KrEXZK@X+ nuM?޷[<ރgGstS N{HjTS FaE-& t6* hnj Xl*kPlʲ<8ҩy+*ߊ*w}D06D?F:̬CH¥m=IWPRv)Ao0]7*V}hO6]A/꡶9R>&$qx)ȷpĝjkjk׬Q_ٴI݇PF|V/,C7 >/ Řl *UJJR{flZфчh8h˥;"LH д@Oi )BJLCJs+*X,b@ @/uW=so䇝j3ޑrRUSVRW֮BqT*Iw"n ԁ*h #h2Q"$䅢lH,fZk*sjZiv֖z)i2݊8|$>O)@@aC>jhGT\l>KэQOQ]*c %VdPI%PgrSyFD tdVêUz P3g>sJ"EE**H*N{|Ҁ:'X,yd疲ф.MhK.n+ḽPftWPvShrZ{ڡWdwD;"*QvJ 4UYFR=wi2ʵfU|پeө W?{.n*n](3SJr2S*@h@hCdNiԬ,dP-3Ij]U{^M-ڪ|ml醚7Fk'h)/nE j&=DiTQV"O_i)+mm=U UTՋCݨt #AyiU>t eEL(zbըp|zZ`eIMx< o9%:Rj Yw,6mT}qY45N\CeV4l 0JݨɽDhE!&IW*aBU1߶MbAM*ʤ邩vlML_zscNW,E29}V!j:C$U"Έ&S?ˏM&ZHHD\뇡FŢpS+ܴ̞?>圞b; C9~)"b`%3Dyv)ف *ZxPhL[P7j}(nZYVZY(-*b߉LVT%IkG9q$"^ L`J/5[a?dxNӧ W _Tg!w=]Z7^֊ {NB`{6副X*C5>3anl `v$:ShI>$9#0 jGGEĄm04ngaZ Vr_tVÑPDJ%%VSMNRa [>o6 BmiQḡ L,BFf/aJ($ =l(+.O\97r3:(Ԫ*SB#t&ЄS%Q0IgeMnTd 4W;%EN{`x+SK˧,I*%4hTdrTrSRSy$zJ<D)R?WPMey4L7 bBۇMMvԎȉMQ́ &1S)]U7˜VGECqA#E aO̪aeN큒~vPA…~@S">@{ ;xQҚc~>62|d rj=}ã_83!TfX]%~=%5M*\jz֬Q+]OoR]] ZK| 2gk״6_aIen&aē;kR\嗠&i$5;bg oh*p:E6iG+ѯQZ Ddagp8 T1a})mQ 8wX55}vhDLXmZ І'uTDf٨=pX m TLƪrGYi=5톑!yfl;e:slV lyEX& dtdD قͯJ*-uz)E;{b.EJJ*JKį's~pYYn7MLJ|&?M;l` bl䖖U- '2xRJHCXcLh%ݑ$vw =E#f$*|ZP\ E,(jܯ]@RǗBRV9?VZ\X]rp8D [~)Jva8ʄk"DTB੪ V{冒f@' acv+*Wx|2DJR\ CUH*BOY~2TCv5O8Y!IWRH`7oM hx9UWIKiܸhO.GwK릅p9qj-f74VϦa6TYиH?ARI8)]*Z9IEv d ڵ FPү%+~J2h ޘT55O^zy] s? UVB+)} QC㱘x7h,xxzTc77VPHց>>!C #K a Ka"S7jYq( ?P3gx nyanj'qX*7Ջf2G<=mMQ>O%4+.9u: l_s:$Pf8&T4Ù%đTzJw %!IQ4Բ2 'HIVCUIghP=(M0TD`l2 IzE7./[01~"*USO3JO; &DH>b ݄IBO1X,>0Yw_iQV^B'kNGP ԍo u {j2)%uAÝJmb7%Pqt CCbRtEevS_"%2 7 m/? K*s`Ce@@fI%H CvC/dAQa;"jrJ"WOi( Kk!CE: tN]hH4V9 2X䦎UM S^ {M ue"[^sz I"B٬|sR0顳@U)n5~*tƲvB֍ n\RqЉ͛1:8b T|!nJ 8e]QW@9#_ no7g /ph,602oV^{YR*,i s$*Zd"RRP;H&Tb2AδNVZi:CEQ)̽^OKilшҒ"BR̒-fhUS韁 ЫaT$a C,rOnzfwe@J4*nBGi?^\j.zrWgD OmDNAehؔLL o?HC%2wJ4t}hʽqNOT8v۶vo NߟMkk4T;=MDV7E*-båŊņ&,O?| ba0 +xb$K HRG[lLcHACH*TB!dPFk`i-HZ>9ӪeMBI ۬~ܥTcVݴQX?uܔllCGvbX*cV`ICa<&b17l2-~*V').-5 >_\nEU?jB_=UOS~*=2znT /^Rqp]ר nfxM"ˑ lڤtnHtn(>B +ڵH*)c$c1Ղ ]҂ _'`! kVT( LYPۖ,:e_Za2pX V*P7OC4Ņ<*sz*\l6f:JZ|GOBJU/`xW19r(@fZlT#bYxgiO)]/"ᚱTs9?_B?*QC*SYQHP )Jiނ%IrpSIaO48]3)> 21ƒ,܇0 #PUzI%B xqb3# Ln3Hϧ*&Z;`-(RHU 5&B{ OcY1}Z^*4 u gTtS|+E5J[ԼN$Yԣ&7IRj'$x:ZwSZQ)/WJK[RցQR'Nt .bN_{d%Y*L:6TYɆ ЬUHIdАP'*AJ4VID$BEQbPQ#*ThZˊZ‘ȵiWʩ:65RӋbLO=f 3ARisO(JbGZ%`q8t(##d%nT 4ŘSpKi ?ᆯkII?SI\Q !0s8)a1-}sG)(:?PJ2tS=pD3_)8u'dhG-7 p,%]{;X,&]KS,0 raOW,hwbbBK zH *%ON^X RRv u!Pax{"%oOI-wBO[렭z\+T-llZ5R}0IKT ń A1bGb( LӰwvq.եF( \Fۓw=UT "/$sH{Rrp4Ԭݨ8K].CQ^̵jdž@TVRk|-/GW=1D.JwHC8K"[MuS JpS|LvShtn +n$H̒_]vK`y$8SBaq^}}/3K*,-) #PheR6b%ֻ#5A3e1@k*ŎϽ`l̰}hoP (iX5 Z` ]hZ,iUc}iI):M?v6 S(OwXR'"$FJݢ`sE,B4Et)rvTU<祚X/07Q飄 #z ׯ/FRwhڬmT`5T{646S <=_~BY# 6TY @  a)dԌB qhѴPP%TTV$P FKkIgFŘg6,ቩp42f8k0WS{Ǚ$i h *pXI`4i!х<0 ;E|l&4D)^)WUCbWW6׸E QsJЏ)s*%$$##n?f&]7 ]7*|p|& ]gK 7i}W*]3>_(]$,3T"8`{NqIdVV҂.X  EmJH*] U O7Hwv}%YRECѦfmUYBCe6oVQ37T+Rc`l4 $[zP]!K*>E(+Z)u7-7U۬cH4"E}='(- 6(a~Ԇ }4C4COaSxM/tI1ыs 2?"('gdAEŞo*/C r{$TS@+JO )YO% Uߍ)8e[qzB%mu)/_&ERKg ٱ󠤧O 1]ME50'RQ̓TFL|_xCOF֭ !ɋETkT?:3D3UVZr/3 aFkdVCQ M&he3*Z,K;B~xA(#R YRi)*c]gT*= 7٬Ev{SmuaA~TXhj|%>u$ESTbG}NJ*dS{~g1)JA~pSC垁Ska|xsh\4֪d?% FMu[#ִ3ښ?'=ތn*!IͷbPJIjl'O Rx )`۞%gn @ v8~ERa{k8Jsk~H׀@?ἐԞ^QTf2Hi= 4%SEj*94TG6 ۠;\I7Q>)"3 CzIEhAX +Z@Fk\ 7Z եEёp$M%H p8ESJjqA.?CsIHA.q{/敗 3^l@(܁ 7 ιZ S0qHĖ͊?W UUi6Ӯ.kPuݨڴݨ6sycK 8)AC5nzt|ϞQ+,SşI*vž}c }} NY"u8/w ܻquc} K*#&S-*,tZUg.ł H:wD"Q3C z%^=1!A*$@m\K BG ٦Ƴ]%򵥋KFj*ʡUQ,S).稘*%Y?cGO/yBe%VA;ftBPs~snW6 )Z(Y ܍J(P@ؔi=S(qxx1ZZ4&^̢ u /@7s7RMȈ6l7QeRL Z+n*E)~q D!p*'Lԩ_'}(ܹ%nd&\^Jc? '3YTZ= U#5?lȠ@"5!0GC۶iH0T(L!&@Z5x.-BN}K O>쩭 nY\::2*e>O P >P2OӦevo|:7g6 j3<֝ cN:~)v~:N9+TF-+,~u<+zRhTM%uцKy.Z%3){iJ7.|a)`n >T  d&|eP,&d%;s2_8=X,\kUC[SeT&|a/usWq񗽰PZ8+zKK-.l\}'&*ȵPP,PˇtZgܟ~tTnzMOSWB wh RwIDUnT5E,BN R (4smNngD&V>[̦Jό+N].KaWZeA$9eCSnd#CEg{oubc$Q:z {ЯTsqΝ:JQLxlx8MASh,)I dpS7}[1_(3nMI%@*,zLW{߀7ԭnn;}0`Ce|' 2ߪz,ww1@0jfѻlu@O'fz =Mit!5? kBZ.7Mf{;8ւp(& `4')m >T?Ї &(2''^gcWۯՄ"nE&P[!RTjoߞg"X^^nO["Oo?<:WfGJۍr򭡓).W I b6Z,!(ne*0TΝ.[éS}bݔ()^â7MN t!R } I Ms>3EEJgYUe>0l:W\2N&\x4\;sYa`CeR_R}G?`ރMU]I 59Ɇ?Z?PW>z҃=X%Gւ'^j);ݞh3TZY .KZG&BeQ}"JHpSsժ>X>xpEpT&?f_]m.,4Lb#n?xQ ,cWj'`wfʥ5/O znTDQ8$ #Joˊd,(s{=f,4.Pkk=6{<= ܁J`~횘d#0&A=E$y*cRW=Zʚ5s%&7}}O*#cׯz{?=q^aÆ0YnWvily5+- 3K)W @JwJcayVlX**kCd1O'm{k*K=H Iǻvlbjlr* }#~`RuГC3D $7}gky0##@ ^/JR<zcVcI3B?8?n@OvcQ4nxl4Cgp{&?Z[]I*g]j6*j++N1l$2.G6eԅ*T pҷe>/l~qo&|M%z#(7R0GXFU?jV-b޾a O<_QRYc*äEW_g]gsW9=^;_޹y&N`BF\z4O-dtG.w!4{MMBRP=0T kA K3)\:7E[o_q1UqdB\? 1؍n§ROuP8e++X }DQCjsqYHj$imj z[Rףc60̻4%z=E-e:ٍDu"5 vG9nϏt J0GXFU? 8H® P\ b6m[]4<6?;|" uhYf6TI}Z:J=$oo^=Z^ȈPJ I)Ի2w̋&'LTjf92*EkHZEZ;P!wqMO8 3G-@FEE35#NYTPgONmlA$p:dKLQ洣[P#&8Wbv҅HD* ݨ8Lo?!':Kݵmۦu>Yʐ* ,rg>:>w83^X[b9IV6V{щD7xBY$5ήPS錖y Kc rwS|P>v¹)@AP7%P̆*ucڶWzlukkN__wxϳ2hS 3_}M9ˏ??s*WUD+pL:IO/],|@O+QRswG%cMMY&sAr0->:3:ߋ/ZvjQI!7|4DQL2#rݔ@eTCM"75 Wm-n_t{|8bqG&H蟿)nug']dMFƿ ׇǜg̝ *66/?z׺#'N'_pNn cR$JC%BṮ,@+lPZx-)Ek1wasݬX$,K;JFCZM#$9%|w/wWoȚ5GͣeXˑI׋)fn\%pm Q >_G{6ݯj bb JnuX+,]:U7Uk[^|g;sa 7MqKƝbK*LZ6Te?_~ޣ'^Oy=sCxsO{,QL$Z) wĄh􆊀laZ)/t^kt UP#'HZQDax奧f2&IŲ Oi}u`Neݺy ^}}+`^'IFlzzO>%UEYyp(@ξi_dUSF֦MN񪥫]j‘oKC]4FnZXU^VY VYSŚ&ј܍'z(b8rɢ3[޴y[@ BLmKٍ 媯z /귈:s(.ji(SdIɿWjl/4N{_*TY)7H%qΉGIW+SSUO](P9qL7jUP#'nq>r46r/ IbIQ,;ׂ s'?\]8~jzƋ?O߮'CW]ZZHqNV-A ׮ů]M ah D6 6 Nh}f)f$nn;#7~Ď 5K(@e @ 2_Ps4b+,fZ/L~3墷:Z-qxllhP9ٴiM]=|o(*%Ē7ykZ3p$ZRTo=w5N)\rNqAk?t ܴ^[U9LxQg`h9 մb3;~Jk鹀3<2/h׃SU|OwJI.Q|1 Oe KkD&Z$.sF<ʪ^zǡsSp^iNϼnTT55tT2J,4:U(mϨ/5@im,C!H](~xUbu)BӁs;]zpz P/2)z%[Eu *S0 2 $"Yޯ~&k(ʟJ(GPԌo|7_txt)92:]XS!1Pׯ7kga恨RpULsSoO}1Q KYq5XQB@.ZXod<|#'ǧFB83Wx% #[/s/t'OCMhYIqKc}q}9=Կp]g/ZߜM * 5ݢsx. 1ECwne6EY\&LWqP?8TkP)v8hϬXt%E@I yUpSn*9=@ U i|!fVnZ7-˷YG'G&&g\Ulx]hlJNAzz[dpS>)CYT"Qrzx?3`eN>!gfusc< śtV Dڟ] jɆ"I矇 Djm疕6MQ/ٱn"RLe@FݺXZUg: ~؄oYAN'I4ݽ/=z_iIE;j-0#~+/.]>_7tw1[K\.zl6޵nMuO޳+ԝdRR1RPѶC5b}Р@ ?{ǕtBΑ fIIeM\{?w=ݼx:LHQ$@F蜻s h  'zOH.L먯pjJʦ*U^uFoiNhxjTX4pĠ YA#ߔIm!ON[XW [s "VM̹^0p\rMt38!WEWC?>M#XԍP;*Uϗ"[ 2el(V+\<unxZGhG*^I,%Sxc!k^@/c6{Y@3} Fo`}<17G5NxfXOKH$P >vnNϡr>ԜXm.x]}?8>ebFH%aw3e1!ֻr2`&2==bĂ5Uͤi_A8@n{Jt|XeXdS* ~p^FFFǩ,-!|ř#?]v cPֹ;8nu)ncj6i5ڂѩ@m6ܨR1R1Z֦ ~e, DKF6H)<6wA!U*DnڝS|&߿Ȧeh 9^_Zg5d̵,j3ss3H*E)ds ]:[Jn|VV,1Yp?ԃ贚#w9Hv>nmϷ];{ohp&zH$//}c*FwުM V۹+cFu6W;k v,ҿiSZ6v%uzE07>T:*;(+ b;b~N~rKlu?a1 0:Z 3,k~qO6eY,dv%BĽ֥/NP$eR fZTͳsV;ϼ$X Ka _~.J <.WO$YnGȥR6ۍӍ_;'ի+dlTs| >`8cgD"ϗH|EܮK":sqWUZܺڭ DZYnL\c 6ݹSu1ȏB4.n4O 7J~x'8E{rb9zDBaUIў(~;g-V6WWwڤ~os9~9?:{H\RW^x{}rܕ32)h /,ܽ}w:jkʦbBjLBmn&sΦg΄XOpV~aY"&f|֤l?*+)2;HMR[zw_}gG c].败VL(Ȧi\rvK!UԊS{B? U@!5~̯~%6RlWAt/baw%L"iSU T"A ;nŜ_l~EE$1TDFσ(~}nhZMx |Dهf= 7cfZ:}*=n,##e DM %zm놦qԘq'~#Gd)9Iʍ?| ~Ϗ{s=v(%6-k_{<0=3gN_jpeaB-Θ~hBfWŇԮpR# 6=p@=BR}}1rή<ߊb*NFM{xfD.mkff&J歳"xKL8m.Æꩀ?p]N!8)M*מP-P-봨j E* hIi:bQ'ԉLQ!~]}uH(y`"XШ}FOˇT$y$"S$bE>DRr@'Ԕ¯\aE// ~-5ߴcF/#Ṱ eH"#yYV"Ġݳ5 u ZmoBCSkˏ^(6po,M;SS HjR,y}>ӵ"%sVafn~x A6|RX?oCS__tg)CPK]^zgCՉ3?yꠃ'gSg;[N;y<|dKLW;rpzK64ZԓZ]s? Bk#pF4Ɔ6v'2KMa ԧ rw GTM#/Ô? 55;0˵6K=`V/h88ed*;50#_`t;*Zt1ԟźmaH(;#FXTRw*{tBhgчJȋi$an.#z # m@xNx@DM6;m$~hQg'"W*ELG⬈@ٽeP($}~P(i5 g?s=9ݾjN]-?x6Ԝ<{'NuZ.R8ĦUgGs=.MNPNg `!R5'RN@ǏtL`;|ct ۓJeel ;X*%f=Nؓ.f)ߎj4d@JayJmmJA*.-$_R6Lu4푑<]rW ԩ.dT!aR#kTr؄[y Xj E"wFTZVRxj5RڙV L,>R!_p!5snJ@33d ~:pFJ% Uq ` m(E"o ΀M $/,MUѳ8;N9Bi lWR `vbشPxWy|tsǧf<", Nb0BƆ-n'րrlT.T_ ؔ8HJ=Mqf\6L]6gʶIi!֍}=~NXhRڻi%<}*+nT" @fE"!>OORx?H7D$4=OKs2"6S&W=^#FvZ%B҅TɴS`LE)'.C\qwmD TӈB}ᩋIR@( i 7oPCYKlʉaԅIL~g-Q9Bi=_} /\|OuMےP+O"0-ׂi:d"£񟔊Sѱ!PfaarKf8>EOM-i` tf+@rw̘aE"mAW~'~IԻK@z*_a\~P(ڷö6x:7 1653v^+hIGπzfSNt~U%GkMgj-fSle`JM9N._R"(/'_ %*MR`EBpO><95:HdXSqkmPsN{ÖY̠B@.+1ܻWujSNO ay\ o<"-[Qɐ郒lD*d"6儇Cnlx:hDHF ŏ\&mT+`S)'pZ vosI/XH`뺪 dLm^yk?>~:M"QijNk*w_>=otϵ] )[/T!;+|zR:=ÑMuUdT-]@+`X2h,ac؆}86k>Qo>2NS`qWR7}(4S<"A¦-GS/Miƚx.|m*)>pz⁹k]Sf GM67s%z_|t}QqduHwmN)2a|uMEP(طڑFՖ۝g2 A T ΒLB \Os]M ̻-6mDtf-uw1ޒ~5JT+pM*Ǭ⇐c%3.E 3VϰTGU11@6Ġ/PL3<Jk@S) Y!F Q xEI$bp*(4Sf"4<߁M U1ybvJ98mv~'ܿz_MOf'M D%U?fyYlJ4Qڧ( ni`l8oD u6N+*ho ,)O'aZ M+D V LpW1bFeֈ(zG[ҳg9ym6'`S*CZ_0;VU]Q&fsU/Ya1 W NfFe^jYXXa s1@(J+t 0~>R$`zw5Nβ7rH副F ULcM~d'vh-A'jnV]j*:pWgwϯ}xi33@)bg=ӗ;&z`SHR-5ciELٛm\tԔ.j6-BEٔDMǦ^/@}W.D 餩IPZJ4n pyYg&SCċmRU~t"lsʖ)eKk68>.j"7jB|۬L"*/kǍ9P*7_1EST.RAwj*i`'rY i)'.@ASypVSx3ra'}`_Wo/}xbiu9rzA yR?P:Yѣc3TJ Ř%< Njm2ElMw=n].JvQ <b.AȽ鲩F#מ5-EΝ]H>MɢaGn7*+:w^0e6ʖr)BԦ5ρ͖76W[gFvWU$K /![ k uRpc.m}njS("B3]HE& 'VՇ@.SYUJBj >`"bSSyv~`dodu" "Zr@*+|Ik* :ivBS{#|\oc6h7r#ԜVKjʿ^8tOO/~p•Q4)HV¦voqj9ޝ3fƈ9ztRqլREGm2gۜZ۷oX` wfNsiY77 jkv;D Ss xV3m-pS(X(5inj_|tͧMk3)ũ .-*4Őae!P7*5\I$nmkG&LŖLi65TJ꣟UB ٺy8#n`Ę/ k8{R"TygrMx7߅QVtNuC̜oxreƦpb;򘐊=rؠ7Y^/M9aw(r{}C{wW9H#ԜVE/_BS&YaSN1{ˈ(Xjk@*&&DBܳRalϧR6mwGKjo_F6JKK|$eSPƞ)L#@d'0tf&ov6| 8;K_B H8\]sfg6-D]ъ]ԦxI: \ UW%$1T$VGDžv/ hG# P'@0. <׫),2f"|0 RH?c+6eRWNSxs|D^,kӘ!WGK^2`wZ t"~K1.hH,# x-I&W[ff 'yF| H|#cRV\ts8rS6~a|vqh86YaSx%MRy:a!`JW8?,%T&t"m`0!ذ!=px ?OM) *p*l@HR&o6r*Җl H_XNMeU\RiɘB)5>N_6i\|d52:2yMyɎG'yR9g,7A B~*ˊ+KK,6yC&MΦp\(F۾+Dpvy c./Ñ?|~wv1%0 %TpZ9m"HTmMwlc#Pٳ6D 56{R r*.lu?txJsC,^ %ERUUk1)7t|Ѹ#cX9/n27j)[9!6T5VfF'Ba}JIH%;HMW x} ݡ@P,Y,6GX8l26$oUDCjf(6VIQކ0`[,% Jlk9]CԜu9~α\G)OSWOI!q.ޢ=XbZN1!@oAC @5 VGEEyy--M)<}oxGRߴzlt$i%VHG4 lz`nRBImD PJJͤ?"뢢j|)UEb-i3aw2ht8vaSNVITXty RQC7ڈS#TܨZ`x8OWҥew$FٴHavn~hlCb[8j IrS^.rL"=srjzzfH%XDBBbͤ6-5lퟳ؊gF* UpXWmǍ c32;@J[8 24>{$I]jNikS]xLo{3=6(h Jl 9aXJMR!T(RJ!u 4+z5|1{1L2 . &6Ǧr6˞5gRTPPW _$G;O^oXF2nu"R6-kmjXm}cn/X%Ɂa; Ud$7Ix  :MSX,L}w[Iu?}s2FAU9ARjb6E$? TJEW1CU( vom :z DvBƚ*xH74Թܞ)/dR 8@*Q BX·ƍ-O=pk]9'54RW7Xuc7hs.c >`x K*+3T*EA@1Ky%'@S &-Ǧ)4]TĠ64Lx-)k +V2+4 RQ>hRmu@í-6whҒ$6YO~I9lןDy3-@-,/. iMQ܀T?:esv|,.4EH5YJty@J%HT|UڲY(v2l̔X8Z)HR;ztGf|ɼeS`v;!f8UH WA)*49IϜ .]&,3b]>}eSqc*/L!ߣ.( Ae%EN{hSSNܩZ 4 5/<` .l ʡ% !@J!/+68ݞ-^68L'i *JKNin.M9H_{wmw`09 dc7EHE@ qWG٦:Q5>P"RUpAzMDr`fB41c^2AsC#܂iY܀O؝ 3=??X,Jb)+&?hT'Ӷ/5$~gz{o; .-n!TA@,c  R#|-#|^QA-XAF#Y#n#6mk#`@TnƐ=6fSc=.;4:asMc{"sIHs:A 1r6GT~guG#Ԝ⪥_͍>'u|6pyd5lJ{|L왈T#!5MhΘjru;ShTu N? &{p,ͤMK=%j ̬"Jk++3nTZ]U^ C6u_3TdsZc7*gӘI<7*|OԍZ[2yJJZBC;>5b跄o3Wo5k< r ߵ5 "PL0lB{%XAhO$`4gH$. E[[ry i1rp66:P3^:MaKcdh|L{$ii51@UL iA~ig$y=@h4# gt#ԜbkO|w?=f!X)T^(;O^\"tA^_Ʀ|b|DoM8ԊE6B6}ih|%5?`z 8ǜW,GYC7x>TF }1ݳw_%]ms|)8=z4~7O?/Ne"59TEE6iem% 13`Y&g>fK9_*PnV*#cc)OZfYKO'NBvgZEqJL[B^fϦH*ׇ3b)uՀMN׬J1[uCöMUJ'g#!߬"Z Tp*R= 5E% TVkx H|OG ?x<7r{ԖAL ?  Hڪ7NgN^_gg+[qJxvuRP i>eSW!Ӂf(«@ P+Uer _=gMd*K,@2r {RiipMؔ l l Soj/[~N0hO]v&3?E6$"k @*P5ΦTZԵ!.RB#rIu$UC꥞ⶾ|aS%ȦLfiiڢV)?xLH%nԕ)Pz 7Yb7?kf.Z:2s-H-WVVb">"iX6Η741^hxeSքu]I`Hm|#`(ې*R+r 92Rk %S-‹ҺXH uC]ۯ|p"5TP?w5%\98:N\K(۝_i?{c)RWMÈ~h2ݥKu ljSS^M ن)ӝ&#oKZy--1-zb*^P)B?WZdx}1ٔL[6Ug.^ ݨRYqF}J(*tn$vN~b t'ԕ)!وW۱gJZbQLsRIP?Xɕbӗ0 ]{ 1c‚A浺K$U Lj59?æRyԮŔH(TMS{~J9BiCMū_W^|•K:NؔG 6ݺ+/??;om)k0]qlJT |i4XAsjj75TڝnOSjs3a@Ld ؾ~ prlM j?BtSxaS_96r6Vں@]0|b֋rEiRĸ\+ryKOBI 57*mx8GRN}ZI~2TeݡUUI]oٯxH$EjsxpLJ93R../?rz lcc} W9\nr.&l7^xjgו7:ՃpRIr: DRO>;R;FFr9RGBZ ńԶ˽ Ԅ UWU~-‚+;wE@`ӘJP]QC*RQQZ2oYHݽSk몷) IٴH9wWyiB.xڵ^K1K(d+Gq߿pBtֹYOYPC%7ue@@ TȱG(0c{: ,) O]G9H]#CgoŇ 㟞429y6i)P[ݯg}pV2#?yuC'@t\'`S@eeOA6:#3<-z=;zN j 3R(HCI,( `XNFSy9jR}}QHFKk5Ssl]\%ttMCM5b4;I9[ZKe6M\|-Oc*x|y̓ [#j^*]Z+pOW|M&O*@Min06Eh#갔2׺W4w];K ov). =8J(aEA6m{< Ko)Kb%KWY,ss릺kfHF̊E"\$5 Lӟ@ȚP޻]Nޙz684wq#*6 MUx;vξdBw5B'mM\UbSNszֵ!B$T XӍ #f3SIq1j/" ROq.~dAv HSY1bKVoQmmF>T!yE o_FH.\ ]>A@@'o>m4çNLza~,x)B) 2K0Y6%_MuݿwwiqQWo;$*a^&ӐŦdM6sE1=,R1nJ:8' 4KQG(\yɂRȄw9H]NˏxeO886)# eoݻw M/ߘ<H$R>iN*z@R!+WM!X ܀~̺H1ZBm͛dVu.>FL".i k*2 /4-6MR)NYnJuihuIDATg`*nTaFҥG4J\[XP&k{ُ'tNp5%6EqĴ WENj/o&_߽lBLL$Ft&d.&Bټr \ ^ܱiR%Wʯoo W:v7wF.YTV$JbRRw\^Zzs(+8Gw^}/xzd2MN 6׺zqޜxX,رuk)Mkʊgܽg`t؉S]6kN ̟մ$ 'PaJJ**H#,w9 h؉ ⡰(Z&zԦ&< Nƈ2k6 $ͤ+RV]-TeTd7\-,yY豥+qo B9=[iQACjP[Jeuy2Nr~ 25 oGtaP*p6 Tw|}}C#|()T}~vMNob./a_O _y,,## nwRAN1S,חWw*D:axRI> ؎|I6櫔EzC>;]#c{77Uu eڈ; z{'&vtZ>f ,M5M_\_ ܵՅE(ʻکVSgtr'^:c:'! AZbqEtPI6eٔC.Ji4!KJUV&P@}X~XnjRC3sĖP*0&wv % "IĢ$C_-wMHݨ'ʊ:<7o4*L&-Ԗ;Đ8BDHB%5-ę .K8(J}OUE;z4_|o9(v11FdcxRaX4B*=T#61l3{~`(:8:kcCmUEpRWK :v3Pk!ǿyO~|\Ʀ9Օ[26@=R T^}O>s &66%"9^l)եBWGAG&#"ueT [߽zJRqs R!p*_44&pվR9!d*3oů­ hﱔn)}W&g@긩EA:I΍9e¹0?" <|^QDBjASE T+PQ.0D MAl6R5\bw2ɾ[>xouE Mb){Qrbڝi7`D8@*fRxDĕl iu0Hٔ8l51ᅅTSWS՝QPoWm/h?{Ovg`p[ˆֆ_~v*RE)-lk ie<ӧb/Lt' T7W[.E?&' 2SRe̦T0?ZOu[@*ƇTbX eӫWFX%3%rpr:T[n[]!^*]Q\pb{sԔnBEt:Q"emFϿ@ "nZE<KEEdZ觏dh(P!$96ښ{}@UyؤSC7tijzu%&ZFw* NE6fGD܉Eēw9? l3 .ƂH(_/TJA yǦ!l`hh|{x.)GZoo>q9ݤRAn}miSC1&b=j Vu%~KDGL P '0-2(nT\:)M9Q>[mݎJ #E)Րd%RD) NNJ EZ͔<=cCQpl)nvN 6qcG@ BI H F Ɨ4PUb+_m>F)i^.' TlxKlmQI=zA{HQt"q TY dH,JDT!J[M;]1Xn\h=x>6H8и;~S#I >{C'?;vTG25==bvP3 WqȑX?5YhB8sdZ63hqh"ddX,DM*@P1q={F#(7יqqr8߅)Jg 5!xngϿ=2x~$*,L̦8q4abӸ'ZMP֨#-(NĂ;q8F.RZ~*': bFjK'AƇTX B ؔBV#|>?1-HERj tbEzI%v"J**J-=J!7Ta`}iC+41RYʸ#21 nT]a׊X'΅XLzWF&D bPo:fsQ7ZāR0ߗj)'-XQ [ 3f~ 5)Ry|>P*̸Hw ՂMIc¦SYE*W2c1UC1+M&j }:1- čgRSQߍP!ds 6 -zT@g>lJ| VC!)Izv{ l[U񄒐%x5+F$@j{7e[6Xؑj[oi4RRI!tDO G?{"I :/ʗKN97>e 0 @Ib`3H@rB.BXL6r XwG}&k Q57K]IQs0j`SC]>H۷JM$Oԩp0y~f9}#b1ٹtjwߞk %F ! lZV+88`0 o-JUK!eF)40Nf/jeRןHiEExJe/X N҆nG{ ±cblV7u(vЊLRe7B4G^j|p&b̎ 3DzM`] Z07Gz*+nܘo R2*!9#eE?I&T(3*ԩp{{ wBk,ccyBt>AΝ#W:cFw*2$Y3*BEB@mi$.@K9@E@ˮ{]ڀT3ЯN:j,v ߍBȿ`!089mqu}El" 0 M񼴟۝'.ulٷ癀15ũvqQt!+PDTrcg] <1g+0B0.(PmB"%ݡ:}:RO&xA֞7f|ܖ9"8W˿{=~:gARp}'/=>MlJu=*ldK87K=`u]uheM9kVOHt"2#ZHEG+Bmo9Cz!aA"Ě@&|W_WʀMaƨPE7_R/k) 5V*z=yH#.S 5e(vkTK)i/I3Zy"] QڼLJ  WnÓ2BsL`jijz}x".t_Me9~d`q#mۯF]3Ekxϯ5x14% jwIBޥd)Ђyb2ϼ#CFy.FRTP׋6Vk޳bҵLX2>CF"b Ufٔ~)^7E (͠L~˦Tk֣?B!kM*_*5TD4P bvƤuM9Rt]zU*RxdaaڠIRgٝn7aSFIٔ*֔.-W5\72B.-O/vebFVTdY3q/F(P!B#EЂ^(vϮPM̦=JDb0lSibE+ǯw<- WOpd;XoCot*DM-fSӿ#|R3TPo(>o}mM|)= :w*d"Y`eMm˜cޕ ^/)>`8VMPTBҁT[kH " 5]BRCZBP *'хPVؔİ_p{j"_UV&|>p9JM9ᷣ6#2M??~y?}ŎH<I*+D0*gφq3##26Fy==YsAٔX,GV S)'*OQ!~E?]cVE?CUU ŗwzxJ% |n?ߍ ńTcsslibmAP705ٸzI7S4^6jA=3;qiR%WʯEJB^l;}lBBeIm=;=s3 59B"lO}每}tJyOP4B{z=~IzشAnbH"ʤ2T28ٖlC@yUӭZʼ$,Aj>T*$!kLGO"ƨ7m).b+-6"JƧDBAynAAbEt?PvKX5]@!J]DTW?qp+LLy[7,Q8uaдdttJ"z{ͩ1nKH:qL@9Tʖxz4Y_J P.j<3>zo`ۯ=/;6)r~畧:f~xrۤ f2 ؔ*&BeS eS6H#ϱ)m%T"| 6ithZEuq)&n!BTSCj:=ͺ吢(& -['}u!m,|BO{J/rڱ<=uQ`{|>҆@ͳ8lhe\~b0A,6Ue%E=o>uh2"ԍe%ٮ6l`|ƀSҁq4J+3W#Z|ǯ^XMt)>^Snki>yʥ.:ǬC q)Z9B];m ~ӧyݽ;# vlvS(Myt GN 6u8X*p0:j@=n2֤g.Okj=C*)AMP!@*F#)ɱD*llJ $=E xR)Rwoq?|xOL5݊5[nT@LT2`w8K :LpH/ {TR^bd9RWNeDA'U Jto߮톢ߜ O:\v{E0zelFc5PxJr FPHZ0AW=|ߞ{v~y]JR?WAjjjCMw^y{٥щ)OǦ Šܵսgj l_}vu<% KtVh \KlR.(m6f]Q )d`"t+-BaڎTe}Yi'T]7f٩v8!r'όP9KJydWb  X(ǦD5hmlkNGpt3u0rIQ隲iJy߷ﳶ.]ٔ=  >|"b7K n)z/=z];4bs9ku=̮V,@"aއ9bk=x/ /'H]d|X 3: 6%] Dގni6YIJ⫠Oo{d+I=q =;s줂y۳gڧVS).$0m0+}} #@td,pjI ?+N H/nR4w\.Genwk&䵚yb<7Պ;wf2& 6s-%z]!b_ ΃pF}\N,TnjEV(YJٷFqvr 3Un|K@uZ'i]*{'AJ!//-j[lv ,-^%ssZB4?޼9դb|>2KK'%QbP~9]nC9ˬ5R\&ۿkM ҔMD8B&++ҽz&g(C]M_v٬?ݱ. MDqt 6}ן( ւaYtٲصk]7nWG/ܺ̀Ro 3IM!%l  Z)%T%T/qb21Oq̍ yzH(E}+mҒڪ|D:9)RFǝ]a4 eY8Ͼx Q7j8W(T]*7V z}@jHcz#anSI36^T)4{mm%k*\z%bL&E iu?S ?;?:{؁7rD rMMݯxGg^\Z8F)R6ϦL>a':jL2TlH*UKKQF)ݟM!XVZ$rT*ٔqW;US楁 #YkTՃBЭT$ uJ_g ק7Қi`5'&S*@*) r4aCˊ`+z=x1u0)ߴhCCifnd8owT J0q)8ʊ1Ƙ0(zQsYOP`NM!*UA x:M!"DeTۚMgfH60mAq[a2QW\|Aj"\&%X Bqέ/yO?3Y|^:MM9lTYVڕ5kz?o~x\Iʦtɦ\F!:⨯LaiRA9_)KMz{ISD RH$ bȵ ` (pDӢF^qZ%H]W HHٴ/n47kBE]R'ԤxJܐR|6E.=XXwV6ɘQXZd caSذ~f246ynqh;Č+#-Xk5‚p <ӷ_Y3< l?@Pj RK%[)pg')FGXt̊5S-ᵽ=cƲT1ٔ+..u!"MUR*򻶴|ŧ~ӳs^ٙ4Ic  mm(gir=B>ϏއubS>Rlj4bXE(p$gBWni6m7*T#~jΰQHEXeK Xؚ RgBLx:RiBMObB٢ٔ@f~B!6줅C(lh Eٽ<Z6ܼ5 M2v.j_xlgga*+  "O rju&b)el,\\(ҩh_bF+>g~ţqo(} ؔ+..ubD Pe~gF~GF,%/L@`ppt|Ɔ)}m㼠gzN)M|uc-O ͫIΦtd4:XP(D"^3KLnh!ڠY"R R)L6x$%QV Orm*HEd):$Tj6TxFAELKBM OX6M) cjH$YB!͈k'TMKm6Y#c0lt!9wy@iբ)2]2'zE:MIbX,A:j)vK&N׳MyH*B`p\i‹gO9/NdSJ~v;3{x{b <_[#^XDO:Z3_ &'ؠ\"&eS*Z\LΨzBcS7xɳsVwyΝ mg0BNLGM*"](yG~@0( 9ҿ;]$cп N*䫔Orel'tiLRPZT$6MR$TjfΑZ,Bj<ی6vtbvЄU؄{H9k'sH~SuhlR=spC|&vr_YY B,lJVKC]h|~N+ U-.7aS"&۵RDuey霞)&W[meBRk2[t%GGCb/Xk94\`SPw)݅>{6$ fR*S4#} <@!U,!2.8 }N.]meקwJn wލ(H\PHEA*:]rBM v,EEy6btQl(`u;+ M"IUDQy`TAԩQΕ:B"j\Mtw?kjËU\dG@+m)K0vcJJ?(% .] G t!un.MֱkQ_XvJM(BI)R.bP!J!7 P)kyd>8菆kV*x^61#1Mm=gS*d+)^/I7A%e^e' *,vI.v*cJ-Q?S$fl1b0- G0?ly媯t{m&Tf|!a+lJ||OT0 E"!Jpj& Ha'P)edb|tL03~N6CpKO MLsq#eHC{^l_j0["$M|yyHŔ+-%85`lcSb᷎ٳa0(k>b' XPZ`\ "YXxa )>F)풏T즎jS&jK~ﰣ>{nT(~Hv_dS,!m,@jP.]ql {|FVFC*L;B,8B6?YX>B@jfR9]nTBt;"NL&dPylUu*f~Oy9\RVؔшp*=^;7m"n>,zRSę+Ŋ~]arg܊[lIV 6vQnJOBjc#|*xrr=vᮻȬ猄ELRΦTȕGZ,YH~Bb'@8<f#49J mm6wB$ZEդYd¦E6.WE!KKפ1B$-9BȻa(55S_IRvMY/509 ^9H5ԓjR6h^NMz@!nBIZZ2WbQyMgr^<%kk2Eݨ U+7 dk+%rq̧³E"ӫWçOgn-fMSѪ)Uhd%BB U,I $UZR(dbEӼ͎l Gy}lb>3lBP7V~gk7:}sͳ~R`=[77ZTd8}ONw.Κ Ё(ҝl`IM! +-|R К}wÑۛy3[okqWM(o~LL.Lؒf2zbЏx\ F©Sq+_DKVk"j6 &Bf˺#TWZRRiA;m+&%|OjiM9SI!5[n>[惤x]abEFZWÖ  nT408zeRiȸZWG()fQIs+P^w$R + ad.^d"ӂMbfx}*E6儃ctl[>7<~N agwfׯ~xRĴLMbŷ^^Zzb1CA'(D0svteƦTCⴅNԡE@*J|,8' l:F*qkIRQqx 䡥VK)dO[`;[KBMS_1uyo&;آ!#<Bvop;FtP?"l3?t_wo/;~1O&S؃K,6/ohjp?msn"ջx,)!nT %+,$V-NMBH#Qt1Si@v (0"ؔ 5̀\ƙuOQ, BtxOAM RlϋăԈ!1ű)4Tht3mZRQdЩ` hmv¦s#>ma > l?zNnr:w8 Fnr ZL( OY ա{ӊxY%Te!*4"M ﵬGRg*U^)kCw8*!l dB֫(:8 s׻%r8PCA?4i5O‡ 6+O_/NLy~H$lW_߳sūT[G ~{jXt3BQB+A0l *5I},D~>q)03фJJf * X5ה6`4lJmr  +/#S?WJ,[ R{{#قSq1"Rg )Ԃ@ >M+?=\(nRdE3}KD"Bfsz +dc%%,.USFW<€ne?K&qrٶ,s~~ Z A^x6P(x\Glfl^յnն&GO~@[]6{씔c[Sos:Û=J tj|>HA*O4]vNMi+cS|DCEl 6̙Kye5 y5Jȯjrfb;<0Kr}>B}}bYj.SܨN*-}QiA* <W)_ H,Hr`%%OƦᎯ?~^-$ #6G~0)r2z#ݳ`!N&>oeI7 6*_ڻ{Gwя?$'9\=CJ(`\pM:]'|8ҥ0F hI qPvlĉ(/::ȷ~Hq٪ty%@Z[YmfphxR0lؚd-j2mݐiyښ*H%Գg=h86!IOR6RKBʦ_lʏ wr.-_hRk*OuG"X9"c剞=|4kxeFuZ?nȐR[,6G&| ;Y7nj>T7\^NB"Uԩ*P ,iy1EwTQ$4ceE);G(53x]{68Wbq'̜v-*hikqr'A3݈3lN@DxC#cUZ\tgW -;H`מ|b[Wz-6;dK(Tx1N1dTa\nD=uN_{.F,MtfIuAur! G\o9{! ﮖZ׾FYԸ+Z^\7 O%%Lvksk̫Oo#@Cϙؕkb݈Vs3iӱjQĤRYY鶢ygN/=ūN];04gBiieIs_xfCc)KH@je盜&;zE0x=FLbMM&IqR b7t/S+p,Rv-.CPQ)TQ!m"j(|A .'m3eM쭚LuƬ|Px@1e Ƶz=o'&>(ÜӅmbA _ūe/H_Γ,Hr[wkLbrTViyX _1RD$I@jLa lF۰P`vd0:z:H(D*'&S\oѡ!cSZ 5ZLT Ui2gMO [I 6*)1R'&½ |17ԭA:/7QeWzbIACM5Pr# u"t;*\9B iQGi !E6PL6bbɲ)ΌYw"QfMxD{feҩlJEլ!jj PZlBRLœձRk<M2FB֨D1ݨxs \^IKR#Rn)f7)3py<"t7_2atK 3ħCd"Ӆw~/%޵8u6aeS7-b,æA2*+2u ryiq |x/V2o~N|+H$KXАWSWj&E"&3ǯH`5! p"?*ik93m띳f9]-EW \5RM޽r]z}ptd:%Q{؎+wYUؔb{K]Hh o!.E|ˀe@ṞMkύ%x%>p@͍ s4頼 hZB"Q BæP8*[kg!(ۡ4⡸&Ƹ͋?oi;UWnщrxON^~jtgZdo)Q,}rj#P#˲<\&UG~Y;B_zqξJo*5?_xp|陓.Nf6!rB΃(PB1l Kד:=fR] I7Ƽr[I'IxR*>^/=~()ԣ#1:?$MQT,qz3GuLsrꇞQBŢV$F\3\x XL{"Yeh! byXWYmv$~&C5+MMAe9!CEդ )|v@:2`駺:;Geߔ/ 9/|"ʪBxKֺuf":/E7*74:"̓ I}H *lcyR ᲲMWPfqϴofʊWo-bymmRdH{S1DIsV 㔟9Z#~q#Tʦ{755уVsga!d#PcEkz:,{G^?w*m˚P]M aVj)HEĐ *u@![=nwS= N=1xJuX`Sd%^p'MQVTبlJ{ T z^Ҕ\ AŞdN2S(Fy I/wgrB&Mj*J E2 ħe s*ʦ,92HEzaTTtZ\r 3cSNd`PhxܨW>}~qv"T¦opwkg?^eLM #ON;q˜q: f¦"te%ӰQ)*A* 2k7@U!݊#TAk̏RE6j N,[0|g H& # z`#R+$;r }׺ES3qz=S 0d̀Xm+BGbCP*6@ P!׬t8J`o;8RBm!)"[,~ٔS Mss$aRT:JʦHHR!:.Ppy>V+HЯ ^J!Ws+c\)c0j4 Qa>qWسfZ?ZTDAHQ ܨI B {sT$y+Hc|LZ]HHN'irE6}ww Rѱ:"Q9yv60@=MIl-l3lh\9l U)H^1eÓ q¤gQ+S%Z TσS.O5sV +ԤoVCMI0<|gs$`HƍUjjwXؔH5ok߮-.d]KwkAXXʋU`VAnؐysd?' eV"MKN\/ Uuok#n?#7R!L+tz?/ָf:v,!-ba&L[S/,>B 4n1g ' *y2]׻{Q`bb$ UjW8o{s=YnP=BȃOh6c TJ##f X|9 <5eI]α{Z[ɶ^/ť8FfG, 2^}~<u_jx L;|M ԘӱQG wM^o$ח4%5 ^PsQ##Rqpv/uL*ee"AD,V*ھm۶_?cߞ7SB\g_=:9Eؔr_ 'J߷C\ fCQm^?46w $Ylm: (pc*{71<Ftql2K+-khXQqB6 'M9 V6-hLO;jL6D!!ƃnSiwxCF CV=v`(sfjx+>|h/qQ{x3^F3l 15dj(Ql *mk #.Ig.P!ieHL(HP؀lBj(~%)~)*8=OĄZ_/B ?4-*׻TUe.+qij (Cnxsk5Ǧ1A*(N ?'3;JD!uמ{on _n Uzҟ x{}ٕvFXbb_RW^W*']1χP0yRX$('cJrD2=^˦jw\_~;.% aE V v聩CyT\Lu (VҭOC:}\\Z8g6&2vWz@`)vү ,fB%( b1wsvou@Ppg닋"pn~ɰyB _]ɤgZ].7 ?M4#ľ%$ p ))V"%)q9>~Gj y ʠНorFI[Gpu9ZK]I,1NjpV^>oRoa)k2S8AJX8B%i-VkTyEjD<2>il.E!A!%H9(9H@,.ЏܷXZ}bs^S4@D4LWcֱ҄YXf333CӦlfvv# \Ifeݯ9??s?8ywhčf+B0RHF],d0P("Qig`hzf'9K@*v(zM9dǴ/8~ ȦTE٫j{"^K 1CQTc0:\n㴩ȀwKeڰE s O 3-X28BZ-1I4OWMhBΆ;;|Bk7ݒ0!Z TB)H櫔^>pW @6-i` E<Ųy*5/<{ =KB>i!BFRSRHKG.cS*\.]DkL~MԈ` ۑ]) Aj&omI] !X񝏞z~RdRhYMno|`8}'Ot=: .3*P-Z,"TXLv;3%%T7E7VB,tN ד?=WdSjbEkrQ`P$QH%>&Ze҂|i\.43pmR1hRj^?Rgg#jb¡=0 a\+3RU nTy}>cc<0!m'TyVHTS ԪyopD),/-A;(Rtsn B٧8E*H˛Ѩ=Jnp"_ +R/`ez PPVmn)Ͽa(fR+TBg%EIyqݨtTLGf Ţ@VKk$w@*eS@(8"Dݺ)5^#w3XziDF"-%N3YTDucsgOߍ~LXXoZ }|wooiE2X)~Ŷc'>phM9X? ,UUejbthW1E{8]a׻ R3a96v?6R)\d0*#rm'̺fPl!O] ONMt5UJbb8;!J3hgkTǎ=9ә5Gvo#݆0WxEgutzoHOIȀMK Gz`j˗uZE&?vz)@<~\7+7\.c @"R`x{F+rsI V/B@jR6J宻M6ҏ^6H:AqHǂHZX8ii߾erto`f7YzPJ9ץnB>pܼw /՜~Ood|cL / 1P"HE9.IU奅1h6π`@jmUeߘRaƖؔ*Po6TYyl'TAZm1fPOEBvvmqQ3NM뵅ՕjjbaFJM>Ȓ|Xٚ)U{;qe hB^PE*(.\\.+,|8[ȦBAڦi\'njyRn AYtNN{8.e 9:9sA0+?1+ bDjbsM^vIezVU/Hb >W`s1LHQ] /nS/iʑYRfZuRbrtfͦffR贊F%J:7*FEHBdF $*O Hc4f $a(#ĦT?lJBM#D%VJ5C#Hs=>@c{i}{sgPgjˊ^~5 !:\HpC*+ʦ2PՌONOMYE@jYI RSPKŦc~bjv1ݑҾ PRK=]L{?JbN Vµ5dt{L5CNTG8TBHժU6Ԕ>g;YHNac0J7FT4e G;w.22BZ$VtTB_:" @&:2lթvm۱iCQN;MgM/5lMP)t :HF6-5TZ x<LEztU9!Q\'RA*W}Q,=olJu5k\] .ft_WYmcbqjgg1CvnwMgPk=C{9T;d;܍BjAdvn Blj,4ǧfF'reӨ³RK G7HMEѢyR6V߹C7A$X"=(F/8n ?a\(ż: c;u*9CKBͻJzMf\ CcdqUE9 x6 RӨGRKæ8]~}2>/bX }NY)1de 1$4@02"ET۾yMFcgw`&LeXM[ 跻l/v*8QOHBPO6T5`2] T 6./ݵynqVޱ$}Cl0/Bzr  I;1XW,%RXRhdZ69]d4MܹCjRBENŦTN; K'߉UlL{NݕN=ž'>JDX$i4VQΑIۋhbg8t/ 5&~(5nlP˘F%w_̠fY)RiTJDl:;W@ajoD.@м_pUiis%QJtf%@yW+qP;*Kq92E ue!l=[6>}KIqQOo[~?cuTRWWt^xTj42TըZUm:C*&(#I 1+ 5?#_]6fCW%o]9}:? ޓ=t䀳+ۻc |՛;\#{DvMѺ~$B}CbkOx}eT8@ ZmyII_;£R^3VR )3%Tn2&枺L,=`S襣,s n*E"bE9iE!RJcXR&ڰG P@ue9 r<4y p'JVMQ8 j\321sJJUIwP#qU,+Fu]bS>pit;J?8o8"!mFn*/-!J o|1˃HJ"`D,(6{>P(2ӑ 01G/].V2; ,!5)"5Ċ\N:0`W#Ҳ,)p,JϦG>\p B@R B׻vՊ@ 026$ R"h\!cennnbz[?9bha^zej;{,6!"lDv(*"ծH`:ȆO˦Txe rO54'̎Lw6;ÓRdjx&t%2tB󺖃{vsĽщʣ4ըO0EF}}uwVSͨO4Ug8W2B1Ml>RB*?X3- 5憜-DW(ԭYAcY ͦTU6RV_ 4yǦыD4*RG767To B(rEo="B*)7E}]Ul|JI[۬H$\)  w 5*Yהa*P NP"a4.W#+*2=gr{&aSF4umykUEFn5̡?>OHuKENBjN0TNLsJDu D"r2ԨӬYd;HAOzv ( o1yœ xZ\LzLQBC.~L8MTx˝W<6 2YӴ5DuMG({؉> xE豇(SK/@Y~?O fR~?[ӻZz]c] ۜDO!z$g.?*aQ"a0\V*Z-kwFgSs-P+ھd.x$OD6.)UفIL&iRQE@M0Ե55~P:Sl**֠q oWoU+,vG 2ؒ}Px\  bQI"&K(~f.ת[V4?̈*2AjR)^Ūۃ:'ӕ܃'epy?E'dPH(X߲JgLzowZl_ KSlC?O:T"K/O<`iW>XHwES*KUbQ!|RqkZ$o;\kvB*,i pYKqHV*-*8wfצIMCPF'޳)큷aN@yiuZ|E8UCbt j R$[.[X}  5SIa~oX~_}MѠ_-+=^owۛ<3 HMϦTW: Dk52v !,P6V69rdĩgBAfqpY6CIbt|f"ZMsc?C=ʦQjf-Ө8sdVh5*6YQAXb9B͒z{#?32e >IVlJi=`ӨPFH?!0Obw|<*H_}[,ME(Vni*wUor!\)) ]si 5=BY:OMoOE+VP{l_xұ :f/=N, 5+Lop) ?&T,dצ@4Nf^ٴvJXsW9]&/sXT RaS*$`v-Fx~˭SrX (aLYQġu5fg;؝.|X  '!էQوT@y5|B8^J twP)L"pE}m8=LdSGrTdzil5*@R ssӉOpi KK'qE],'iP hfrjEʕhq2j`bc6TW/(&#leѽ'{ɦQQHE$V RgsƧ=q9f"OIB:=>߯edFi R ^(x`SC4ݧKkRy<.)N)KQV)+KKpi, NN,ŀTai$-TԀ74cKe(rLn2.pLbvN$"yQHe,P-jѾހ td,7{UX\aI`ݻ k2K.@?sji\N1A*W(8td3^¦Q!KXT'-!IʲR@yC`}J*tg`?;Jfx&GB6gf/rgɦQ ϊB@@jRsTD< |O+EϗJKO_W!5”B*8A%)Ml:i}pZ/19i4p=CeE֖f$bfL 3BݺU`fTʛP!1Μ!'dR*Mq1% \J!_Q_4N;7; H+'PFHE@3/ h\dɦSO* Uk*Rim˦u5>XWr9wmaӨ(j ՊҫQ&[)m O,"%hTʦ܉) ,("v :D_ wәI™|*%HGR#86ͨDxݺ9ٰ)V@x?CbH$+EGO).&ǧi?a F Vvr{C.FEI4Ri * )6|tboxT)x}gf4"Tls\?>2zuEi0v\Tˆk|ʅBăM*KK|>?ؔ&]IrJ O_Cj*B)۩|Hl:a^X1l:g7xfӨ( ZnZ6,(ԇR9{{F *r u) 1<\J̢‡S{zȟS'}FK2# d$)"l4 84B 5ӄJ! C Kg'JV*nHJ_Y*tR^q=LNfi 4T}鱇k>3/D I+(j5*`A<RJ54eæ̤ '}f# k%ŧ AjBmm-ؿQ&{M4Z+"HUhdl7ZbV&̱&sqzNU{{I 6!< u) J%T(FZwmlf$5c67ņ\ Ef!J(*|"QH{Jon Z -!^:ب׺\!H) ^Pt{܅ WM'M=ÑR$V%;]I=@?6UGC`hdpOᄓicm_v!m lY 2ըIJZDB.jR'-M* n4L999_/3)C)b! eSTp8~«T))%@00ol)f#*ZZ8uuIy\PװM 5>ˤUeBpjzr0eOHS3f\iJ{!Bԫ~_k5>gX'XYaWP0X@(xbHb"#- Ť7*4Y7>4φT_1%͆PIBO;+4`zKX6]8;=TDFniFM<%=kTUX%oxo4*6H=#Ri>6jSiEi &j2#K53cWZiK|*d/ֳGXu;b⾼X4>mU|v LBj*BHJ Ji|i6lPC|z{" n4*_W _5jmjrT#{OPBPqq]zΎdw,̘_P ܐ,/`㝜,.,DֲXmR+)f$T]uaӅ|r%Tv%b%2r9UeytUS+g.]6YfQoY?T BjR̙ND,ZQH.4۸V,@f9^vE;u`ll__SXFۑPo=F,FGRD4&TRkDHMO,|L>/k5ҝ\wft/MLO33۶!ZRyϦQ%>aR68<6zR LL*1[lg LdӨΑ6{ [BLLsM*J/MsB*#g V$//.7_6TUgڄYe8Bܡ}T+x^?&յkӧScxNT $9auD\^R aXvʦl~1:k9&&~_CH<*`=v{j+{ԀT!1!/RiI=13B2Ezz^SE*eS2(cs %W&TpRmdٔ$SQ@8+ jlb% j**PGpG4/@dʾux4#id:iMNaӨ`sH Wը#Ҙ. aPHe:R;8#MʦQE" LVĨ1 kRFpɱ; e" B*iE) f9ٱiTH`^92:/>{/!sNT.\=wgKCmwS&1%% |)lZaNEZ㩭x#SNNX ¢1:sOlB+N2䙇˔ʜ߯FCkcMH!ryx@UE O*+/vy jEef_֧H U协gnJΏP감 ik#lTet8D% *#H-.4TJb ӈWFΌ]fIq&BI"@lHK,r uػamP$7>5og$a$YO!|&}a__]XW=5cujD?rKF-m;ēmpّƺ偭%A*Fe&O|?qy,&Bjl̦QE Gn z d[$r[e2_("!RJeŅjjcrcӨp TkpxG/>+n ͍wzfH"ݝCJDBH0ZEv2y#*,$ R#pu( M9Q<;ؽ?yc.{\R t J9@j~iӢ;"I$ep3 4%Ez2g%?H54U@1Ә3iG l|ȦTMȔMiDNشP;uk5jGO4[mEE`ą _( ?1Vl1[$lFJ 6rSO;NC&WzG^t e#ʮqR  n/Q!R>m;2Iѡ|R^9+6JM" +_ΡuP7¦LpbaS\}Z&^K\(ۗMB,g#YWhnpmȇ n{NA{:B@j^_KF#:>ɍP!_:Ө*+ʔr`ưp9"&&3N[33M8PiBjё)R_v9;1j?kVk7o$!_0PWUC9"X0' *EyqaKSg`rJTx4 茟 Q/baWc79߶ gϦt\ < T,A:˰HͪbtT ;&PZiwypH}xVwTI&$H`*Wy{=>]ʦT}c.)4;3c6r8LfZ!~6r{{ؿ|Bm"O׏8 RYw(DV*,VSC"戫rB/c+vYKOT,_a:ϑpJނ(f& RM\4:*uZJ!l+k:i˗#7:(,cfͨ(PfMVQWߵ <}P(|YDH9^_eK b2cba!Ёњ{ZMB@p|rZ$;A~QfX(2dFBfJƥX1ftxJBj9rj]۶o`4nvtщqaӅ@ NBDhD.֯^]g>d^2^Eش9g6 ٺy BMc[TzMN$S5*@*< U("Bh\nj Bc˝Z+ ZPEQ~lJ5e-Q+4jj (CFx K6>0lnZnBP۽#XvO γHtfwMNp} ıx {+kY$MM,?<:Gx0bu >!T(=fI(3[Gfc7-o s,YɏP@04>5Iːyl. tP*dF|`dRZS*)BLy54${Wʦ(۱eME޷?<>02F4ߎ?[=OMUR![QZ~*d])hx.rF\ 8NP;H-HB* cjTbQ* @ 0m ??C?}Edyho޼3I[P$F2yb2C:}oݷq_,BngH-$/ApHPGb. ?g#'J"n[x ^NNgv{S%7 b7QHæ&ѳ%SU)+^6tZnwOum׶a;vi x\@BA:sAuj?:|G.7̈4H.Xt /R,ʏP!@j}bbFBI= fNԙ3Pބ 0915-Jy>oxtjs&iBHԎ骺EPq:4 tZRn #@BaSZ!h=۷u}x()Mf2B!BFŲMV;]^E8\P1Ӭabu7Qf$/ؔSL{z#XBy*}/ i~ eFE|\pPH@s9:9_cr0 ɴ@ ֺu_1nvv1H:Kh \,Nb 9h9'9~C(߸[V}P E" پvݙMc_PLVDKx\CQD"NV Xdc/JJ8=abGB 4l7 Цu?ђpgVQNG&c_zlTē!p D 'b3?QH=v&w~ m]TD>B~ T2~"&fi))3L++\7\K!T r(:Z&7[(1|l<$TF;0r:9 S&`S\k}; 6F1t w*KqqsаeZ\vWe,؅G)$>ȡMUըiKi %'6vA4CDžP,B6[~l ݑLUFlPy1[ RP{qDo5E]*.$ X~Ml|hUS= v'鏎|>{@ORhwon\Z~H*HJ/>hаc5+0j<Ϩ4a;0!*\ NJD0eR,rYx@Ө$"1 6ey 2!J"CpB*\t:6enXߞsSE`3PP:q[oZ??wk|_ZER?14pz=>ঢ"g(?;]rt ORl_˨U(؊JԤܾj^^ήC*FqlUe PK *#Ȫp02T-Holݿ{Gyi~30D4 ': SlԃMq[wzvGbS< ie.(!7Ͳ9v cu+dv,CO ӯ۹9M>' 6MT\*4>R`wԀ7WJT.u$5 0K2S_ŅI a97?OxJi~Z^6*mWVRbk7l'R&(I1BH&o߸GT]m񯯿h~q BhD¯?Ȉs}!#t՞+FfaTX,.0ZZ*M=>eDGM Q&:]n  Hщ3 l7ߞBQN\P nT^By%/tN 8Sa{W~I{=l5\FBݽ{wlժv2̏HwRWIi>wdΤ8HMA$y+O\ )Lhlvfcg&ՕFr`N@*9<)A|瓢S"T ݶ~vVщA7F!`*M GZWCwz,6{1 3 Sg^i؆~(MC_Tǿ2Dr%+N6 e@@4{HA![('l/E$\@ 6O*QejG-3XxzJwM֮՛#;N"25eD0;H|>O$!M.Rbі5<ʆ[w^z% H(-f]} B}빧GnAa&+!"=4w 61 Ra`jj@9\. A.wi:\ⷲe67ٕf.fVPY\Ƴ?}xȱcmۄW aoioÑ47F+E KyېjɜX)zu OGoj-2Plp2{b}V 5MWԻAx eOM9dBށhEM-613PM Uj$IȤK瀒"p92Ddזw(+-|(ǂh1,oAŅFb1“ڍkV|N ̔M3>̜'LϘtI\F~_dvR$%vLqP,!l.c2JAb1F)Č"a"@&-`\.o鐊sa?rToo4KBMeƒ*_s+]];/}nb27&(H)XMbpU_:wzz_~ݛ]p0Ȱϰ9CW6T-#P( ï?/JG'}ъӼm .X$¼Ɣ]y\ )z}8 lňP<"IU+\E'Ip"-!0MKmnbѳNVWM{ZTL33SpT*x~ o| _4v+ i&ƀFuhkhKOΉ'LMk[KKlvGpP3vĉ}43j[vBb5EIZptUItΘ-1leS3p`Сewi >r2P%E>ęWnry%He #Z5nw,VMIP2)Sh31faٜ4ըُҪB}ÒUurYB*EFZUL"T 8􌅎jk+()ɐi5:gG bx}$"FRIb)3gqQq|޶ s)&j,Wxӵktp3bLV\##`9DB!R& y>}/N{o)cVȂK¡ѵ55U3R3>h(_4jSH% ajRPx}~73wvlHTBUn~ZvWT#S+Z,1ljl4!)q.\ UڃRr/H_v:$Q(^ X'=&^)^-(+x6t )]^_TSYadh/`[֕ɦ?&sT$ԕZєT.{X*a## :])1E@h~ӉD3)ӉuՊ6?ٓd/R0 ȶFJN >9Ө[[:{F ̬ 0nl"L5jvFYVJE7+k-@u Ru԰DP!p'Ru:HD ==R鎧qK.X%HᏛeT"niuRڻq#sɞ&4³ExB$&Ŧդ"5B!˃}4v I&'mi}wnvx~ r]UWYW]ug`jR*+@*Դ,%DLuXH%ՌtVpJR] 2bOEp)̓&Ħ-- s^N%襗<;wJ`S(f…Ȗ-0d,fz q] bhmJ+H! :mYq6[ȍ;kS6z~ʢyN֖$Jgΰ-q`/U#ĥp$8rJY^Zr{&g̈ rL 6@j `0hsPH;mp0veÑGUW#|x3=\^ o-J.qje>/ RT"o e < @*F-{?:5@8@*,! Q v_fcc^0{ 5^K`z]/Q̈i[.  ԼPfLvkV4QRd0 >82\['/]cw!8}+3&Ŋ{`-Y~vG2)%-M?EF0fS*rXv <)hѣ;DSz޺5דN',[XxO =}+,vICZPJS&3X#<~n@]"KVv-9@;PaQѪ8j6&yѤN 81mBĐ]4*l=7I BVS<"1lJ4?jq3m:lN 6H 8 W3ዅBfsNN*/)F 岮F6Œ0Y3"{0xŖJi^*R:x+մS>j!!Լfx#$<%P Ri5*? ID,T RI}U7{S%!Bh&U#_BMI8ri$yta{6cFe! @*eUc O>aݚ+o{)HpT8@ •- 5nt;B]akzbNL)HX z9JAZG1ֳ2ee 5K/k`m4ȳϊjB*ԱY'ʚI";7nPW B(tVi^WE^oj28Ę_pBjv ́ ؿR-ӓ@V5ՌN)֯LulN;,DC.R,!C'KHt^" BB*1X}}i5j?"I3*1vT'6-A"Vx7~<02dnx^6S |@OF.:_+7~Eig)æE9iTT$6T%?W<[ZZmWzk7h`L`WnzCntBםK7:7r&g&J#N+R5*2L={ز":@Fa,67TD at\!>FW)v})m HHf&U Ee?qxˆV6=uΞMQFAw ?1?ywݽ/qF;`lb@j(OH%dZ@"Ϡ18.Ϗ ft?ic8jskXV\v{q}E)uX9 `a V&/a~iz&HKÇeb5ThS2 y9v=A˳@JUZ\+@eϞk[|_b ML/"ZOmMOʧSP. !RB&|!FDf 0NY0q%NNSWqj?04 aZb!7 6l6 z$1B`]wy$gq FI%LWrqL8.-XbEjRZ%C kj@HC#6?;ks,uF8 N@*M`H]Iiq1aDyMnQ@DB8 HEfwLTZ*I5#*|6L!ʝp#Ȥw?!hs[x<$#x4j!Ģx%^)F{dDB%lz*64BGroyC[7zW|ę 6@0iMB*kڱicMY^\suZ5w?xq*A TT\n6I@W*`0ztKbǨgBz`3G,Y==[lJZ0,CB.ϝ^޹S [aw2Vd]՛'K,Q+Ņv<G\RPM^Iig'jYƒU3.]O&D|h T^M~CTREWh% &^L,ļ>8/-2YFDZD \ߠӶ4{|[]~X`ΔwG{΂wgmN]i7ot y~n$6!MSTT~= ;, K#s{AjJm+7;;_y#c, fOz#dF$3,R5|' qDfY'r Ū x}%mߥ\44Dzoիs/ h39פG="yÅJXu )>Z(Mǧs20.|=SPcGM*u6KaY8DyVDŒ*+yʲ?>uɕG<=.VҨu [WbPו+ӥjogWr;[ y8Dh:Gݵֻ?eWfشrۆuثTk^9zգ'-yݛF5o~E*!u@J#JDaE Nj4*lP x, KT Ԩu܌ɢV)MמoRMLNw\L46r6o&0 #:V &9X.,8 гo6j4)SpMQ'׭t§FP7HMJz}*!`s䤬011wT|DOSh͓-/jb-X4Wdw򺇕xsi\/YN흜*),,;gGS}Jlg/^Cx??ԃ@ᓡ4Dxq !滒nj٭ .Ik++rĔf#X D1Ga>ӟ̀P!~B ڵS/[[9lJXDrn  gpFMWL*ABJ^v?@*`]zi)$ki0sAjX6S&l;.WMe_BpgDL0p6z}t(\Ns89UȨ)BIJ_eBXB. W?u2J v&X1\f0@F|8Ԥ((+[:I@ON/JHN ;9ƷnHl|>i-۽v*ԓg'3&?N Jr/u}qNL1IUvwj\NYIތQXLUJ@9lS~B'%H_Fyx)(nTzBHڵElJBC*.WH Tb|FVR65hGBBؔԾ0R4ٗ(NpS1۩+O21`aa J.,!a!ṗdLM'%CK.duGc}5]wޥP quj&Vˮo}RmdJU'a'߼9L l@E#*1VA BҺtKsC 6=φ߆Ngg3|abf)Up"~N"_XlF ܍RQ,4Ym_gaK%͚cpmHFASCؙs8YlJbȘf387)} ]_ #,O*f~磬 0YPcMT%RJ%p`V.hiaODz#ިUtBoJ'gghSE9:HHc7VW.Y>ݎ$ḩ#j:)"[Ak .>Ջ޲cPX^Zn㺖l['YPs,v!QX6y6%n*+G2/ReHHm7o椳8]ONYj9|X*~=Fb2X0_xed.]vH̓MӨ/ 9!T(ǦTHlȢ ^+^+K*| "ԨٶШ Eenj4}Co؝.LN-GSA⏌M ZkqyF]V\?<<6C<9G,MB!#hț=yԦyʒP)9*j^P!dđJTU8F#;d ? ؄MrC6 GO6[A25<.l&$R}ݻ4RR[¦WVW8Jč5HT#cH9Xw#.Ns˦>zGiE!qNI( %Mֶp߾lJ??Юmz@ՠ 7obYPi BҝcLiR{ G|T,6txj&f<>3g A0ZG[Sij0X [Vg ,]QB*h:J?1JsLw_z`jsBTZEe3Q|U{")"2qj'vT& 1  e.k&u36wujE-_hUUeH6iԛz~釗Jm) p5Fp$McH:jmW^R|ٗ|wdbΊMy<kWܳO.OM8 e>~pKK_'gn̤(!y)2X“&bz+U \.HMfݑFg'6eljo'RH]C>坠Hwaސ D<G($V8pfgSf-c~%6v7}55GحDFʟ*{ShGw?||!y dHRl߸K7 ف=.F tUS,djsy< 41B] ^?4p'GqPOL͸n1CznNB44*3LtEϦ͸ިVlG"d~I  @*%w{5BI΍kW|Ï'&,LE;+I|>dԘi%q(dҢB E|֫H"AVvʒ{] fhpdѩl?WYv uUHJ6J&ڲzj|ieRsϹ\¦/?Hmm?zh*$xZ m+V˕n )RGm'5*%)'3 .!Kj9̋_fw$3ϨٵRB7SS0~PTC6śFHuk>z|ptflӅZ&tYH Hm\~;Bqb楤I)r u^Kkfk찪h'Tr%iT|>Ƞi5-+s_mGq7ظf%BcCmufX:R=hSzA?vIX%,^&EH/a$>.4hz^}p{G_kK1HçNiBU'^`A"RWH +jop8&>{BB~\xȥQ} J sGGeC;J.'ρ@ E$4䋪RߎVxVt8T `=lÑ8y\ >#!27V=w  -7 0;$XF&%@9]I:#cK6eQeO_&h,&fzRnl ج,~p5$=|#K3jTf#R)1VQHEW*֮z=C`Sf 1EhL̮fItgPS`R\6 T7@Pp6/  <sss{X=?Bm)Z "vq |Aa(,) 6]{WͳXq]<8'/`ת*Ny9'Z}-f~zGTHKͲ ncUWt_}ϒMu-vn:z#6z@KADS=^_ 8B2_֤tH({X.*Uv9QsI'c?QHߥ&Rde6Е+7N8,2< vԩdpst W*(7H- 붶]{3B";v ܸA\uV\mp·w I/4*i!WUYHu9]tr9v 9{|HN~<))q-(KBmI' Cc6{N 1US$"t/DEzIHMۅω<ʤRNVr wd.{<$(ȧۮ vw8⪊2tJt-Uε p,>VbpӺ/=~xUScgwos R}OJ\iu] lj/ٔ zƞ|a7#cN4͖Y_V"{#1kBaY*kO`XV"By@jNPcc~LK1^+D:y=j&lѵ.4= RQr#F @ LعCnCPBTB*b'C I u5x{Ӝk'I%@%J!H~ 6iJ=pp2Ġ cHi4e.0)B8[SjqJ ={[3\Wlot FoH贚\L;ק-$ v$v-{}f)xR$JO$`LH(ظfճG^lz^mpbOlJuyHwd;-Eٔ/@~_6u8]Q@"/(XHřP\!=D?TB!gpBÆ8!D`fl i[um:'RPT՛/XBmhHɚQ y\^皫Bim6(C*"p PYi8,< VWz߅솻i4ի]&5 }[*B^:"́ iخNr.w^/ <+'iհI C!$ hCC,F-$bH" +WQF2աRYqkWmΝտVou?>5j/en)atvhA73F4%ψ;sy@?’})~ڲ'[ypx7߹vϣi3!/Újjؽ}KSSǗy7B]6u ~'''viHLjҨP7ؔ0*T@ERS*]L$IP I:uR!SF&zk`SvÚ//\ kH%݃8h,X:s[] Y T@R|ɼQ MӾ m94 (ŅڕrX~}M5` pr]K3ZgwߴLmI2ly޾ I.h=DvT4iRHEV*RK Q z]"ezT*nw;=0Y9j1󅎭[ "/Dž2*}gkjb# N)-e'"HRdo,ZBRD%*2 JRN.aSTj$bá,7*hKiMbqyʊ9=fá@0*J z H[6>c=yg.]qDžkqPmoW~cܴ'.KG&dxDſ^KGSr `asG6]n^~eϦluӓW6Y"@u9H?džė_P6 zFሺCr,T>@*L R*]&'#I 5i'8 ]c!ùz5r*9y˥n7j;JfyO YV!?BTÕb@FR)JfO7 T\dD*@>x҂;LNɉlz& [U?A_hfDzdry6,MQ0G`htJ:4Q5p5dy1#q J%jp"Vt2Vl.nwEF p(V*JZ״ mmO9/|ԅ˟8<6as>ZX0;7 >|=;I~=CCcg.^p-S*& xKyo+ϊ @1FiN ^ Jd#994\F u4yܕ/%UO~R^/R qKZވSNp>ND n$bRe[C*RB.kYѠQ)/,/!,VԈ5$1RP riBj !!;.BQ Yf>?MؔdFݙSPS3)}J~1c -96B!D!e2p R! ~r7sM> 0E,"x\.)/nHG1ɥC.&#y \TVtl(}>RYZ\~j ڝ>LJ`FA@,!BBF,Ž<|c>9x9rFlW&|&r{47k_ac}A][[sm3ecFH]>,{H5F O*yN||ˆV 6=} 9[6p@Mu;l@OO^)y@˯;CotovOLM#F ށelrl'Hj2dP(2#BX: VW$Szj~>񱮅`bh'+]3! ۟{"r`WH/޸AӎN8yTRbCj}CtS)KBa̬@l"M$& 2wo$1@*ժcSP0DRC V5ᑱi?e2-ZAhXc!u*sH8][sgvvX HR%@LӨ.2@`S. "3l,L#?fwO~Fصu =m_zBĿI/Fk0wa79qbأS/P[cӆ4?7, `"H}7 =^є ` 03{tC>M!(F/I>yZj yq)]HZ8WR66oNxȹ޴_Ⱥe}<7i|\T|L=(RZV-{qz?!= *BݺUs˜4,:awޭ{DMx6XD[&.h6J: k9eqt)_$L"nn+.4 NL~vڗHt̖ZQXn"*8n)!'r TBjMI%zv\#&H‘Ml'`4آlNm9"}J 5 TPl ɛ7ɃɤsW5U7s iI\hc"P =_1YY(H=",EL*jTON*. ?8.D 5c2B!<cplaw2 :urܻa?拇*).xO?}oTV\ 3& J}{s ~׬Zov ^BκȨeGNpjߟOzUv d-F(T?u~rj3DO(ȥ*cʕכƊy@wM&w S& ,QiaWHT>8رůJHe%c^/Hw8&T9 ydn&P iC&Y&}JT@jUHTh(P{@ߐx+)2lzStN*혽G%rҧdjjhf*=y]PSL6aTZz6eT"BZT\%2[.ڒE B!Ta&l~,@ ^CM1Oxylӧ͖P0e*?mdF0&=zIj`Vy]=Wo}j!I%m>B~~1uwWԶ[w~svNO?W D1IK4xȑ->"V\A3""gu(8L4r"ѡ9iT-ޕ +v9Cz0f)y܎K!l+h,V?^ի>^18VVLɟHM? H_=D1~c!U*% ښ^JO\7t)4*C!jB"xt8%E"3b=) &TSS]ueyظK>˦QEnS5([MZ,RJ}%!Z4D$6sdlo|r^rec=}ju WWz#Ņ|xFgyJ^4B=ze-~eIܿg(oG'fy22aS,!5P(b%$``Ө CA!Q-5a[(`1 Ðql1o+ދNT`>Ò@t~xC^]aի8uЕL8c ٌB[z}~ RJ\^P pdtMfK)v*|eCݣ?|ȡ}W7+p(d;lhQBQDŽ{RVC,4֨T~U0PΨ8, ѐe ұ \вtM̟(Hڿg{vt; m C>KRo=>mI8?bvmU9{:kzM꽐fٛ$Z!G6[ oNLdިԇq|>s }CS3^~WzUGaؾp%M޻GӾx䌉CB4!j*ʷ_=NMg>lJPsT*ɠEDPY篽ǟmv/&SFH1)ΙMJXy 1 C#9+\.XUECEKWؚR 7n@clfE U$"WPusEl\FH _.Rg$2\BtػuJ;ӪLC¯ÑбRk.جndv+ٲi<^TiQaEY(GO:ׇĆ"t%2HՀP ejQ?s !%D!RH B`|j)-#<<~aR=kVHs?68GZ/'8bRI[AW( 1z?|'Pl4EB XD@@Jbj+Α.5UWq|9=ʺlFASx5+/]ȳ9fmbL&Dύ|OlvN b uv/"0y|zaSrlsG6 _kGOX>-]=ձsW}h](Y#3YH9ɍ@k_zbʦ7之6@zRI), `;R5JRH |>kG@'}}n0xJP*+l !<t@OlSBmn& ' J׫Vr{V($v~c!9?O0)B }:H8\sri sl>TBhwIxT''g.6_Y^ 0/xQSيY$T(i LauǕnH)ۿ [E 9XHN̈@T `pdFJf !/0s d ˤ'tb?w?2oغFV=>fm7TVukZ~D"./~^xȎM.]^vK_B+Ө :̈́W@yebuUv/\9” :^2;$XSQWulV$YZX'o{cdI&݋ ^UV?Ю7?>(lJP﵎rp׶ Wt͑Tڔ-@021usMs+yGZV6ML__{sljU"2Bk7'q|>PW}dޭZٿg7nw_](qI J)Hk*Pe:{6eś֭9ЮN)]}{%@[t͒Lf0feɋꊲ<؁]|_ @L aPAeg `d:lu"{eh܉БOQ/@xϢ!_R(n#<Ɗ>CRHG0+If ȺTJ;9ƯE"+ޑ$1ub[bM iaSVܿk- t᱁1G?9$Cd>LٜTCj$)_̫ɼYwz!O$<DVFECR3++\`a2iQ6<,) Fơ[<77eeuUfAäVLn ^\^ײp 6n8{!tF'g O8N\ʵ7owzݽVGR2R|K[|ݱycWo8 ϊ]i!gL+~rzljtezH .2V9& ;F u$1h8M+>W^Rqm;KKK/ &/ԡ~::~^}}}Aԙ!(JJ?WyM| \|CCڔ F.'TKMf|?d* ZRH Hw+;RS)G#vcxp"gFhk4dt juXCp-ΊN ccs~˷o,^SDBR. :iR6U+{oٽmkqQaWO[G M1 f_ˀTxClJ4դ?wC4M/R &@ z몫d8Z2^3MP+yζt:XkR*PJcFbH]|̏,SzVҿܘ\^ )JFȷL;zK Wo B)jx_~tu\.0C yP8gށӗ:7>qgϏMN۝.0@rEmZSmvNJe &dǿNzGKWNt+|bҩR5#oQZ\~Mˁ;=}}7W]}{/?v`Ǻ#[:Q'ARsqQH?}wz|` LJp?rDkb?@>9Imz/t IDATLԴEvfVThז'_\LucCp+X_#CkM˧>rq*ܢ"vc$ w~`ą^Oӏ'4piTRB !mZkġQ`˷51BbjR,Փ2' ߲nYk@(rp{>yЦM(!T4qfO^-S@:)~ٿ? M._ ĦJ33쥸B!#}w} rdlp8x%bV >%'6y}[Hfq)0QH׮, L~$$*UglUcnvn]KHX[҈PPhWWՀ5WRi3 d@~YOYIM6]-]n/zlW=}Po?KfY2).M9UObPئ-`o'1Qxbf]JDs{}_l=C4ug@Tp䑾Axdڬp$bIYG|'?>}_}cxl#3%S(ƹB2&袚:Tg uin?Gf33 %n < 0`0o/?3P:*.X sѸPGk5OK< TZо|ԩEԛ(I])<>_Tx<= ݹy];JK:zw`ԛ~ٜ|UKuKĚhM*be8*fRii*jt_TPABkl6KHڣ- p/'.dZ:T*6uۈ ߑ;\.pok<ҘXt+\E`qa/d)bk(!eB][6Ԫ޾IVgZ)_԰n k|_+o4jw&g̗ۯKDbqecCiIc=i|UyL*0F2ϣ›):p|܉34*%*VT0y\-M djˉ``tJ'ᩔm8M׵4ߵ_כ~"C~C(;RHG"8;/pk#s8l.b+ʴXB? 6Ud(6JVO\P0:Z]`J]JKM)x'W^Rc)wrÌm!~b*PFEhtt W"S~bˢɛraT\L"پ]eC##|xo'_/dJ! UxY&*S*HEcֳTDDl$521Bj\B eq-@@Ձ>ȸܞ0?=>(%rfiHRe zmb /ZlzM1#qi LD CC QNw|Aey;~+/hԪw><׏b*lްNw|T$ZQ!c?Duu`"s`Fg|m7ne[8,%gfáb+O旟p{'3O>vl}G*Lfu`E"|`hNolEflZYZw I[7}G^쉋3m;}Q>~_״t5֬Zo׶ښ<`D= O_{'Cä2u$-(Z޷GKWg/ f93+x#d?H5'* LPNۢl:kqNT{{H~}>2%LvM/,,غnHCy$E (w7IC\ab8-$dדisDP0D+>ldl? F.8nJD=z,҄71).kܹC 7$$(,h] DW0EaX(CRJpHIX3C_&uC?*s%Td;I6&TR%K)4msM 4,I;2V9Mpq,B!O(@5n8LgSny<^EIޝ[_׾R\h7v8qzfgHmUVi5}Vfg]xu@O# Ϩˈf{.]Qa!L8K"Q#|~Mk/7?~rxxdώm֭vgp&nj6f)2<''Q&[JZ2"Xu͗<߹C%t^l+Wݱsmt&B/; Sãc(>t;ί~J[ǟ!ɧy(L 5"|2P682M9 6UMºN*n4IWUFr9/2==WVR,*"lj]X瀨nUx!$!U%K7 |ؔIpqbp};7LLN}XGwƗ B*4qZ˞> ߜ7ҞxUKX/#XB Y[x lJTs:;ɋ߇ R$[&uZBi.RiXHE`h W/Bn/AWx |$(<+7l󊦳/sٝ.1in%J0GnndnMKsc] 9>6[o3[@s1E&2 GTUt /TNMNڶxxttd1Y×o8H u &&dB% & 6myZV47:@LoW=,fusC۷6tNXiJP6u_ Wo~\AMG%2rًχ": "#u8ݽX0j$H#^bUǵӧGJ%ia#KRHA*`킉 bEREȣ)aS}{:G6%u-H)-+?r|rsPğX\l1s` 2w_M4j /M+)%(<͉Pv@N LG6:Hu nF.˦ M/`f̱:xKlRrIWiS<&Rep* *Zv:BЗ R#!=9`& Pf) I'EK5+$df$RZdܸnu뚖k7o Bd0VgH[:{$J d  ]'_jo}VB< 8E4 mill8~fBH>_/DKcREp9,)YRkE,dJqtn\N~woSScx ]6R)|AjLH5b)T, 8ZPWS=cήiIFx!d>-HhßK,Iٔ*)FT=z2y*H9!:)4J.^W|DjfՃW >olN~ҧ={)B%T(1& N ~@*|( a $-M 5:ؔKttOR?<!Vd\lMss͍^JШT)e5M/<|Օ;LL^)t޾߷yB!7-ãx5 qcnDԌ:{ +)4ܲC:>g8euS}}M鋗/\FӉ~pm33&cn`57=ѱx[8L֪U|P߿6R^Zv}G_|xFݱd*)rd* ܴYx^ը V Xmn圼Q3ա&ޯcȊ֤z>Xyi0 M3(+ƘѢ/DmʙXG:d͚L!_zcI r>+JsXw|'6?~f=7*$0iPLaee-Ժl;箴9]e3bYiE}.G&7~PGu z}_MfAe-YRóبUU{i¦ؚ`nҫ[tliztHm=PRH^TTED"29:)#T(F!5v#UB#vy~z Jԯ/7 q 2cRB*KDu_z:Or4aӄa8>Ǡ`on5o) ײ,ٔ*WB%T  uׯF C^YiTEt1QxخS1</ USG'neScdf3joo *R}>2@]`h1,c/ T Hi`XMHx\$u ̕?>AbV&4juS?&ca39z"$$; pJ!cy@RZ9 ᢸִdZͮHMOۻw؄֪(Bĸrҽd Y+ >ę-6/rDP\@ h"L3x\'1YuF|.hRI7n-v{e˦Ty*RBy9x$e M3CHȻ۶qZZWKK9rjoo$ZHËE"Z% G&|>OZܒ6fk*RP}YgP!@Fl(;Ԥ"}6hD(aA Xh}( _`0bW6Oѽ$90/,1S$)r2hrb?"$& P( w޴)'Nx6LVU^&&fARmB:cL,ҔvE9:$ Wz}>_|Gٵje$;JY)eښ7<~hv>`%޿?t?|ޱiB|,-F,fG'N'% # T.Ri'Ԍ}@j[[hrX8b@($/^$ہt=P,>>1=:=cb!548}g-qUi5r9Kx%Xqhf`zڵhԤT (V_ DzXl;.Wxvʙj3.)esПPXgP(D x-VkEYB!\pLKBB ahd ld|O# æuVJ, cE Q+[7m}ssLJQ+uj5AX O*KQR19NeӨ2oC^^zil|`IlZUYj]W~iW35-2iCm;ox"j!@6W ӐCr*m|j .BXBp߿mZ"NNfkkckq`) gM4D!BM@ꚊfTM@U0nRoV>cM {ųL̈́MI:EωT0E db“' \*-+)}=/HYF%"BR!c>3;JGj̦5xxB|zT`U}XBH}8xze`,S2'kB 7 zK&`D( J$Ff'ǬGZ!T6q$x83@sRHQٲrvس^ڽ{]xw;fvg,ْ-+gQYbD"r&j@d,U lt7UoUWW=iR%tF'B>ARoߗolb 6qFHGEp.Gԍ6a25?Bxe6#A/LuP8m 7t>jE:3=VbKR!y|q0bZ8/J IRTU(IrC=ܔ4fsNdy>Dʗ9cfuU$t鿅RPygs W< oC}a$?EBVRi^dN[Ouf'&^{ln\?KDJ*~q*y3TIM?;4tu="Fn.aL>n89I+Wd"jϐ#҆!y.7"4苵(KMx˖`g.\:y$e.fP(Fʁ>4:3F5 i+>JR(5z,HJSUKQUJJG$$ na>\?|)m]\RMqԩ{B-왕O&Mal0ͨs/MW$51?8B!;3ďl3fc فAryeEYNks8!d 7m$] K(5ڻkmFݏI-Inb@0X726N)(I55׶صh2p); PlNױ3߷sIc}O ƊnVj*ɄeMܔ)~u %-b1%SJR$ sT8IJCxMed[,A䦔ƦCa9- MgZ׶F\ i`vK_@@Qd2TDT_2e{vTbJB%$dH*$/PGϗ9<=N]`Z;bzXRVpS ,pH\dwSWTTD&# ^^P :%4%zKf wSD΢cgu{=1đa ;gIDB'NX"I#,p "b@nLܺŎVUGG&{H !,(;FO&Rm%ٹ*c.sρh8{džGawp00!z+̩O/2 |V*r"fEkfxB+$54TLoȜP yɤR)<^߄?8d6TVY݃W_ɿg9lPZdxѭ UWoܔSRM54AnD{ uݔC~z oÍX5GӫC2\1tDQ7H ЙhTQ*ΈDdݭ[~ E:xD&/i5SNT#f !d XDBpKK v<}pϮ2ǟxqҸ) 3˗tYUQVgVsiͣnh Kv<ݶP ƠUJ|j'Cu qS|%2 +,1;) _(y`` n'?*)ff3i|um] gJnu\gF&N<5H&{9 F~70Kߺ'MJR&+nKRw% -M vo)M9uhdq+UMr5xO?061CmM5jv3 Y(c Y)T#@OjkqRǒE|KAͨ*whjOxqkH7n>nC}~AzT.&|`PH0b>`b:,&8T~m،Z(FJj ^$Tó0!p(~SXkF}mO!G(;߼dv7}fh^׾ZPtwG mً{"W VU##٦]MI?HX$2-"gB|*9o!^]zr??>tvO$ AJ?$ {<\-ᩰ^<^}rmeA fٟ?7A lk7vo۲uR{=>0< ,dpXGhG16r {?]Ku)U˽m+P׊踥 Л!ҘqݴDw&ȴ| 2hԪՈ5GVNjd^_WSQN]\kt$J*<1<#X_T,ȹ_JkBڼ1C/m\9Ce6b("]nE _E$bP鄵4-rh&6Iy?>%xnT88%E{(;sP)ZUn!ͨ(NF2B}V.Q}vF&Kw:-Ҷc2У'Knij@L1%?] `aeD=ảr.[UD)w ;m+&(,7?)䮭Fcs8B{QT K+΋ue--]reH9wJ'42ɄX$*/365Z!?n@Tw^S>1OP7r]])[dFNR^ӯ-M3`0.29P@Rrੋ"'ʩum7v}S.WY fcKCC۪ nꗁWٻkcW#n7@HRX$3]x^&ga~y ģL ^H.M9KKDH*U@Ȇ:oݹxeJ([rV\t~1 !D"Fc/,<-wEÐT*auva*9(QRG&bjn4ݻjTd:`8{%-[H8L7O졞Pk-}qV;e$IE?z1 $:?7ttL /]O5 T ڰz\.UQHEoP`ͨ L@w{7K*e^y=[vE56ШTu>ÔM<խ˔j͇'nXꗄWٳ?_<슅O&Q7EtZmvRM@@#7xdPI1?7H+;wHlZR:UPD9]WU;?0R) xM9I4Tp:lHfمBҟ~וM-)tokJBmI ejWFq;߲Uw`nm%37Iy%+z)\3ᦠ}?ylͲ%"ãc(&lPԜW$N ŐT3e{j(zJ8L4^(R֯'zڀ tJ29/Sݹtx'MKť&#nr.?(2s DBpIUekWزaVvsPa[e ĺn͊ej0憐%~yxОgw>Ip(*RD(x` (I{F\T;s%wǃ),M9%F@D|$oYaJ B&{W^z^$<{!(d3uPIժrD#$^F.ٹUjӿz\NJD`L;ҥ伖,ɖ~$IEqh.1TWVLX~9?V$c@].LKoV@RyR{.h<OIRX,Zl"&K 0d|  AFÔNZѨ\.O00>RۯLvIi&";:χ 5S*:PUR)ຢښU5pP)}f]NX_U* f傚\dP(ls8#$JV.ۺiNy3]rK]n nbT[;>fv NOD"+/ x<^RgsN_^yd i-,Wojz]u|!lqQ72󉗷_ihd]@EBgM712OG*VG(dUe0r626>r205H$ DhvP][o||aԠ;P! M\q:Ieܮܐ[R7]G<^[JH4ju5 b]Dj%aȒoۖyGNw!Mukٽ+e#DM{HT7iL&CѨ62%pr]AIbqAJIHfrSjPqtJwҪ͒T w3R?:>"%إ1R@K1mŲW^|}Պy[>d,pS$KZm¡w7Xob $؟~ձq Į S w8]2\EtSM Ւf6 G&Wj;%e% O33JjNC"Ѫ`(49e&c )ܔ3w-_@$5LB < %-+w] (Pp͔v>exM<2.L[ %R"D"҂I?w5!L)v-~ԢiZM ݿʪ6A4R[WLVI IBR=6nonInkTp$¤s2<5 0,f"1w 5z҈/ܒķx&b9=V|mN5D/BSQ` 5tEk/>~mf{^vSN]ڴu?%O~9; ;)!WIka۵^*&ݔіTPHIjh?9?@.d{$QRʳERU#Jrщɪ {ꖵ6u/rszVCqqWO$ly)0B ~t4T @xtw>i *QIjs3 Lb}}>6 hHI(P(TFR~5f5єPGQzS!##[3ȍHxMՔQoѽ{ঔ%8 pqǑv36<^D+^A&7lh{N}[R*dB|[k4ի^8oӺ^w>8q˃@411V^Ԇ?>en{{b҂<%!si5&~ڪ?7+AR%"Ɗ zG S`;$d*68H* vU-3G]!mBI#2sU]mDRs~kXT._\j6 NLvFpzmΑP;;$SYYV540\)[33^Gk"diF>| =M|O7 _4 jrT$25&WIժ%bHjbHzeq승D@(h4E"D瑺ÓTa1-zwp8yĈ|ڠJZHT7K+N^+s1 bF.K!޹}c59i+[lxv I7/9V?` 0>iѨ:`?~߼p7gJ%%JG/BKɕf2,{4lt ֵwJ*P*Z+ˠ#c@l2(Et%I5TPcAPZN `rKI`ΌVKxb8h$5C5r妠|Ea$5cPQ@+J 9TRK HjBނh]K2TqErfGH4 mԪH* n_ZZ)?%"To1]JgJj+]_&qD$U( XePSwn݂x[sI)Jhnۼ㙽4Zo>*Iz#50\'P< }xH4HܟpSgڷsGAG<əi6h i7Uoh?{G'-Ko_!l_ w7"GƢLޔ94%U$x|l4OLYQF? %z:y"$5m'*&2M]]XPJ|Bخm[>_eu(D[IS}ݒ)k ԗM)*Elc釚z zh]h@9tI><FRE$BUA엛wܿ{d'ox|ʹij" q}Mmv0KsMؙ ۵;ɞ*A {D"iyyxtl2| 6S Hjb ie౒q>P %>}bCk\GMá};|~F˗L=BTH _jy|Q@,dΒ !hM)Y v'()IҦ&~ s$҃ 3S*lre&'Iza&UJ*:bAvC|& Ru jT*?Lg@(Hpvɛ]$kz}QY 8 :77(5Ioa`[-w>Im=MH*wdh]l,ٿs=JG}{NZqyeJM5Iii;Nyw/?~ܽ}Җ>Mt1$HPQVZ[UvAh+tJe_bYp w1TTH+Tv{{*X#}Œ%5ރ{wM#ccܞ wmvw%N3Ղ(TO)$IQ!HYOa zޞ*B7oi!3XP"e%@%**CPMo0 RCUgg0đ\.?sI`;몫hM]c 1 T*4ju`M%VSf6E"ޡd|ljCC\bG'H4 ~HΧsBBr;om_o3/i&W$H($n*K{?̾ݕeN|G'vSYT,VUo_wǶ>=O켛~% +3mھbޙX,#CϯnjlbrpxyHc 9$XvM7z皦nݚՕ YZ*0d"CkHo0`0*X )pGA?$I (r(i(2iRet-Mڥ'55͛ISH)0^|th"m5Q$зjX½k߰?xi F"Qq bݮݿSg~Cc:7+׵޷c[Eey(_-`&v+ f"Ɇj%AgJiD=s}X[]2"qT Qgjjk(F="d&GH$j T"#6#l b4H{Mk*r9iF5Ǯdz$n7gSsY߃ <~mwOUr:?HKjD_ SW[s¥_n"\g 7(+m_r555??O_Y_unu Cg \@aM"YdF`Dȣd?%*҇NaIMA:8Xt)œ ( 8TL>jkD"B *@pNdG-e"p g^ʴd?Pt pG/ 8:pUb!7=Ko/O%0 _Rn65GIJ[O3)(.&B!8 ۰ r0̼=51bOT$ne(y}A5D.`Y%+L<bj6/f۱WVK&|BDċ+n e钤Шx.\"ɐg(.ШUOALE rSUʧ6;oWmuKwz)얙PVSuuvӯ8-܁~LJT ,7V,iA;0Ler9|y|y,'z?ay g:cZCNN8}:>4DZ/\ 6tU 9fxLFzf'IR1a:ֶ?$sْowNgzf:ք?s~CSc$xIyi}UUie'4@C---#'VRnQr˗F4%$D!:HbW1SI X&TNRQx}ըA#!cѨU&c gfzQ̣J(*1C!܄膊W!+7sr̹xRbh#ŧϋ>9s_8j!>gu\T͛ΩNSy,- oLPR*6_Z;o7߽ӇzHnZf6Yb[Ȼ)7T$UV}gzP`IIT$2q6܇Hv!NXd Y..eTF|d2TJ*>+=s(&X- ,Q!hG~IJ*#IRa`DIu]=+JI F3K*uӟ} `=Lp rJ*-mA P{j]݃Gr3<ar|kv@ZqOσM9*+ l{GWѷO!qWn'ӔHc겤jSzՒ/i -evy)T!YFOQ/ԑOm"*ٳ"jTb$5xՕ8,*yI꬛Jx*nrnʁ%?и0ᙬM%nz/ Ef$C& OZOK04jCq |T.o_]t ߼ލd4ZtS?9{靏OLٙkL<<DYW~yuh,V/njXLNr|4+J\R! @uswoN!7 -(U0p&fqs}33pwիqR!cqsJIY>E3hjJ'NnxރksȃB2[(N861J C?J@$q )x*8=8X` 38׎Li,%(EL1it:2Bw7qM &] ^%"_o)7r᜶X(4&7%=1>i>x'(/2W)g>SH"$=y<̃4pjQLW!Rtef阞Fm?V`\Td2U*$ m!JV,{zF{?;u1"a|8G BDk[bYpę;ݳ23~)9 @o~_P\ruy}'|+8<dc9;zGEdµ:D>)>OO'WQ09ګ88R*ӴYi<Fjc) DA8oM|.Ab*m۩8.#KLaXD*Xb@3sݴYIYp&Wj2" b:19Y"}ƕKD 9d6Y6Ԗ6ZUSYꪫpa8Wdd|B^j*q{sK}J$_yU+FF{WB]8? 75W,mپe _ed7Td Jg?}_DQ@P![z32\Z;)Qe"@80ZXV \ '8m vLUU)$ӧ$f*`l^=`% $@_% BQXzw߲䦴JI|D"$ғ NA, #/H*^ PW՝)"30TO8|8 .E|M^:)f&״zqK`b+gܓu@C@|%ur 2g(╧&`ƢZbU ڱ&rY -|ƫi÷rhGF&FI-v8>DI5TSVS3.#wZoPVhhEYE.EW,i~ֵM٬޹WaQ_OX,km~zӆ?4G;=@T77_(] E\&jB'rF!϶Xm.| ڽޅLYyRCM$.47O*ȑrYXP_"}>*P[\.+)ڵlLҥ~zz U*ePTCkr,=#5?}"Ee .6 q 5GHy$;H~/q755E L6 w"lZ7?}՛rH j$dzX܂C¤VJzeԀhaȑP ǫP(l7m$ %e8E쇊WUHgHOVLJu5jϜv{mHboAOJMF?8- m5cG66i!+L0@V7֬\dӺ'.^}1vO~Z '=wV# .ZK*ݛ\&G i*d(bI6&`͵rYd8>>P8$:ђM.;;0Rmm* m[RS[R[>,ǁM0hx89z8v*DXܔN⌣v!+iA<ŊtERzf‰bj\JTo1QcLxP)BUfY$SLဟmUMl=\SDSROp<ͺB/3!@^su\J"Y */[bl߼qKn'%Op}6nNbr9p;]ǂvC!UWV",SP(Ʃ-XPY|~22YSC=gmZzx^v2zn2tISS?w`Oٯvyx7Tl|T995-!Q*',(<=DC~zpvJb– T*$zz:;_VVD;NR,/@mE}@&CQ y${ fPgf2@:,O$ ٻp<Ȍ:%Ú)I(JN[)eQ$C#GdTUQH+*+#:ϟ SGTܺUEvN!7Hǚ"bp T*#7ut! D(looM$bqeyYKSm߳qm;NyjH>CWݤ f(wPIU)k0H(_oPyx 7TyzX, ; Z[Mey(G'H'@Z[zzJL P@8 ==QATU%Iѣ/|qN^뿁]  K@vʩ> r@J0q-vߘEV7gtUظ"W@R7e2XޅĐHhT(“>-Rh'l24*z<7d 8_R]:-@NCM&J*իGüy/IKWP!fb0㷴 {Tb)2}^2R*vlg*Gſ;[v C7[bikMU%uhdtu7y}G4r #0T aEק6-/LYҧ.DRE"QCmܱuK(:Is:_7-=oZ8]3/`Fv'V, ϕrEbPUແ@0F"QPT1*(ٜ!h㦱PRJCR;;[yk[R-> CMhf޺f2Tj`2࠭~p"(7vI.a#GϸH&M*=vÑh#>_<ĉ$LR] ES[3JmUyW?(+P?QRsV$Am)PTI?:[#$%`T*zzLtf9N j *Tb`Ɠ5Ԃ5L$[Ӿz幋;ɤ#7;uH XڇoDF70xoދlX1+1W ,CUtK CR$ƺJΓTMC  Eu/ڿkVDƻ3aR|;GqJnݥ+.~O^?fg/|*O^ӗC#(B}LMJf Ϩ3{H`x;+sv=MtSJZCl&0JjgguG?2=,DRADnq+IW0Cձf9:Oureeq$1-hFɗ~pPGlII9Nk+>X$J%bZ=v37P7e=UB#H{#f(iLYRS#Gj%U$a!yjA`~ -Y/?H *mF& ']2<^B.+5P"Z _ovCmF"Է!nB=yYk z}.Ɲk=bi<|CrD T8-MSDR8|"`T?wpߞj[}cS6;3&l}g\X_iڃ{v o>Ox7Y,xCH?D={`h8%5[ƺB^Y^&&}Myb4HĐT1$)@f9pE lfvp$ə${s` nF[X,I\@DC3tx&,;3oCEP#!F&ajjbO=`ժ]9I`θZ?FOOyM0 #h.>z)"(כHL#qbE*)P8Bj8:|8Ng~4f2- dq^FcHχ ѐ/DNyښjg۝ȸ9C[wiԪWUUV\u $mPmGlgaqƒ{^׿G>:9e#5?2KC]Ǝw8nʳSLK)&'K+R7E%T,LNY}>?qS8i4cSHX̌-[R.q Zm%%SdI?)e`PsNKArvt}Q~n^/{5O~yi k3XZ/TLGG^RV& mlnzSyQL%BghE]:NԈf4{aLj4e%U.UJ 聥Tj_L(n%k 5Eٜ*& 6R=LU< `{HJu)'wzRڪ9XUQq'O{t}D./34 vZNC@Ad*aaLǣ7Tlv`/mmG2=Bl:g;M%%[$dRiCMv0o}ejyx oؿYa%K4׹P(.`D,{i)#Cd+xfx-K{( ET&Ch,뗴4OOgnMLܳlاo5_7E\WSm߮ee|B#X$bzIo}$Q%I*u||kL,J m7UxsErZC倪GUgdTB}hK-@ff;-n9>NQU1t)mYA8 vxT:G:;n^QI1 |H rh>iXM| d#,DbG:Q*qE:(w;7u.̏Q)}æ/h?-d;Z*Rl2q'g2ڪkn޺s5*Ĉb1}.Md  hImnr=75lоe>;ڻM!oݔ*<9v]V/[rwf&|٩T*-+5Jr{`4+HH$*3*bLR;ꖆNaGvIik+5P*LT]4Tn'(`xFdNcjzH!b'uUij> AIr$uj*52JzbG727Na&6WR4T"r҉^Oڀ3s~^Y&7KF^){auY}"eO k HWH ~a؞ `(ZhJT:m$X}ªDTC3 ?k}8$AQx\MUe]mu]M5r@0PmC{v< W{/ Ov#@C8`Ǣ67y}^ .jSX駞ٿ٩3~Q2 -!W,k*ֵ޻s[EEOy8<*?<9~¾[׮Zq[,"T*j.wlyv6?p$" 2L9*J-53"P_tX(`Z#& G'_s}}[ER!8tHA|K;jݾgw3i&@2]}~|0J)IP9B7T=SN:Yxۇ'劭E%Fz>rc1R]DdOLVV11iVHtvLtv5T^=yTt`TiR2!ҳovj==+7dZ$Hc] $5 3g ::A· }*L73KU %YLٴk?}f$ß?q,38. 7v ˆr33;܁}gwGFȝ$%>W'3,m՞OWUW鷎"#jxC?Խ۞ڿk#() 6@RBTJnKrAn Pioٸe]=o|`*ksK"NLD|e*gtL ^R'v"#Er9H3}bMZ^q-ݔ狀oCY(TJu;!H`FP@%9++$&MwnZYQ7=@uybYH+*U‘XTB 5LK%T4D昤>m1:6DR ܴDAn7m"4zbD.ҋ8USSzM[|)s!3-L,FjbLKL.I-׮^A̰[G*& Ln sN:M4B41TTjsDE|\-"-8 چZV׸4PO">}"I 8~v @+V޶Ͼ 7n*"p~=/LF "#~jú=۷UWU ~p~o ~uA[92%T@*7/.zV3>G# 5908CARI@0 JL%79nH EY*xHnT( 2 '. HDRnY}ڍ[rɍBAS28eթRqxӪ^ xP}lQ:3Pu5%siuFote7TZct$p--#P8e2T|5"j$+ʶo g|ncpܽC'N;v/{lv'v+I#WA&@>V*6xC͍ /]>1ի*33+9InZn6\kSGO觼|ʳ8jp? EORAJ\&rҚꪡ>Ϗr%g IR2ٸ~=٢h8oC0kҰ(cK/t`^Mt8czg„<TDPףr]}LSS6bmt0|Xr$J*h 5T5g.RDTXo^wc',V[sTK82E6Cq_P(J pSҳq!eY!H$:>1P!f.;d;-pTl 9^״LC8_[W[m2tŢ;[lpSԑfI`1Va?vMH&cAyvte–H*~&*m_{-޺ۅxuH895ŜZkV,߹mKccǧ/n*ϢqWR}g Ӓ[1^Lc;j~]=ipRm`~ۻȆ*g3T*vD`*%.)$uSŖ8iEо=r#uZ]$q)={EqSʵk7 AƨRECMyJ*Z*+M߿MLEMm "M"rq4z 5vS¯ O7*JjͦPTܜW$ N6P޺G(.JA(׬\^]Qya 3mbI htrc׷ϮX^W7`yDlqF&NX3e?ɀ:hX|َ[>9sMy'xCYL _a`p*b}RG'eҎ+QS]圞ԙ.g rQBI'p , 8I&BLWr@pO E͑TྚJ2e%d0W?3_7;ye,rϲcH꺵17ad @K7]gk~82>$EUK:M3 jrHd8Z53e#M9 [,ՈE1_,$ \-@Pj4nٰN,_ropl4" ৓p \}"$hFE]#6TT*:֬ ϭ^7ow֝@ &&-v z}]MR!X 7ܯ\dS[ZZǟYy7y g+J׆=^߼%3GJ"i_{&-S?9v^w(anRctT1ԡ!8PЅ$OMT|M6IhHDh91oCY;ǢB}JKH*7*P")WBA_,Hw^ KLM&I ~ <0pkBe+[~;ߜLq)L ,I ʰdlm&z܃p@Rl_k[rhh7o{-?^zHjmuFXm:͊eMQ|wy7y\<<$NȨ퉒s7grvhCl'~~z#\&2%ɛsNdE"!FHt$nb[/K*jq u3s;c2j+TK*q񶡆 i>1 `.{bz k`3 ".1s"4}EtS2"X[;'8x*NzWP,iѷ_EI Arz~q6F\G!V!-(]E<t!g}AS#s^߃P (1ohWT7n$υB c^OyY*&OeUwiTʎ~,Mf,_Kϯ]zl|nzuϸiKXNgA|i˖/iEvO) ߆P݇Ϋc.7STM"p9v}rk7n9\.`3 yL&K€93 GF5bGRI%2@ ұ!o_65PsW^J"UT, 5Ԅ" fb1?p}ʺjFRC(q4^Q.^L7MX1iêT"ٳ]ao7?828̸i$M9` .myYd2 x*=-Y(" iv_kN&e(֭_V޺{ot|IusjSj21~ rcn9Wkuxx'F)W^~a]{ejw;w*ΑqSPH&}ժ˷;s<<<, (oMLL:Qr?c)Bn 6&sSg>ea7*odӉP#i ] %Jgs:oCmnp"BA3iZ)]UUž*#! W":zV.]Pءvu 7(7smK[\Z?}0ܐM9ӢHڮ4uۑFGHGxr*"1In g$vO=#֔bzV.i 3DRM%%*½8i556OXϪC2˷t+^} Nw;sM[kKZn\gofW< GߝXlGZIY?;uNnHrSF$U,Jj>m M!DXANIq8"QRg--lXApܣ9 `׉ W@JJH' K޾֦F~fc?џ|]RI%fz\MJ0-v{;݁´[D/gVtW|*I4ߨ_zei^WYMe:<ĠWUn j55x|vdXVWoڸeT_^vy2Ǐ>{F'q+0<< SOy.w{QjZ6H%+uy%?֖`0tY e8ԨLJFgZRc82vi2 =0,$@ eT\f pPI$B*q)S:чm#1Y*ŝoО2sobU9Y(:!h`x%DKفҁ#CS%U qQRq^PSǻXhTv&Q#784jj8r{s=z]NqH~;@QkRf"Aڵ?z>=u9"n:CaDW65lٸ{,yvd*CzGߛLhic]7^|vH4r3/[mn|7,H$"K$5n PcHDLO 9*BՅ, ߢ>"PƢkJE$5s؉ *7ZN[Gߞrik+AlOChs$NO|$$YYXIb}4Pf CMI*oGݾҋ>ܔYP b'B~,JU[])-SSӮ9nJy:0Vw:N'm7+[lX̾=9qIC hegyx&K?G?edܻsB!Gp`gLS:/E2T@yfo&GQR2MPSEKeYI 33(wE(I3ĊҥE'8_T")/31DprNgw:11cXUO~quӜG"Ijj6vسd4y72Ż)ϗ Py5S3/R*c1$?0 %U,^ĭeZUM[d']RP(7@OS \Ξ/gto)q:CmhvyH7ŕ|<&= ҥBTHvbE"QUETTRR;63L3^}17J%u55ֶ߽\Zx7*%M =}X\\Ê(F+9P Ug 5Mq K"yJ xMx|$bMGb1yBZZdO3T`?ڙ؆3T,n :]d B1UV9B%5@AOZ|H%P?ŔT~RIˤej*nMG'.YHuUֶ۹O>wS/5|a;u;W,i%O"-XeʶIɆl@R]M@O.-YR1QSpa ݽKS4*xnJdB(1E9 A0TLXN=S}=yY=mweTPbAДSR1Kݔ2?Ckwp?- ġpX(苋1laQ$U"M&ĤƼsFg]W,R7MbqMU5vn+|o~twS/=|;}kV,1HIf2I$VW]^5w|@^㘛v(PRQcG399o)zzҌ1TNmm7Ղ>VO0! NrZ\Pq Ɇ$)y~>V_%╳Rz$pp) )-DuU,MYP8zHjʮ(H1(+xɘ!T Im#O  M{঒n*U]jώk?[vS|*wmݼ^WyBT ͮ)rk>{]%H,6 ?;m9FBQZUEf87EYCtDJ*lq8Hj5J gioD7j-vH-'&[ t(+#K*fj(GѝҞ&$u][쥊b7Ř1Ia""m2t4IPy~N  N^@UEkVj67GЋL%%HVRi<AXUY,SVIY 5 676~0"`lղ4P-OSD"QEYiꕻ?][[щ3o<_IxCy,̅C8PXQj޸nmuIܔ(.»)WPyn)޾P8)sQMֶyd4,6'&i Gnӡ URSݔY($5I8Sy@ sIM3= t:^kjQq )ؒyʔ`ZVJEbY .Iׯ4ڶ*E˸ORA1SIE 8;8VښIA &޸Ho&fk$av,g JƇ2ڊyr>~M L%jeZnyW_W 9޼'۴vN$5Ԃܴd\rΧjlln7TLj]=r2F(k33޷9:`6Z[RuID!2$5;[R4ڨ"AUUE\n$5q==EKH:;٨5 Q.Rl#=F&dY(u 4}p|QՒB#JJ9?gg<L CK/_T)8z"ᰱTѠ BGE5r@^o]M5rm}Q&*q XjŲOoijjwx7a R*I !BTbh[#o߻oMvr:[%Nlyfr$"2"<)ᅙ$tXUKg<6iXhy9m&7{!Lv;ޒkgRVPԶ/fdT bU/txp$~fSgBRֽGܗOhM9pB%#MK uupx|>)[SU%~rv歷[V._---\|qij<sjaA߾fD"aNGIW?cIuU pϼ%5O7嘟LdL{N$5c(+vujFCZ[ɕ}h"uSzV~R:$udC?ffMQ[[+ץi$-x,*"8\1: 75K6od׮ߚLa,o5b J8zHj82EEq pӦ: 7eӟ!$?C_SR]_ͬI.a t`qӛj'W,]K?wݣnÓ mNWLА)V._vuOYmaFN uY}C xߩ uS tLð16^_\8:JN#S7s*dIf+"3FcH;Rb12O w܁뒴 P_zx h G AAT7P+o c83331iFu{< 'Y1"ꆺ@ 861xXIx*"I嘳g^}5Gū3{MQ̆P 4u˗n۲g}wSrW$[VZ:ydnFR]K>SUhޒN̻ *HTP[+Ύ2i]if\l3XAn!rBӈJ ܡfb}d<:)* ;Ԓ RYO+OQke-U }:?щ qSv 2.Ĕu&m+5 IOJNr\VWUvx9xx.,J>*c%º6˔嵷=i2enZ.[M/_ cW*˝^D^LYAmv݂%HRÖ,w# lN cB1-+jHGJ+:ytSk`||ftܔ&eIiOtV Z,Mre̙nbo؀Qj p1ԙh`HeH^[׶`}8uŴZlHl2i;- 㓓ءSTHlC7]08~HjѨ<>/4:o{%NjaG? 5Ikӛ7<pݔ''<ܸ{?{;Q8 *U?ْ@7P!sB?Wl_PQI(ǮThC?#[9=$t-H4PoHNI+<]DJ*Y|~x,?>FӱfUt{hdyQL|j!P9=O3m*8FS_S-'-pG:0 aT"I8opTR%%*,mizk/nZv_g/L&7M?wd?_ݔ'?D<7zC{˔怢bxs T]RM)3T}.?x u!P 8s̽.#[[!lɆ])Pb2@ /ҙ,*DR rSdpZ ދPƑ@4*u۪e{}^"+fw|FDN''t쟬M]2jwgdkjD"A>;v>;ڿm~oɳi8y]/ԸeNw'xCyO~d-V+q|՝!.^1mIe39M)wΚzdPD 4D4.ݔvI0~,L k;s_1UWo)ìĺ6bWT}QC8"@a#)I$J*b$8 aTb0tVW )pz<&Hj,ۜc].MNMM48|E TUrH*۔hD u5p+Vx}~'i"P-puߣhW`j nOk7?Gn{b҂ вh8TkuL{"!'Q\BD R'=ݔtp{GU*@OjeBA2%DG$-M@p7TUtJY(n*Qч#3 2&6CRͰ;ݑETU*JTD]0y\hXJR`ۧ+MpӺꗞ=sVP~tScLqSRXeúgt~eW@X<,kn_o7?vs]JeuU% `2J@8 / 'v>Il +)q/G<M)7Պ!h}M 44aT?W;֭;Izzxmj"ǒ[bgf!p;OA-ҥ5wMMWyx`(Z~ğB_hIH(HtZvy|w=Uԑt:$ mvC"HWXN+x~$DBQCm="ȍwߺCG 7|1*2s)jBDLc3{?hУ.4b$Ov"|O576Cw>%-jkPMLS7C *ZʈŬId@^zuцJ˥jA("SaUpZWGjHr.j*0,fa#)x}bx&'-MfHjatfnWUQj 4"!2TVC!f'9PXQZzh}w#o䔕ƻOZX7%bHRi}MaҷM?ݔgQ 牄^u憺%5DLVWSe6!)k&7値Rll'WSBet:xڲIk'^XK¥!V1y=EwFvtR T¾%S==,P)*U^ R%#QP9`tdLvuxst*N'\)M0:EfT$ND6Ė2#/;쎶U+#pWODc,p-tZ-+snj.)ٷs}{ w`ZrSD}vgonp Iɳ۳?ݏTȤҚRnLh/d޽ظv> M$)H$sn'dz|#OnIVA'ֱ*<'P ANZI+…!2P6CUkēaކ cQ517Tn2S A!U->ԃL[HQ-J%RBWӚFHdarjŒP(, u!GD Ԩ޾*+~7o;<6Nڪuk^^Q'ywSoFB s4 dWRY /AģZOPIf㙲lHTS]T(gH*@DR^_=gf ;U'O7eݔ`"quUź{wnz7»)F$PdsԹ\~'F7%,/t8 ^<%6=MtS}+tc'I矇jW*Xg4TERnI%aࢆsؤڛCғYi]uC5P=v=9?C*XRhp@RtJ'>@PaFfԞ^sݵUUy}>AI me抲R;e!`fl|l4ԨJ| La2ZBS}݆gﭫ9s¯|p{M&ŢmnV]]ݔQ!,Slߺmu X#c@ ,/}_pIBAQ~Jw/'WF-*hC9 xz{IWĶDI)"LK9ДO^)jE*PQe [SPygA%uކJ#vlMZ7T?,ń0g/ͨUp8r*+r$IefSUELY~$2 I-Vk4j Ǝ;c.^oGљ84f@,U^{Ƕß~#>#7T/ O(/;{?u{|PX+y>;inko..~Ќʹ)5%Iw)xxJeTx<iu ^Ғ W(!q b^ J bg@pET\**֦ LĂJF&:;㓓|[9~*Ij6]aBGKIAA(zH6CNh$5m3  Z^VRb SRᦥ&cMU/LMX7McPh|bX).:~v|A k-׿졖Womf\j 7VصNy#ݔ 7T/7i5/y^bRjWoʛ T4M ~ftLOӶ><L:=MjCPEquյpds !H)qSP/.1} G"Cr"mC+-DF)0TRIxzJy`J254S]݃'LSCɠ2?;zaWRfTR8CLUVjjnyfI fcImu?L|p6px||BV Ng _;*iڗviK[w~wR)k\rm[>a%aTP\3 0˃ u$:IUjuC=}QC8Fbҙ`Th*†/]m`$69o`N6PA$blf1MM%ښ@(81ipS:+0 R I5Ki|PIUe:ڿ³˗.{oz`(7-5^|綧>>y#pӹo iTC`߼WY7I)LHȐTCqvMźƆH$261MI 0$U"Iu/`")]/z n0Sv(vLBAbْ[,ii=v;Gn*ϗ]=2{~mph,XR]8f3$B2EPWT$)(:v}*Pd;qӥ-M?7mv}\oMlNPt3_E2鏾ٲ. ~f4PS]5"h܈#c^)L|Ѯ|UU U&q=_j8Gڵc[4T`شCT[]/NkQ*NOu- &13υbt~r: ufx<޴ 7]r/ؾfkosE.@/mݾeu+<<0bvŝXzexxDɐ1 XW^fN]^7 r7pSfffִ|!*0\"+|UXÛ kg!{gIb;6Ԅ5[ITQB;oްl*;`DvAvP%P {TKgM OÿvKf U:;Kץa}qa) 58r Fo LX,H u&s= 2jҪK_yuk&'-y Wz|>⦀•-%-۶lz3dj @ش4 (ϊuڊ2xz!-{ .t5n FI/>nģ7FAT"BQ_So 04!Adm*ªHK$}|Ti%Z)]}o+J=pӾA1 ӷfŲ:fwblIj3TXN"'/R_tݽ5<2aM9' f+3$I(ihtdU F A[p(ЀFr(3 u\z pR3MqKڴzG%v5H KΝ^ONNNe@j`M=`02jija7BjupDXOjW9a_$ڪW_zA!䓮~n%J25e#xih꒖&$v;x6E\XWqڃ{w 7><ʻ)ϓo<_9l7R˴r{1TMra ޙfʴET*%|..3ͨ}L&CNg(;TIJI꜖TLoNݲq=N/g?0QJ.Y,Һ)^{j) h 8'('ԴyUnʁ@1"#+`aΎ"{Yb0Go,a`~eʺl6SVD7W.l\]%Fӛ?~Ʌ7T"V㯫O,nBH$Gä\_>zC=MN<rYLV9 `BY ԽWQ + xg>_pѽ{dVd29)X8 C:N$^}_ H.~,inR0SeM:gwᑏxIKtr`흴X`efXx++w2Lo97n%7T*E[o\4i~D[ $nb܏EMK7yã| +P%8\?jŲg mI]IwSRY%QIK![e KR1K|躶B^O5HP9桪y)v |($UHR0)Hj^՜ A83<QIK{vl{vʊ'>[G) %Hd+K;E_{0<<_JxCB$ӫޡ5+W@RgT"^^bC{?Cnz20D"j CVI݄_]DC$J1O[8+}lY 2P98UZStW-Mؤ^ߜJ#@ V2٢HH(Iyjnü? :ݮzO bb}{ޝۊ[P<<_bBAxx7NbfٽC?ٝ^dB(E"]mƷqs &W:\"T Q$5wb[~hd9CRj*mv`׮ .{NKד=P(4 mI۱/mgA,MFFR߽yKJi[Gt#˖Fꪕ˗"KWBax0~諸}*T'ݺͮCegyx0j̞~j GU?UMuZ4y?)BC2TJ{nAtO J$:m$%d2I8d`$5O,P)HؤLBĠY#A$MbzO?hOJiWnʱG`M@PCݵ[Bg'Nnn iYqUO>}wS 8IwϬ6e5'J农ϒ8I}P* ,M9'I$bL, TFR*KjAP) |^^/ P=&ܓ>Ph2 M=.e# ~g*98+(8lZmúJy.x}BTXj6776^%W*?3MyxjI+ 2euCRɳOsH*{yx[{eI`M(R(ɖ%Ė8v|%؉5SrI5{/w k}gwYq[2J7u{C,GiWݩH8jWlQi,BIܑTa0xdnuK!9VsDn*pO 5E7M -H`n]prAMAN횐~ߴٜR<@ *,&(-_PW]5~V9qG=>inJe+j"ȓ BVH 7g_U[?#i% H7oШ&ba 7QnWǥ{tg.!ZL9Sm28S0 B2 rz|̀>єA  ڽ6wtLH[C HԷJ%uHM MEqAX|2r \]Mg`0(tZm0H"I\@&cqQa04w[|>?&}pV䫚m2PG0ʎB1{f럝2y+W߼knJn>cZ岅 ˾n8uN짏 O,CE> >{n}mni}a @XU*i:?p:]WwӾ1ݫhnJ{zE[StS'}@Q2܏^U1>:ioZA.)ǝ": /S:~)eL90D uqӤPЧ) I?pd2賳lvMB3 A(- ci_U5rRI%d#> f椥]xiCNo4VMLaA4TI /l4 * *MBOA%vK&{ s-mBy\koDDKT RO"*fZ9yE M[;FwHMxzpӝ ?A"PZiVKo4lc_!LRS4Ԥn@Ta :: ;I$Yo0&HHƝ d@";u-+e (jw*@$5 d2YIore.gC]pHjO_MA UA&L(UCjfJؙfFV@RC';X)ytܜgٔ %$XzCX1d@TTJ"DRc4lX85pG-0H0_Ƌ\8ATGfŅMiM!G]n >J# [2^]-YIըUZfCT d47;kBA6jd4Zmp {DT4 ,]ܴ]]BV Pbsfw Cm;y,9{ʖSOOa~z+>vKZX8Nɾct.@pcHnVc2Dn7YͥrqaϧPs2ÐIs?}87GiG>XN'XV< E;j2;;ɺT*͕Jڣѐ֯Cxsz唲R%S%nVM;zFKk?}]ǐ"c^ bɗ}_@p eRi.%|:Ë(%LO#Ÿ21d)*^\}LіO8$-xHRj4+*ϩ_fus{⟮\o7# * uDT vj~2:/T-.47M?7Mv{jՄRϛ_W;B7MTX'J JL4)ɓĩ6"$U$ *Q˴"$ NP1ib8 QgL+Ͻ: P e;pt (Z@ww8]}4MHOe7Ņ׮UWx?ɮt.p*BEkZi_AACE${Y|9S]%mWRvILꎽC4szWmultn RT8Ź|f+vPHj Ό=P`(tfSYqQvJSKn657j`f#Dh4j2y -+tsan&I:C@!y* qӍ.Y>͟|kf&tH9˯PV:wWju?ٶ1q3 H "HܖԖ[o ^&}A. C+ L^LuOV-M$ƹ$Bat#>UPHZIvQ Z[[]URTxƦff&7Z@P#h[A!}y*UaAZ:.HyB0T{8k@I 4TJ慚XYecдR!LO_fUEY7åE0G;VpӿtzI_ )JC#B??s+P2 ,[CR7 鏎FOQ.ggf,kZ~䮁R2Md&xI8C4'+ky&L,>bס &>_?e℺Owx嚸AdT` AFL"z}֕2y7ӢG(Kkf4:|\㈘D/"Je2)0Xp`*|Խjyt1HXiQ$BHR4PX#rR.i4B@O{{0RpֹH*z%{W( #|Nμ..'^ѨӪͩwcH0h '4ȏ\2v6!bh0kqۥN^r圬5+W^<3#㋯v|v_kV.Kڲ?n) c AFCBR̼T9eRx$A: 1eKϞuȱ#OڜN.$iBD"RH*C$UrhIn !7_q8)2JQwd4]Z+,#ЩVVK%>N)I!YJ~r!a(KKR._`kE4C@@VM=Vit5Ph t ÆDI_l*fe^tͪ9YY_O;̩L*-.*5feYY[) *N:%/~A6%\j/^lтNB!tYD,Â, T&m/r}!!FuJ ![zǴIݵ5P?MEȳVOZ-Jѳ33pr&jfdH $:Kѐ9!P ǎI n饋x< pP9YFjJ>?x!w\ %ZP(ȧ9W1d\d3Wڻ-tttu,*ȟU[jҜOwW+) *̘65Ի74Z؉S{!47-B3@yAOe2jTH+IX߸))-;s`ho$uowuX; pPH8=(F-˲LYp=^O<qj@ tHrsI U& 2z%]ph'.DXm6QrlPmhd%>/YRfeA \nP:ϯVIc! ;6@ I;L%&5 8-)\˖}sm6q3 cH*,/ZnUO ^pSZxYs]lA7MI 1J ͗}Y`q$W%MW!+B|>=33*F}&,_|ST(-8^j232`fW¡%%I" z:lq} f$ݧA W/_g 4';Xz{ \Vr-q@`xKj<VJB!/Y8٧ה<|o u7͝Y]rm"rOa(%* VHk)l1C悤(ZTΟSN=c;ݴA ăSvs L*Q)/ Mo͉km%n0H +b  ),#jZu X%U0ԕ+S(Zjgnʜ.V*eU*QWTVyM G`Nz:)w8hH 7 b 2wW? ^ @}e̼\c >MC\HRLJ1] RB +,~vꢂ#Oͷ{gR02L^NNmՌKn۽;,[JW-T;#9,|iQƓlzW2:7MA"4="my;Z,aI*i )T*6T@$ fFlގP_0?T5M.Ϧ(p2)ʝ,;_3"IOX%H, JV0Tcٞ}zM(NQzeed/'q#  +r")@z>S{wM0 7wpӜ,ZdQqq= [Hۛ"r?hS ؈ ?#}vޱ| GG2{2&ׯ ,^%NytlAONX% %RJ%%t:`r &ܔ T(D8ҠsΜѫo=ujoA'xϓ>M 1PZ~U2xQ^MA^u:jCV\.5:u vIUe-=qJTR2Yi$uX/z*^:*;:_l8pmɕE*]T\Tw&`> GE<:$PHPTJ2+#EP̮}uS&Mto|Z̛ & eˁ7s 7E H*7ЍYjj G$AQFM7cQ(<"-+#Â(`4 q0VGDeP+li+* 7(Bb($))E1E*MHj- ^T0 'tةŕT [-/n|.zwI*MFCIqXf8q*nT q LV#T\>fӆS\q[/\ wHP)ify9r_vvA{ru~ 4TDR/Ϭ/`ۆযY;=&RWS#2*3,Ŕ^O`Jh(ޔ+> Ӭ,п%5YHg|,mI*RޛxOHA?aT?PTq0 &ʚҒ4^Msdˤ2 Hj尗D.άza*MϞ7%S&h|57Ƿ_1Iwei<(P HYf͔U.D韼xnt&'G"ߥ;v~?/@%pXf2 )LEMDfgS%JSX38q4j6K]\QL⛑AR*TArT&tH!$8}^>.:0j*t:] OZVS vvvyѻiHRj47Xzjz[[ۇ<{7 M=o_nJQ:_qA7E u@Aq@]](9Xx#p4M/Fz{cF#RTVRQqгg 8C!zҗ+L*('ffiÍP*(f˲ΘEjj"z jx|qI r"?qM-D)#2Tp;Z]TE)Kꄁ`zby'TNԔ*4,Ô=~E?ܼeVLŕjԪ ee?QJvĔn3$"@iiB hkc"<ζۉLS~"}s8hjUHI &\mD}afO|S/ 4G@C5i$aɓgL~f qX'O3l UpHX@ Zy&qKbY1MPX.RZtU3u)[Zn67C!2]S<%EJ˗6ͭ#~ܟP;na]tV4'M)i8:+3$ LAsch&?7VZd4nOmn v:d+^!T%3S-=PҶ 8 <:" !7f_ݔ1BYV- OBeYҞI@ U]礂R%tU>"O :}^v Cf75jeP%%.FIMj*Sק$qiH4xhϩA.[wtNVӫV^<3=/=. 禀\&+).U7Ÿ) *h`HHiqszNɸp.2"I} ̬FWyWjF$㧙(od0XLQ 8.PB2fQA vP[-Zzp J[RiXbٚU+O;f⦰w n*ʊ ,.{Ksg A4Ty`$$R텩's{cHTcF"TW 5'9F0;o./hS)"FRd$IPE'EFTH]R굦@q\;6%&I/\x@(Dn?xI70V,]Srsv]wtM e₂7 ڽYӁn *qiXMLȭ3\+yO?#Vk\nK anFaY^xހn C)PC$L@kѭӸb$HmoIxY:gt0I5F6 5'LEޏ* H*Hv EpI%S2B@' `xBRFYY AaLFDžy;i6+d|}ޜم?jj!?p X} /]0n)Y c C) *lbDˈQGRRa cG;ZTWSGI#J*G$$oDrLo/IPsr$Q55㠧x*0r*Hw`P7|-Chz l$27ݸى&>{7+W=@0|~?ك0tNvkpھqwStSA{P!"!M7gFpa$f狏z (VFY`E&KYU tJ;~%5wT* \n0Mf?s׌#4HOjFޣTJ1gVLtҥ?r@ ٹ~3G $TpӬ p_߼ztքӖ"O&L)IDAT򄀆  I8kfm\$ .@|0I22(a))!KYM Ɨ5T x*Y,8NTJA4n2Yk7U84}!JF3328QҪ5uIU*3k6=\W]-.]Bdvhjkmk:0`1((ঙo/_n  *qIˤu5/l|nʛMMg/\|_(T VlvGSsK$5N7^WMnF7E ARU 7dȂ`?IX_VGiсJQ p1"!^s/ InIDrT*S5e%pHA IԄñbb7\NVW!$U&ekqC-mধΞ#LPw؝7=4U2qr)  /^u$Uv\~^RaaVRLҳ]%(I=2T@h$<=+3$pn>/$6M*)P(;3r~*UӦή7o9q4`n8]ƛM/lXR+߼zA7EACEAR]]W:D"E+j:yNZR76FFFcMRr劃Y䐷DR[d".P BM="H\ 'S/& *H*鴩_z~c]mmGp{PT4;ީw8 QF_*aA'6d<>KsSolnilpA[ QF^n2y]'7{vI]]46@8wa6Kޓw䤱j-j5C0!F(݇Y#&FQJxv'Stř;v4wC\IgTn2ndMUjUx 0GG}2(eezbEm^k DHqay8¤JI7zz(@dexMT4 BRT! b pO8 Á`03#c=;re.5+x_onJz MUi?VhpSA"ȣuUϊ` V>oJ4BLRU$u\ uh7M:Luò DI%ut S\Xfٳ|^m޳p7%aܔ7h&TTD)pz C IU`a;HIH 5E7ˌjE8)TB~ 8vI7-+)~u-s?VCxj ẻfHD7E4Ty$$uRF@STx{~`%uԆ: 7M۵/MJꄗQj*nXvRݼ;wZmpK 0n**UEYOT=5MAR A1DI]vyz@!$uDRGacqSX0*@TJJoG& {K-[?|HM%*LDtSA Js/"/#2ԱKì˝0T Gإj<24vS+W,3 [?Ϸ *//jA7E%Wy3نs?p2 }n6)CzE[Qqgx<f̤8i1F #ozJЀ*VPa\2MΟ7eD?W@ţW.^rIH7}WW- :CEGۑ饎(3O8u'j==$VyO#P1n3ݡ~Hj<Өռ_ $fgf^|ͪY_td$!6L*+)*|z{7^>nø) Ȩ*<$"/ju"CP^cd@SBG.tq9ӧUJYN=7m2h+u R0n 2."#OBR]=I%vu?%u0Cn@TBOH*l2̮>]&ڳĩ3l,n2l/iA7EgPq ! /ipx}[Rt*r^/IըUgU͘.o8vFy9@ ) ȸCih83QRXp|? `] TeU"5qs_+Z;ڔ3!ES&WN n#ǎnn=sGi+ikKTn 2"C|>怕V~$b1 fV_xU[NqTPL_L-W+~Kik9CC&jfήV>|Q?LvV&;MA9`* >\~dUӛNh0T͘|+IOXVzOOImXP.1cL?^gwVwtHJ"Qճf̞Uh?qQw>[a2366 KztSA{ * zpZ-:MA0 " {e|>wJ}L<s&Ls8jG(OpZ!-ݹ󵞞+&K«~p̔e^t}TVO|iڪ?rYx?l)Jno|Wo0yܐnLcP  * IA%*?ȆGIE`Lw%R2yҲ%2ӛozמn%M,).mQ'މ]]B~V zn `CWy|!mR燧Nf7\n7 &b^n2º;$ehCp& \Ina&V/_$33}]h,*>M_>yOI~nzgLAA O NVZ|'$AѤ:C&$sbeKdfdt_T訟jMF:lf!AaAߓnI:UMv\HDoϩ5r:\1K_XrKŎfJ_ܸan[kp8s! nLPG/dg+u?[έ #hA"iY٩Z%rjሄQz 5xg_IEvH7H.ȚL?)+)ٴE y׻`)FPQggNMDM #hd!Hj*ٌsUV-‡Rl>uHC?{9MӑhDBRR)).ڸeK3 OiStSSZU^VgOOA7Ey4@CE'QRWWH +PT}%-ZFM&h$z zڇvWd'Ye@R#Qy$ܴ ϬXDTnۿZ>is:J*eyiOU_?3MA(J=I$g>ʿyoNg ䷐ɜ@.̲/]C-/7&C rkIl>%ZBA:`(Yy,%rr/\0qB$W]47E7UE-½xn}A!PUA0$uO]Uɲlo5 ]M}% <b?vP5Pd:P|薃&'+sт'M(/]|ʻ0z+ ލ_rIHTn h O4 Iퟹ^o??TQ o}T` I" p޼ʩS`}]HvNMe2YAA&[͐n 肆 O: I}wglv 4$n*Pj,r(Ŀ̝3RʲۿyܹH/d2V|"<ꠡ"rGR_AR+nd@rC!ITFüٳfLɤ;w9qL8M))Xo~ΎtSA4TA I]oQ&mØ |$T5F]_WSU% ܔ7SxIMrs6 MA'(J !KK۝>/dqxIPau:mFzzՌ'MIK{p8 -Nd2`2in D PĿtK9mKGWD"ⶻ u?^Vk0\g~ݔ :FaCeBgn  0u߳=IJYd]?ڳ:"756?NB7EyACEdxI]amMZw8,JeNtO6Tmg[4R75n%$gKU:aAyACE$%Ip8n4t=x| ˗.hmk߾1ʵ`nm2&r%# jWAȔީ/3,[_Wj]w y?G} )8쓺B~E7EA(J Hs@_wյkhFcX4 e 6;+$7" w@CEddZVK\.w "Crۇ0TpSZ]\T_#DtSA$)7 HjPR?ΚeZN+MUS&M]Nօ'=7].UPOA0L)"uheJijB/IELO(JY^VN@ eVBA~"2DI]qW>sXaP EYiO_^CAA.PAA m AAy*  p  <\"  h  *  p  <\0L."  CCIq #include #include #include #include #include "../tools/printer_parts.hpp" #include "../tools/svgtools.hpp" using namespace libnest2d; static const std::vector& _parts(std::vector& ret, const TestData& data) { if(ret.empty()) { ret.reserve(data.size()); for(auto& inp : data) ret.emplace_back(inp); } return ret; } static const std::vector& prusaParts() { static std::vector ret; return _parts(ret, PRINTER_PART_POLYGONS); } int main(void /*int argc, char **argv*/) { std::vector input = prusaParts(); size_t bins = libnest2d::nest(input, Box(mm(250), mm(210)), 0, {}, ProgressFunction{[](unsigned cnt) { std::cout << "parts left: " << cnt << std::endl; }}); PackGroup pgrp(bins); for (Item &itm : input) { if (itm.binId() >= 0) pgrp[size_t(itm.binId())].emplace_back(itm); } using SVGWriter = libnest2d::svg::SVGWriter; SVGWriter::Config conf; conf.mm_in_coord_units = mm(); SVGWriter svgw(conf); svgw.setSize(Box(mm(250), mm(210))); svgw.writePackGroup(pgrp); svgw.save("out"); return EXIT_SUCCESS; } libnest2d-5.0.0/include/000077500000000000000000000000001422601530300150215ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/000077500000000000000000000000001422601530300167075ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/backends/000077500000000000000000000000001422601530300204615ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/backends/clipper/000077500000000000000000000000001422601530300221175ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/backends/clipper/CMakeLists.txt000066400000000000000000000015601422601530300246610ustar00rootroot00000000000000add_library(clipperBackend INTERFACE) find_package(clipper 6.1 REQUIRED) target_link_libraries(clipperBackend INTERFACE clipper::clipper) # Clipper backend is not enough on its own, it still need some functions # from Boost geometry find_package(Boost 1.58 REQUIRED) if(TARGET boost::boost) target_link_libraries(clipperBackend INTERFACE boost::boost ) elseif(Boost_INCLUDE_DIRS_FOUND) target_include_directories(clipperBackend INTERFACE $ ) endif() list(APPEND LIBNEST2D_SRCFILES include/libnest2d/backends/clipper/geometries.hpp include/libnest2d/backends/clipper/clipper_polygon.hpp ) set(LIBNEST2D_SRCFILES ${LIBNEST2D_SRCFILES} PARENT_SCOPE) install(TARGETS clipperBackend EXPORT Libnest2DTargets INCLUDES DESTINATION include) set(LIBNEST2D_PUBLIC_PACKAGES "${LIBNEST2D_PUBLIC_PACKAGES};Boost;clipper" CACHE INTERNAL "") libnest2d-5.0.0/include/libnest2d/backends/clipper/clipper_polygon.hpp000066400000000000000000000031251422601530300260360ustar00rootroot00000000000000#ifndef CLIPPER_POLYGON_HPP #define CLIPPER_POLYGON_HPP #include namespace ClipperLib { struct Polygon { Path Contour; Paths Holes; inline Polygon() = default; inline explicit Polygon(const Path& cont): Contour(cont) {} // inline explicit Polygon(const Paths& holes): // Holes(holes) {} inline Polygon(const Path& cont, const Paths& holes): Contour(cont), Holes(holes) {} inline explicit Polygon(Path&& cont): Contour(std::move(cont)) {} // inline explicit Polygon(Paths&& holes): Holes(std::move(holes)) {} inline Polygon(Path&& cont, Paths&& holes): Contour(std::move(cont)), Holes(std::move(holes)) {} }; inline IntPoint& operator +=(IntPoint& p, const IntPoint& pa ) { // This could be done with SIMD p.X += pa.X; p.Y += pa.Y; return p; } inline IntPoint operator+(const IntPoint& p1, const IntPoint& p2) { IntPoint ret = p1; ret += p2; return ret; } inline IntPoint& operator -=(IntPoint& p, const IntPoint& pa ) { p.X -= pa.X; p.Y -= pa.Y; return p; } inline IntPoint operator -(const IntPoint& p ) { IntPoint ret = p; ret.X = -ret.X; ret.Y = -ret.Y; return ret; } inline IntPoint operator-(const IntPoint& p1, const IntPoint& p2) { IntPoint ret = p1; ret -= p2; return ret; } inline IntPoint& operator *=(IntPoint& p, const IntPoint& pa ) { p.X *= pa.X; p.Y *= pa.Y; return p; } inline IntPoint operator*(const IntPoint& p1, const IntPoint& p2) { IntPoint ret = p1; ret *= p2; return ret; } } #endif // CLIPPER_POLYGON_HPP libnest2d-5.0.0/include/libnest2d/backends/clipper/geometries.hpp000066400000000000000000000225551422601530300250040ustar00rootroot00000000000000#ifndef CLIPPER_BACKEND_HPP #define CLIPPER_BACKEND_HPP #include #include #include #include #include #include #include #include "clipper_polygon.hpp" namespace libnest2d { // Aliases for convinience using PointImpl = ClipperLib::IntPoint; using PathImpl = ClipperLib::Path; using HoleStore = ClipperLib::Paths; using PolygonImpl = ClipperLib::Polygon; template<> struct ShapeTag { using Type = PolygonTag; }; template<> struct ShapeTag { using Type = PathTag; }; template<> struct ShapeTag { using Type = PointTag; }; // Type of coordinate units used by Clipper. Enough to specialize for point, // the rest of the types will work (Path, Polygon) template<> struct CoordType { using Type = ClipperLib::cInt; static const constexpr ClipperLib::cInt MM_IN_COORDS = 1000000; }; // Enough to specialize for path, it will work for multishape and Polygon template<> struct PointType { using Type = PointImpl; }; // This is crucial. CountourType refers to itself by default, so we don't have // to secialize for clipper Path. ContourType::Type is PathImpl. template<> struct ContourType { using Type = PathImpl; }; // The holes are contained in Clipper::Paths template<> struct HolesContainer { using Type = ClipperLib::Paths; }; namespace pointlike { // Tell libnest2d how to extract the X coord from a ClipperPoint object template<> inline ClipperLib::cInt x(const PointImpl& p) { return p.X; } // Tell libnest2d how to extract the Y coord from a ClipperPoint object template<> inline ClipperLib::cInt y(const PointImpl& p) { return p.Y; } // Tell libnest2d how to extract the X coord from a ClipperPoint object template<> inline ClipperLib::cInt& x(PointImpl& p) { return p.X; } // Tell libnest2d how to extract the Y coord from a ClipperPoint object template<> inline ClipperLib::cInt& y(PointImpl& p) { return p.Y; } } // Using the libnest2d default area implementation #define DISABLE_BOOST_AREA namespace shapelike { template<> inline void offset(PolygonImpl& sh, TCoord distance, const PolygonTag&) { #define DISABLE_BOOST_OFFSET using ClipperLib::ClipperOffset; using ClipperLib::jtMiter; using ClipperLib::etClosedPolygon; using ClipperLib::Paths; Paths result; try { ClipperOffset offs; offs.AddPath(sh.Contour, jtMiter, etClosedPolygon); offs.AddPaths(sh.Holes, jtMiter, etClosedPolygon); offs.Execute(result, static_cast(distance)); } catch (ClipperLib::clipperException &) { throw GeometryException(GeomErr::OFFSET); } // Offsetting reverts the orientation and also removes the last vertex // so boost will not have a closed polygon. bool found_the_contour = false; for(auto& r : result) { if(ClipperLib::Orientation(r)) { // We don't like if the offsetting generates more than one contour // but throwing would be an overkill. Instead, we should warn the // caller about the inability to create correct geometries if(!found_the_contour) { sh.Contour = std::move(r); ClipperLib::ReversePath(sh.Contour); auto front_p = sh.Contour.front(); sh.Contour.emplace_back(std::move(front_p)); found_the_contour = true; } else { dout() << "Warning: offsetting result is invalid!"; /* TODO warning */ } } else { // TODO If there are multiple contours we can't be sure which hole // belongs to the first contour. (But in this case the situation is // bad enough to let it go...) sh.Holes.emplace_back(std::move(r)); ClipperLib::ReversePath(sh.Holes.back()); auto front_p = sh.Holes.back().front(); sh.Holes.back().emplace_back(std::move(front_p)); } } } template<> inline void offset(PathImpl& sh, TCoord distance, const PathTag&) { PolygonImpl p(std::move(sh)); offset(p, distance, PolygonTag()); sh = p.Contour; } // Tell libnest2d how to make string out of a ClipperPolygon object template<> inline std::string toString(const PolygonImpl& sh) { std::stringstream ss; ss << "Contour {\n"; for(auto p : sh.Contour) { ss << "\t" << p.X << " " << p.Y << "\n"; } ss << "}\n"; for(auto& h : sh.Holes) { ss << "Holes {\n"; for(auto p : h) { ss << "\t{\n"; ss << "\t\t" << p.X << " " << p.Y << "\n"; ss << "\t}\n"; } ss << "}\n"; } return ss.str(); } template<> inline PolygonImpl create(const PathImpl& path, const HoleStore& holes) { PolygonImpl p; p.Contour = path; p.Holes = holes; return p; } template<> inline PolygonImpl create( PathImpl&& path, HoleStore&& holes) { PolygonImpl p; p.Contour.swap(path); p.Holes.swap(holes); return p; } template<> inline const THolesContainer& holes(const PolygonImpl& sh) { return sh.Holes; } template<> inline THolesContainer& holes(PolygonImpl& sh) { return sh.Holes; } template<> inline TContour& hole(PolygonImpl& sh, unsigned long idx) { return sh.Holes[idx]; } template<> inline const TContour& hole(const PolygonImpl& sh, unsigned long idx) { return sh.Holes[idx]; } template<> inline size_t holeCount(const PolygonImpl& sh) { return sh.Holes.size(); } template<> inline PathImpl& contour(PolygonImpl& sh) { return sh.Contour; } template<> inline const PathImpl& contour(const PolygonImpl& sh) { return sh.Contour; } #define DISABLE_BOOST_TRANSLATE template<> inline void translate(PolygonImpl& sh, const PointImpl& offs) { for(auto& p : sh.Contour) { p += offs; } for(auto& hole : sh.Holes) for(auto& p : hole) { p += offs; } } #define DISABLE_BOOST_ROTATE template<> inline void rotate(PolygonImpl& sh, const Radians& rads) { using Coord = TCoord; auto cosa = rads.cos(); auto sina = rads.sin(); for(auto& p : sh.Contour) { p = { static_cast(p.X * cosa - p.Y * sina), static_cast(p.X * sina + p.Y * cosa) }; } for(auto& hole : sh.Holes) for(auto& p : hole) { p = { static_cast(p.X * cosa - p.Y * sina), static_cast(p.X * sina + p.Y * cosa) }; } } } // namespace shapelike #define DISABLE_BOOST_NFP_MERGE inline TMultiShape clipper_execute( ClipperLib::Clipper& clipper, ClipperLib::ClipType clipType, ClipperLib::PolyFillType subjFillType = ClipperLib::pftEvenOdd, ClipperLib::PolyFillType clipFillType = ClipperLib::pftEvenOdd) { TMultiShape retv; ClipperLib::PolyTree result; clipper.Execute(clipType, result, subjFillType, clipFillType); retv.reserve(static_cast(result.Total())); std::function processHole; auto processPoly = [&retv, &processHole](ClipperLib::PolyNode *pptr) { PolygonImpl poly; poly.Contour.swap(pptr->Contour); assert(!pptr->IsHole()); if(!poly.Contour.empty() ) { auto front_p = poly.Contour.front(); auto &back_p = poly.Contour.back(); if(front_p.X != back_p.X || front_p.Y != back_p.X) poly.Contour.emplace_back(front_p); } for(auto h : pptr->Childs) { processHole(h, poly); } retv.push_back(poly); }; processHole = [&processPoly](ClipperLib::PolyNode *pptr, PolygonImpl& poly) { poly.Holes.emplace_back(std::move(pptr->Contour)); assert(pptr->IsHole()); if(!poly.Contour.empty() ) { auto front_p = poly.Contour.front(); auto &back_p = poly.Contour.back(); if(front_p.X != back_p.X || front_p.Y != back_p.X) poly.Contour.emplace_back(front_p); } for(auto c : pptr->Childs) processPoly(c); }; auto traverse = [&processPoly] (ClipperLib::PolyNode *node) { for(auto ch : node->Childs) processPoly(ch); }; traverse(&result); return retv; } namespace nfp { template<> inline TMultiShape merge(const TMultiShape& shapes) { ClipperLib::Clipper clipper(ClipperLib::ioReverseSolution); bool closed = true; bool valid = true; for(auto& path : shapes) { valid &= clipper.AddPath(path.Contour, ClipperLib::ptSubject, closed); for(auto& h : path.Holes) valid &= clipper.AddPath(h, ClipperLib::ptSubject, closed); } if(!valid) throw GeometryException(GeomErr::MERGE); return clipper_execute(clipper, ClipperLib::ctUnion, ClipperLib::pftNegative); } } } #define DISABLE_BOOST_CONVEX_HULL //#define DISABLE_BOOST_SERIALIZE //#define DISABLE_BOOST_UNSERIALIZE #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable: 4244) #pragma warning(disable: 4267) #endif // All other operators and algorithms are implemented with boost #include #ifdef _MSC_VER #pragma warning(pop) #endif #endif // CLIPPER_BACKEND_HPP libnest2d-5.0.0/include/libnest2d/common.hpp000066400000000000000000000125311422601530300207120ustar00rootroot00000000000000#ifndef LIBNEST2D_CONFIG_HPP #define LIBNEST2D_CONFIG_HPP #ifndef NDEBUG #include #endif #include #include #include #include #include #if defined(_MSC_VER) && _MSC_VER <= 1800 || __cplusplus < 201103L #define BP2D_NOEXCEPT #define BP2D_CONSTEXPR #define BP2D_COMPILER_MSVC12 #elif __cplusplus >= 201103L #define BP2D_NOEXCEPT noexcept #define BP2D_CONSTEXPR constexpr #endif /* * Debugging output dout and derr definition */ //#ifndef NDEBUG //# define dout std::cout //# define derr std::cerr //#else //# define dout 0 && std::cout //# define derr 0 && std::cerr //#endif namespace libnest2d { struct DOut { #ifndef NDEBUG std::ostream& out = std::cout; #endif }; struct DErr { #ifndef NDEBUG std::ostream& out = std::cerr; #endif }; template inline DOut&& operator<<( DOut&& out, T&& d) { #ifndef NDEBUG out.out << d; #endif return std::move(out); } template inline DErr&& operator<<( DErr&& out, T&& d) { #ifndef NDEBUG out.out << d; #endif return std::move(out); } inline DOut dout() { return DOut(); } inline DErr derr() { return DErr(); } template< class T > struct remove_cvref { using type = typename std::remove_cv< typename std::remove_reference::type>::type; }; template< class T > using remove_cvref_t = typename remove_cvref::type; template< class T > using remove_ref_t = typename std::remove_reference::type; template using enable_if_t = typename std::enable_if::type; template struct invoke_result { using type = typename std::result_of::type; }; template using invoke_result_t = typename invoke_result::type; /** * A useful little tool for triggering static_assert error messages e.g. when * a mandatory template specialization (implementation) is missing. * * \tparam T A template argument that may come from and outer template method. */ template struct always_false { enum { value = false }; }; const double BP2D_CONSTEXPR Pi = 3.141592653589793238463; // 2*std::acos(0); const double BP2D_CONSTEXPR Pi_2 = 2*Pi; /** * @brief Only for the Radian and Degrees classes to behave as doubles. */ class Double { protected: double val_; public: Double(): val_(double{}) { } Double(double d) : val_(d) { } operator double() const BP2D_NOEXCEPT { return val_; } operator double&() BP2D_NOEXCEPT { return val_; } }; class Degrees; /** * @brief Data type representing radians. It supports conversion to degrees. */ class Radians: public Double { mutable double sin_ = std::nan(""), cos_ = std::nan(""); public: Radians(double rads = Double() ): Double(rads) {} inline Radians(const Degrees& degs); inline operator Degrees(); inline double toDegrees(); inline double sin() const { if(std::isnan(sin_)) { cos_ = std::cos(val_); sin_ = std::sin(val_); } return sin_; } inline double cos() const { if(std::isnan(cos_)) { cos_ = std::cos(val_); sin_ = std::sin(val_); } return cos_; } }; /** * @brief Data type representing degrees. It supports conversion to radians. */ class Degrees: public Double { public: Degrees(double deg = Double()): Double(deg) {} Degrees(const Radians& rads): Double( rads * 180/Pi ) {} inline double toRadians() { return Radians(*this);} }; inline bool operator==(const Degrees& deg, const Radians& rads) { Degrees deg2 = rads; auto diff = std::abs(deg - deg2); return diff < 0.0001; } inline bool operator==(const Radians& rads, const Degrees& deg) { return deg == rads; } inline Radians::operator Degrees() { return *this * 180/Pi; } inline Radians::Radians(const Degrees °s): Double( degs * Pi/180) {} inline double Radians::toDegrees() { return operator Degrees(); } enum class GeomErr : std::size_t { OFFSET, MERGE, NFP }; const std::string ERROR_STR[] = { "Offsetting could not be done! An invalid geometry may have been added.", "Error while merging geometries!", "No fit polygon cannot be calculated." }; class GeometryException: public std::exception { virtual const std::string& errorstr(GeomErr errcode) const BP2D_NOEXCEPT { return ERROR_STR[static_cast(errcode)]; } GeomErr errcode_; public: GeometryException(GeomErr code): errcode_(code) {} GeomErr errcode() const { return errcode_; } const char * what() const BP2D_NOEXCEPT override { return errorstr(errcode_).c_str(); } }; struct ScalarTag {}; struct BigIntTag {}; struct RationalTag {}; template struct _NumTag { using Type = enable_if_t::value, ScalarTag>; }; template using NumTag = typename _NumTag>::Type; /// A local version for abs that is garanteed to work with libnest2d types template inline T abs(const T& v, ScalarTag) { return std::abs(v); } template inline T abs(const T& v) { return abs(v, NumTag()); } template inline T2 cast(const T1& v, ScalarTag, ScalarTag) { return static_cast(v); } template inline T2 cast(const T1& v) { return cast(v, NumTag(), NumTag()); } } #endif // LIBNEST2D_CONFIG_HPP libnest2d-5.0.0/include/libnest2d/geometry_traits.hpp000066400000000000000000001035071422601530300226470ustar00rootroot00000000000000#ifndef GEOMETRY_TRAITS_HPP #define GEOMETRY_TRAITS_HPP #include #include #include #include #include #include #include #include #include #include namespace libnest2d { // Meta tags for different geometry concepts. struct PointTag {}; struct PolygonTag {}; struct PathTag {}; struct MultiPolygonTag {}; struct BoxTag {}; struct CircleTag {}; /// Meta-function to derive the tag of a shape type. template struct ShapeTag { using Type = typename Shape::Tag; }; /// Tag will be used instead of `typename ShapeTag::Type` template using Tag = typename ShapeTag>::Type; /// Meta function to derive the contour type for a polygon which could be itself template struct ContourType { using Type = S; }; /// TContour instead of `typename ContourType::type` template using TContour = typename ContourType>::Type; /// Getting the type of point structure used by a shape. template struct PointType { using Type = typename PointType>::Type; }; /// TPoint as shorthand for `typename PointType::Type`. template using TPoint = typename PointType>::Type; /// Getting the coordinate data type for a geometry class. template struct CoordType { using Type = typename CoordType>::Type; static const constexpr Type MM_IN_COORDS = Type{1}; }; /// TCoord as shorthand for typename `CoordType::Type`. template using TCoord = typename CoordType>::Type; /// Getting the computation type for a certain geometry type. /// It is the coordinate type by default but it is advised that a type with /// larger precision and (or) range is specified. template::value> struct ComputeType {}; /// A compute type is introduced to hold the results of computations on /// coordinates and points. It should be larger in range than the coordinate /// type or the range of coordinates should be limited to not loose precision. template struct ComputeType { using Type = typename ComputeType>::Type; }; /// libnest2d will choose a default compute type for various coordinate types /// if the backend has not specified anything. template struct DoublePrecision { using Type = T; }; template<> struct DoublePrecision { using Type = int16_t; }; template<> struct DoublePrecision { using Type = int32_t; }; template<> struct DoublePrecision { using Type = int64_t; }; template<> struct DoublePrecision { using Type = double; }; template<> struct DoublePrecision { using Type = long double; }; template struct ComputeType { using Type = typename DoublePrecision::Type; }; /// TCompute shorthand for `typename ComputeType::Type` template using TCompute = typename ComputeType>::Type; /// A meta function to derive a container type for holes in a polygon template struct HolesContainer { using Type = std::vector>; }; /// Shorthand for `typename HolesContainer::Type` template using THolesContainer = typename HolesContainer>::Type; /* * TContour, TPoint, TCoord and TCompute should be usable for any type for which * it makes sense. For example, the point type could be derived from the contour, * the polygon and (or) the multishape as well. The coordinate type also and * including the point type. TCoord, TCoord, TCoord are * all valid types and derives the coordinate type of template argument Polygon, * Path and Point. This is also true for TCompute, but it can also take the * coordinate type as argument. */ /* * A Multi shape concept is also introduced. A multi shape is something that * can contain the result of an operation where the input is one polygon and * the result could be many polygons or path -> paths. The MultiShape should be * a container type. If the backend does not specialize the MultiShape template, * a default multi shape container will be used. */ /// The default multi shape container. template struct DefaultMultiShape: public std::vector { using Tag = MultiPolygonTag; template DefaultMultiShape(Args&&...args): std::vector(std::forward(args)...) {} }; /// The MultiShape Type trait which gets the container type for a geometry type. template struct MultiShape { using Type = DefaultMultiShape; }; /// use TMultiShape instead of `typename MultiShape::Type` template using TMultiShape = typename MultiShape>::Type; // A specialization of ContourType to work with the default multishape type template struct ContourType> { using Type = typename ContourType::Type; }; enum class Orientation { CLOCKWISE, COUNTER_CLOCKWISE }; template struct OrientationType { // Default Polygon orientation that the library expects static const Orientation Value = Orientation::CLOCKWISE; }; template inline /*constexpr*/ bool is_clockwise() { return OrientationType>::Value == Orientation::CLOCKWISE; } /** * \brief A point pair base class for other point pairs (segment, box, ...). * \tparam P The actual point type to use. */ template struct PointPair { P p1; P p2; }; /** * \brief An abstraction of a box; */ template class _Box: PointPair

{ using PointPair

::p1; using PointPair

::p2; public: using Tag = BoxTag; using PointType = P; inline _Box(const P& center = {TCoord

(0), TCoord

(0)}): _Box(TCoord

(0), TCoord

(0), center) {} inline _Box(const P& p, const P& pp): PointPair

({p, pp}) {} inline _Box(TCoord

width, TCoord

height, const P& p = {TCoord

(0), TCoord

(0)});/*: _Box(p, P{width, height}) {}*/ inline const P& minCorner() const BP2D_NOEXCEPT { return p1; } inline const P& maxCorner() const BP2D_NOEXCEPT { return p2; } inline P& minCorner() BP2D_NOEXCEPT { return p1; } inline P& maxCorner() BP2D_NOEXCEPT { return p2; } inline TCoord

width() const BP2D_NOEXCEPT; inline TCoord

height() const BP2D_NOEXCEPT; inline P center() const BP2D_NOEXCEPT; template> inline Unit area() const BP2D_NOEXCEPT { return Unit(width())*height(); } static inline _Box infinite(const P ¢er = {TCoord

(0), TCoord

(0)}); }; template struct PointType<_Box> { using Type = typename _Box::PointType; }; template class _Circle { P center_; double radius_ = 0; public: using Tag = CircleTag; using PointType = P; _Circle() = default; _Circle(const P& center, double r): center_(center), radius_(r) {} inline const P& center() const BP2D_NOEXCEPT { return center_; } inline void center(const P& c) { center_ = c; } inline double radius() const BP2D_NOEXCEPT { return radius_; } inline void radius(double r) { radius_ = r; } inline double area() const BP2D_NOEXCEPT { return Pi_2 * radius_ * radius_; } }; template struct PointType<_Circle> { using Type = typename _Circle::PointType; }; /** * \brief An abstraction of a directed line segment with two points. */ template class _Segment: PointPair

{ using PointPair

::p1; using PointPair

::p2; mutable Radians angletox_ = std::nan(""); public: using PointType = P; inline _Segment() = default; inline _Segment(const P& p, const P& pp): PointPair

({p, pp}) {} /** * @brief Get the first point. * @return Returns the starting point. */ inline const P& first() const BP2D_NOEXCEPT { return p1; } /** * @brief The end point. * @return Returns the end point of the segment. */ inline const P& second() const BP2D_NOEXCEPT { return p2; } inline void first(const P& p) BP2D_NOEXCEPT { angletox_ = std::nan(""); p1 = p; } inline void second(const P& p) BP2D_NOEXCEPT { angletox_ = std::nan(""); p2 = p; } /// Returns the angle measured to the X (horizontal) axis. inline Radians angleToXaxis() const; /// The length of the segment in the measure of the coordinate system. template> inline Unit sqlength() const; }; template struct PointType<_Segment> { using Type = typename _Circle::PointType; }; // This struct serves almost as a namespace. The only difference is that is can // used in friend declarations. namespace pointlike { template inline TCoord

x(const P& p) { return p.x(); } template inline TCoord

y(const P& p) { return p.y(); } template inline TCoord

& x(P& p) { return p.x(); } template inline TCoord

& y(P& p) { return p.y(); } template> inline Unit squaredDistance(const P& p1, const P& p2) { auto x1 = Unit(x(p1)), y1 = Unit(y(p1)), x2 = Unit(x(p2)), y2 = Unit(y(p2)); Unit a = (x2 - x1), b = (y2 - y1); return a * a + b * b; } template inline double distance(const P& p1, const P& p2) { return std::sqrt(squaredDistance(p1, p2)); } // create perpendicular vector template inline Pt perp(const Pt& p) { return Pt(y(p), -x(p)); } template> inline Unit dotperp(const Pt& a, const Pt& b) { return Unit(x(a)) * Unit(y(b)) - Unit(y(a)) * Unit(x(b)); } // dot product template> inline Unit dot(const Pt& a, const Pt& b) { return Unit(x(a)) * x(b) + Unit(y(a)) * y(b); } // squared vector magnitude template> inline Unit magnsq(const Pt& p) { return Unit(x(p)) * x(p) + Unit(y(p)) * y(p); } template> inline std::pair horizontalDistance( const P& p, const _Segment

& s) { namespace pl = pointlike; auto x = Unit(pl::x(p)), y = Unit(pl::y(p)); auto x1 = Unit(pl::x(s.first())), y1 = Unit(pl::y(s.first())); auto x2 = Unit(pl::x(s.second())), y2 = Unit(pl::y(s.second())); Unit ret; if( (y < y1 && y < y2) || (y > y1 && y > y2) ) return {0, false}; if ((y == y1 && y == y2) && (x > x1 && x > x2)) ret = std::min( x-x1, x -x2); else if( (y == y1 && y == y2) && (x < x1 && x < x2)) ret = -std::min(x1 - x, x2 - x); else if(y == y1 && y == y2) ret = 0; else ret = x - x1 + (x1 - x2)*(y1 - y)/(y1 - y2); return {ret, true}; } template> inline std::pair verticalDistance( const P& p, const _Segment

& s) { namespace pl = pointlike; auto x = Unit(pl::x(p)), y = Unit(pl::y(p)); auto x1 = Unit(pl::x(s.first())), y1 = Unit(pl::y(s.first())); auto x2 = Unit(pl::x(s.second())), y2 = Unit(pl::y(s.second())); Unit ret; if( (x < x1 && x < x2) || (x > x1 && x > x2) ) return {0, false}; if ((x == x1 && x == x2) && (y > y1 && y > y2)) ret = std::min( y-y1, y -y2); else if( (x == x1 && x == x2) && (y < y1 && y < y2)) ret = -std::min(y1 - y, y2 - y); else if(x == x1 && x == x2) ret = 0; else ret = y - y1 + (y1 - y2)*(x1 - x)/(x1 - x2); return {ret, true}; } } template TCoord

_Box

::width() const BP2D_NOEXCEPT { return pointlike::x(maxCorner()) - pointlike::x(minCorner()); } template TCoord

_Box

::height() const BP2D_NOEXCEPT { return pointlike::y(maxCorner()) - pointlike::y(minCorner()); } template TCoord

getX(const P& p) { return pointlike::x

(p); } template TCoord

getY(const P& p) { return pointlike::y

(p); } template void setX(P& p, const TCoord

& val) { pointlike::x

(p) = val; } template void setY(P& p, const TCoord

& val) { pointlike::y

(p) = val; } template inline Radians _Segment

::angleToXaxis() const { if(std::isnan(static_cast(angletox_))) { TCoord

dx = getX(second()) - getX(first()); TCoord

dy = getY(second()) - getY(first()); double a = std::atan2(dy, dx); auto s = std::signbit(a); if(s) a += Pi_2; angletox_ = a; } return angletox_; } template template inline Unit _Segment

::sqlength() const { return pointlike::squaredDistance(first(), second()); } template enable_if_t::value, T> modulo(const T &v, const T &m) { return 0; } template enable_if_t::value, T> modulo(const T &v, const T &m) { return v % m; } template inline _Box

::_Box(TCoord

width, TCoord

height, const P & center) : PointPair

({center - P{width / 2, height / 2}, center + P{width / 2, height / 2} + P{modulo(width, TCoord

(2)), modulo(height, TCoord

(2))}}) {} template inline _Box

_Box

::infinite(const P& center) { using C = TCoord

; _Box

ret; // It is important for Mx and My to be strictly less than half of the // range of type C. width(), height() and area() will not overflow this way. C Mx = C((std::numeric_limits::lowest() + 2 * getX(center)) / 2.01); C My = C((std::numeric_limits::lowest() + 2 * getY(center)) / 2.01); ret.maxCorner() = center - P{Mx, My}; ret.minCorner() = center + P{Mx, My}; return ret; } template inline P _Box

::center() const BP2D_NOEXCEPT { auto& minc = minCorner(); auto& maxc = maxCorner(); using Coord = TCoord

; P ret = { // No rounding here, we dont know if these are int coords Coord( (getX(minc) + getX(maxc)) / Coord(2) ), Coord( (getY(minc) + getY(maxc)) / Coord(2) ) }; return ret; } enum class Formats { WKT, SVG }; // This struct serves as a namespace. The only difference is that it can be // used in friend declarations and can be aliased at class scope. namespace shapelike { template inline S create(const TContour& contour, const THolesContainer& holes) { return S(contour, holes); } template inline S create(TContour&& contour, THolesContainer&& holes) { return S(contour, holes); } template inline S create(const TContour& contour) { return create(contour, {}); } template inline S create(TContour&& contour) { return create(contour, {}); } template inline THolesContainer& holes(S& /*sh*/) { static THolesContainer empty; return empty; } template inline const THolesContainer& holes(const S& /*sh*/) { static THolesContainer empty; return empty; } template inline TContour& hole(S& sh, unsigned long idx) { return holes(sh)[idx]; } template inline const TContour& hole(const S& sh, unsigned long idx) { return holes(sh)[idx]; } template inline size_t holeCount(const S& sh) { return holes(sh).size(); } template inline TContour& contour(S& sh) { static_assert(always_false::value, "shapelike::contour() unimplemented!"); return sh; } template inline const TContour& contour(const S& sh) { static_assert(always_false::value, "shapelike::contour() unimplemented!"); return sh; } // Optional, does nothing by default template inline void reserve(RawPath& p, size_t vertex_capacity, const PathTag&) { p.reserve(vertex_capacity); } template inline void addVertex(S& sh, const PathTag&, Args...args) { sh.emplace_back(std::forward(args)...); } template inline void foreachVertex(S& sh, Fn fn, const PathTag&) { std::for_each(sh.begin(), sh.end(), fn); } template inline typename S::iterator begin(S& sh, const PathTag&) { return sh.begin(); } template inline typename S::iterator end(S& sh, const PathTag&) { return sh.end(); } template inline typename S::const_iterator cbegin(const S& sh, const PathTag&) { return sh.cbegin(); } template inline typename S::const_iterator cend(const S& sh, const PathTag&) { return sh.cend(); } template inline std::string toString(const S& /*sh*/) { return ""; } template inline std::string serialize(const S& /*sh*/, double /*scale*/=1) { static_assert(always_false::value, "shapelike::serialize() unimplemented!"); return ""; } template inline void unserialize(S& /*sh*/, const std::string& /*str*/) { static_assert(always_false::value, "shapelike::unserialize() unimplemented!"); } template inline Unit area(const Cntr& poly, const PathTag& ); template inline bool intersects(const S& /*sh*/, const S& /*sh*/) { static_assert(always_false::value, "shapelike::intersects() unimplemented!"); return false; } template inline bool isInside(const TGuest&, const THost&, const PointTag&, const PolygonTag&) { static_assert(always_false::value, "shapelike::isInside(point, path) unimplemented!"); return false; } template inline bool isInside(const TGuest&, const THost&, const PolygonTag&, const PolygonTag&) { static_assert(always_false::value, "shapelike::isInside(shape, shape) unimplemented!"); return false; } template inline bool touches( const S& /*shape*/, const S& /*shape*/) { static_assert(always_false::value, "shapelike::touches(shape, shape) unimplemented!"); return false; } template inline bool touches( const TPoint& /*point*/, const S& /*shape*/) { static_assert(always_false::value, "shapelike::touches(point, shape) unimplemented!"); return false; } template inline _Box> boundingBox(const S& /*sh*/, const PathTag&) { static_assert(always_false::value, "shapelike::boundingBox(shape) unimplemented!"); } template inline _Box> boundingBox(const RawShapes& /*sh*/, const MultiPolygonTag&) { static_assert(always_false::value, "shapelike::boundingBox(shapes) unimplemented!"); } template inline S convexHull(const S& sh, const PathTag&); template inline S convexHull(const RawShapes& sh, const MultiPolygonTag&); template inline void rotate(S& /*sh*/, const Radians& /*rads*/) { static_assert(always_false::value, "shapelike::rotate() unimplemented!"); } template inline void translate(S& /*sh*/, const P& /*offs*/) { static_assert(always_false::value, "shapelike::translate() unimplemented!"); } template inline void offset(S& /*sh*/, TCoord /*distance*/, const PathTag&) { dout() << "The current geometry backend does not support offsetting!\n"; } template inline void offset(S& sh, TCoord distance, const PolygonTag&) { offset(contour(sh), distance); for(auto &h : holes(sh)) offset(h, -distance); } template inline std::pair isValid(const S& /*sh*/) { return {false, "shapelike::isValid() unimplemented!"}; } template inline bool isConvex(const RawPath& sh, const PathTag&) { using Vertex = TPoint; auto first = begin(sh); auto middle = std::next(first); auto last = std::next(middle); using CVrRef = const Vertex&; auto zcrossproduct = [](CVrRef k, CVrRef k1, CVrRef k2) { auto dx1 = getX(k1) - getX(k); auto dy1 = getY(k1) - getY(k); auto dx2 = getX(k2) - getX(k1); auto dy2 = getY(k2) - getY(k1); return dx1*dy2 - dy1*dx2; }; auto firstprod = zcrossproduct( *(std::prev(std::prev(end(sh)))), *first, *middle ); bool ret = true; bool frsign = firstprod > 0; while(last != end(sh)) { auto &k = *first, &k1 = *middle, &k2 = *last; auto zc = zcrossproduct(k, k1, k2); ret &= frsign == (zc > 0); ++first; ++middle; ++last; } return ret; } // ***************************************************************************** // No need to implement these // ***************************************************************************** template inline typename TContour::iterator begin(S& sh, const PolygonTag&) { return begin(contour(sh), PathTag()); } template // Tag dispatcher inline auto begin(S& sh) -> decltype(begin(sh, Tag())) { return begin(sh, Tag()); } template inline typename TContour::const_iterator cbegin(const S& sh, const PolygonTag&) { return cbegin(contour(sh), PathTag()); } template // Tag dispatcher inline auto cbegin(const S& sh) -> decltype(cbegin(sh, Tag())) { return cbegin(sh, Tag()); } template inline typename TContour::iterator end(S& sh, const PolygonTag&) { return end(contour(sh), PathTag()); } template // Tag dispatcher inline auto end(S& sh) -> decltype(begin(sh, Tag())) { return end(sh, Tag()); } template inline typename TContour::const_iterator cend(const S& sh, const PolygonTag&) { return cend(contour(sh), PathTag()); } template // Tag dispatcher inline auto cend(const S& sh) -> decltype(cend(sh, Tag())) { return cend(sh, Tag()); } template std::reverse_iterator _backward(It iter) { return std::reverse_iterator(iter); } template auto rbegin(P& p) -> decltype(_backward(end(p))) { return _backward(end(p)); } template auto rcbegin(const P& p) -> decltype(_backward(end(p))) { return _backward(end(p)); } template auto rend(P& p) -> decltype(_backward(begin(p))) { return _backward(begin(p)); } template auto rcend(const P& p) -> decltype(_backward(cbegin(p))) { return _backward(cbegin(p)); } template TPoint

front(const P& p) { return *shapelike::cbegin(p); } template TPoint

back (const P& p) { return *backward(shapelike::cend(p)); } // Optional, does nothing by default template inline void reserve(S& sh, size_t vertex_capacity, const PolygonTag&) { reserve(contour(sh), vertex_capacity, PathTag()); } template // Tag dispatcher inline void reserve(T& sh, size_t vertex_capacity) { reserve(sh, vertex_capacity, Tag()); } template inline void addVertex(S& sh, const PolygonTag&, Args...args) { addVertex(contour(sh), PathTag(), std::forward(args)...); } template // Tag dispatcher inline void addVertex(S& sh, Args...args) { addVertex(sh, Tag(), std::forward(args)...); } template inline _Box> boundingBox(const S& poly, const PolygonTag&) { return boundingBox(contour(poly), PathTag()); } template inline Box boundingBox(const Box& box, const BoxTag& ) { return box; } template inline _Box boundingBox( const Circle& circ, const CircleTag&) { using Point = typename Circle::PointType; using Coord = TCoord; Point pmin = { static_cast(getX(circ.center()) - circ.radius()), static_cast(getY(circ.center()) - circ.radius()) }; Point pmax = { static_cast(getX(circ.center()) + circ.radius()), static_cast(getY(circ.center()) + circ.radius()) }; return {pmin, pmax}; } template // Dispatch function inline _Box> boundingBox(const S& sh) { return boundingBox(sh, Tag() ); } template _Box

boundingBox(const _Box

& bb1, const _Box

& bb2 ) { auto& pminc = bb1.minCorner(); auto& pmaxc = bb1.maxCorner(); auto& iminc = bb2.minCorner(); auto& imaxc = bb2.maxCorner(); P minc, maxc; setX(minc, std::min(getX(pminc), getX(iminc))); setY(minc, std::min(getY(pminc), getY(iminc))); setX(maxc, std::max(getX(pmaxc), getX(imaxc))); setY(maxc, std::max(getY(pmaxc), getY(imaxc))); return _Box

(minc, maxc); } template _Box> boundingBox(const S1 &s1, const S2 &s2) { return boundingBox(boundingBox(s1), boundingBox(s2)); } template inline double area(const Box& box, const BoxTag& ) { return box.template area(); } template inline double area(const Circle& circ, const CircleTag& ) { return circ.area(); } template inline Unit area(const Cntr& poly, const PathTag& ) { namespace sl = shapelike; if (sl::cend(poly) - sl::cbegin(poly) < 3) return 0.0; Unit a = 0; for (auto i = sl::cbegin(poly), j = std::prev(sl::cend(poly)); i < sl::cend(poly); ++i) { auto xj = Unit(getX(*j)), yj = Unit(getY(*j)); auto xi = Unit(getX(*i)), yi = Unit(getY(*i)); a += (xj + xi) * (yj - yi); j = i; } a /= 2; return is_clockwise() ? a : -a; } template inline double area(const S& poly, const PolygonTag& ) { auto hls = holes(poly); return std::accumulate(hls.begin(), hls.end(), area(contour(poly), PathTag()), [](double a, const TContour &h){ return a + area(h, PathTag()); }); } template // Dispatching function inline double area(const S& sh) { return area(sh, Tag()); } template inline double area(const RawShapes& shapes, const MultiPolygonTag&) { using S = typename RawShapes::value_type; return std::accumulate(shapes.begin(), shapes.end(), 0.0, [](double a, const S& b) { return a += area(b); }); } template inline S convexHull(const S& sh, const PolygonTag&) { return create(convexHull(contour(sh), PathTag())); } template inline auto convexHull(const S& sh) -> decltype(convexHull(sh, Tag())) // TODO: C++14 could deduce { return convexHull(sh, Tag()); } template inline S convexHull(const S& sh, const PathTag&) { using Unit = TCompute; using Point = TPoint; namespace sl = shapelike; size_t edges = sl::cend(sh) - sl::cbegin(sh); if(edges <= 3) return {}; bool closed = false; std::vector U, L; U.reserve(1 + edges / 2); L.reserve(1 + edges / 2); std::vector pts; pts.reserve(edges); std::copy(sl::cbegin(sh), sl::cend(sh), std::back_inserter(pts)); auto fpt = pts.front(), lpt = pts.back(); if(getX(fpt) == getX(lpt) && getY(fpt) == getY(lpt)) { closed = true; pts.pop_back(); } std::sort(pts.begin(), pts.end(), [](const Point& v1, const Point& v2) { Unit x1 = getX(v1), x2 = getX(v2), y1 = getY(v1), y2 = getY(v2); return x1 == x2 ? y1 < y2 : x1 < x2; }); auto dir = [](const Point& p, const Point& q, const Point& r) { return (Unit(getY(q)) - getY(p)) * (Unit(getX(r)) - getX(p)) - (Unit(getX(q)) - getX(p)) * (Unit(getY(r)) - getY(p)); }; auto ik = pts.begin(); while(ik != pts.end()) { while(U.size() > 1 && dir(U[U.size() - 2], U.back(), *ik) <= 0) U.pop_back(); while(L.size() > 1 && dir(L[L.size() - 2], L.back(), *ik) >= 0) L.pop_back(); U.emplace_back(*ik); L.emplace_back(*ik); ++ik; } S ret; reserve(ret, U.size() + L.size()); if(is_clockwise()) { for(auto it = U.begin(); it != std::prev(U.end()); ++it) addVertex(ret, *it); for(auto it = L.rbegin(); it != std::prev(L.rend()); ++it) addVertex(ret, *it); if(closed) addVertex(ret, *std::prev(L.rend())); } else { for(auto it = L.begin(); it != std::prev(L.end()); ++it) addVertex(ret, *it); for(auto it = U.rbegin(); it != std::prev(U.rend()); ++it) addVertex(ret, *it); if(closed) addVertex(ret, *std::prev(U.rend())); } return ret; } template inline S convexHull(const RawShapes& sh, const MultiPolygonTag&) { namespace sl = shapelike; S cntr; for(auto& poly : sh) for(auto it = sl::cbegin(poly); it != sl::cend(poly); ++it) addVertex(cntr, *it); return convexHull(cntr, Tag()); } template inline bool isInside(const TP& point, const TC& circ, const PointTag&, const CircleTag&) { auto r = circ.radius(); return pointlike::squaredDistance(point, circ.center()) < r * r; } template inline bool isInside(const TP& point, const TB& box, const PointTag&, const BoxTag&) { auto px = getX(point); auto py = getY(point); auto minx = getX(box.minCorner()); auto miny = getY(box.minCorner()); auto maxx = getX(box.maxCorner()); auto maxy = getY(box.maxCorner()); return px > minx && px < maxx && py > miny && py < maxy; } template inline bool isInside(const S& sh, const TC& circ, const PolygonTag&, const CircleTag&) { return std::all_of(cbegin(sh), cend(sh), [&circ](const TPoint& p) { return isInside(p, circ, PointTag(), CircleTag()); }); } template inline bool isInside(const TB& box, const TC& circ, const BoxTag&, const CircleTag&) { return isInside(box.minCorner(), circ, PointTag(), CircleTag()) && isInside(box.maxCorner(), circ, PointTag(), CircleTag()); } template inline bool isInside(const TBGuest& ibb, const TBHost& box, const BoxTag&, const BoxTag&) { auto iminX = getX(ibb.minCorner()); auto imaxX = getX(ibb.maxCorner()); auto iminY = getY(ibb.minCorner()); auto imaxY = getY(ibb.maxCorner()); auto minX = getX(box.minCorner()); auto maxX = getX(box.maxCorner()); auto minY = getY(box.minCorner()); auto maxY = getY(box.maxCorner()); return iminX >= minX && imaxX <= maxX && iminY >= minY && imaxY <= maxY; } template inline bool isInside(const S& poly, const TB& box, const PolygonTag&, const BoxTag&) { return isInside(boundingBox(poly), box, BoxTag(), BoxTag()); } template inline bool isInside(const TGuest& guest, const THost& host) { return isInside(guest, host, Tag(), Tag()); } template // Potential O(1) implementation may exist inline TPoint& vertex(S& sh, unsigned long idx, const PolygonTag&) { return *(shapelike::begin(contour(sh)) + idx); } template // Potential O(1) implementation may exist inline TPoint& vertex(S& sh, unsigned long idx, const PathTag&) { return *(shapelike::begin(sh) + idx); } template // Potential O(1) implementation may exist inline TPoint& vertex(S& sh, unsigned long idx) { return vertex(sh, idx, Tag()); } template // Potential O(1) implementation may exist inline const TPoint& vertex(const S& sh, unsigned long idx, const PolygonTag&) { return *(shapelike::cbegin(contour(sh)) + idx); } template // Potential O(1) implementation may exist inline const TPoint& vertex(const S& sh, unsigned long idx, const PathTag&) { return *(shapelike::cbegin(sh) + idx); } template // Potential O(1) implementation may exist inline const TPoint& vertex(const S& sh, unsigned long idx) { return vertex(sh, idx, Tag()); } template inline size_t contourVertexCount(const S& sh) { return shapelike::cend(sh) - shapelike::cbegin(sh); } template inline void foreachVertex(S& sh, Fn fn, const PolygonTag&) { foreachVertex(contour(sh), fn, PathTag()); for(auto& h : holes(sh)) foreachVertex(h, fn, PathTag()); } template inline void foreachVertex(S& sh, Fn fn) { foreachVertex(sh, fn, Tag()); } template inline bool isConvex(const Poly& sh, const PolygonTag&) { bool convex = true; convex &= isConvex(contour(sh), PathTag()); convex &= holeCount(sh) == 0; return convex; } template inline bool isConvex(const S& sh) // dispatch { return isConvex(sh, Tag()); } template inline void offset(Box& bb, TCoord d, const BoxTag&) { TPoint md{d, d}; bb.minCorner() -= md; bb.maxCorner() += md; } template inline void offset(C& circ, TCoord d, const CircleTag&) { circ.radius(circ.radius() + double(d)); } // Dispatch function template inline void offset(S& sh, TCoord d) { offset(sh, d, Tag()); } } #define DECLARE_MAIN_TYPES(T) \ using Polygon = T; \ using Point = TPoint; \ using Coord = TCoord; \ using Contour = TContour; \ using Box = _Box; \ using Circle = _Circle; \ using Segment = _Segment; \ using Polygons = TMultiShape namespace sl = shapelike; namespace pl = pointlike; } #endif // GEOMETRY_TRAITS_HPP libnest2d-5.0.0/include/libnest2d/geometry_traits_nfp.hpp000066400000000000000000000637641422601530300235240ustar00rootroot00000000000000#ifndef GEOMETRIES_NOFITPOLYGON_HPP #define GEOMETRIES_NOFITPOLYGON_HPP #include #include #include #include #include namespace libnest2d { namespace __nfp { // Do not specialize this... template> inline bool _vsort(const TPoint& v1, const TPoint& v2) { Unit x1 = getX(v1), x2 = getX(v2), y1 = getY(v1), y2 = getY(v2); return y1 == y2 ? x1 < x2 : y1 < y2; } template> inline void buildPolygon(const EdgeList& edgelist, RawShape& rpoly, Vertex& top_nfp) { namespace sl = shapelike; auto& rsh = sl::contour(rpoly); sl::reserve(rsh, 2*edgelist.size()); // Add the two vertices from the first edge into the final polygon. sl::addVertex(rsh, edgelist.front().first()); sl::addVertex(rsh, edgelist.front().second()); // Sorting function for the nfp reference vertex search auto& cmp = _vsort; // the reference (rightmost top) vertex so far top_nfp = *std::max_element(sl::cbegin(rsh), sl::cend(rsh), cmp ); auto tmp = std::next(sl::begin(rsh)); // Construct final nfp by placing each edge to the end of the previous for(auto eit = std::next(edgelist.begin()); eit != edgelist.end(); ++eit) { auto d = *tmp - eit->first(); Vertex p = eit->second() + d; sl::addVertex(rsh, p); // Set the new reference vertex if(cmp(top_nfp, p)) top_nfp = p; tmp = std::next(tmp); } } template void advance(Iterator& it, Container& cont, bool direction) { int dir = direction ? 1 : -1; if(dir < 0 && it == cont.begin()) it = std::prev(cont.end()); else it += dir; if(dir > 0 && it == cont.end()) it = cont.begin(); } } /// A collection of static methods for handling the no fit polygon creation. namespace nfp { const double BP2D_CONSTEXPR TwoPi = 2*Pi; /// The complexity level of a polygon that an NFP implementation can handle. enum class NfpLevel: unsigned { CONVEX_ONLY, ONE_CONVEX, BOTH_CONCAVE, ONE_CONVEX_WITH_HOLES, BOTH_CONCAVE_WITH_HOLES }; template using NfpResult = std::pair>; template struct MaxNfpLevel { static const BP2D_CONSTEXPR NfpLevel value = NfpLevel::CONVEX_ONLY; }; // Shorthand for a pile of polygons template using Shapes = TMultiShape; /** * Merge a bunch of polygons with the specified additional polygon. * * \tparam RawShape the Polygon data type. * \param shc The pile of polygons that will be unified with sh. * \param sh A single polygon to unify with shc. * * \return A set of polygons that is the union of the input polygons. Note that * mostly it will be a set containing only one big polygon but if the input * polygons are disjunct than the resulting set will contain more polygons. */ template inline RawShapes merge(const RawShapes& /*shc*/) { static_assert(always_false::value, "Nfp::merge(shapes, shape) unimplemented!"); } /** * Merge a bunch of polygons with the specified additional polygon. * * \tparam RawShape the Polygon data type. * \param shc The pile of polygons that will be unified with sh. * \param sh A single polygon to unify with shc. * * \return A set of polygons that is the union of the input polygons. Note that * mostly it will be a set containing only one big polygon but if the input * polygons are disjunct than the resulting set will contain more polygons. */ template inline TMultiShape merge(const TMultiShape& shc, const RawShape& sh) { auto m = nfp::merge(shc); m.emplace_back(sh); return nfp::merge(m); } /** * Get the vertex of the polygon that is at the lowest values (bottom) in the Y * axis and if there are more than one vertices on the same Y coordinate than * the result will be the leftmost (with the highest X coordinate). */ template inline TPoint leftmostDownVertex(const RawShape& sh) { // find min x and min y vertex auto it = std::min_element(shapelike::cbegin(sh), shapelike::cend(sh), __nfp::_vsort); return it == shapelike::cend(sh) ? TPoint() : *it;; } /** * Get the vertex of the polygon that is at the highest values (top) in the Y * axis and if there are more than one vertices on the same Y coordinate than * the result will be the rightmost (with the lowest X coordinate). */ template TPoint rightmostUpVertex(const RawShape& sh) { // find max x and max y vertex auto it = std::max_element(shapelike::cbegin(sh), shapelike::cend(sh), __nfp::_vsort); return it == shapelike::cend(sh) ? TPoint() : *it; } /** * A method to get a vertex from a polygon that always maintains a relative * position to the coordinate system: It is always the rightmost top vertex. * * This way it does not matter in what order the vertices are stored, the * reference will be always the same for the same polygon. */ template inline TPoint referenceVertex(const RawShape& sh) { return rightmostUpVertex(sh); } /** * The "trivial" Cuninghame-Green implementation of NFP for convex polygons. * * You can use this even if you provide implementations for the more complex * cases (Through specializing the the NfpImpl struct). Currently, no other * cases are covered in the library. * * Complexity should be no more than nlogn (std::sort) in the number of edges * of the input polygons. * * \tparam RawShape the Polygon data type. * \param sh The stationary polygon * \param cother The orbiting polygon * \return Returns a pair of the NFP and its reference vertex of the two input * polygons which have to be strictly convex. The resulting NFP is proven to be * convex as well in this case. * */ template inline NfpResult nfpConvexOnly(const RawShape& sh, const RawShape& other) { using Vertex = TPoint; using Edge = _Segment; namespace sl = shapelike; RawShape rsh; // Final nfp placeholder Vertex top_nfp; std::vector edgelist; auto cap = sl::contourVertexCount(sh) + sl::contourVertexCount(other); // Reserve the needed memory edgelist.reserve(cap); sl::reserve(rsh, static_cast(cap)); { // place all edges from sh into edgelist auto first = sl::cbegin(sh); auto next = std::next(first); while(next != sl::cend(sh)) { edgelist.emplace_back(*(first), *(next)); ++first; ++next; } } { // place all edges from other into edgelist auto first = sl::cbegin(other); auto next = std::next(first); while(next != sl::cend(other)) { edgelist.emplace_back(*(next), *(first)); ++first; ++next; } } std::sort(edgelist.begin(), edgelist.end(), [](const Edge& e1, const Edge& e2) { Vertex ax(1, 0); // Unit vector for the X axis // get cectors from the edges Vertex p1 = e1.second() - e1.first(); Vertex p2 = e2.second() - e2.first(); // Quadrant mapping array. The quadrant of a vector can be determined // from the dot product of the vector and its perpendicular pair // with the unit vector X axis. The products will carry the values // lcos = dot(p, ax) = l * cos(phi) and // lsin = -dotperp(p, ax) = l * sin(phi) where // l is the length of vector p. From the signs of these values we can // construct an index which has the sign of lcos as MSB and the // sign of lsin as LSB. This index can be used to retrieve the actual // quadrant where vector p resides using the following map: // (+ is 0, - is 1) // cos | sin | decimal | quadrant // + | + | 0 | 0 // + | - | 1 | 3 // - | + | 2 | 1 // - | - | 3 | 2 std::array quadrants {0, 3, 1, 2 }; std::array q {0, 0}; // Quadrant indices for p1 and p2 using TDots = std::array, 2>; TDots lcos { pl::dot(p1, ax), pl::dot(p2, ax) }; TDots lsin { -pl::dotperp(p1, ax), -pl::dotperp(p2, ax) }; // Construct the quadrant indices for p1 and p2 for(size_t i = 0; i < 2; ++i) if(lcos[i] == 0) q[i] = lsin[i] > 0 ? 1 : 3; else if(lsin[i] == 0) q[i] = lcos[i] > 0 ? 0 : 2; else q[i] = quadrants[((lcos[i] < 0) << 1) + (lsin[i] < 0)]; if(q[0] == q[1]) { // only bother if p1 and p2 are in the same quadrant auto lsq1 = pl::magnsq(p1); // squared magnitudes, avoid sqrt auto lsq2 = pl::magnsq(p2); // squared magnitudes, avoid sqrt // We will actually compare l^2 * cos^2(phi) which saturates the // cos function. But with the quadrant info we can get the sign back int sign = q[0] == 1 || q[0] == 2 ? -1 : 1; // If Ratio is an actual rational type, there is no precision loss auto pcos1 = Ratio(lcos[0]) / lsq1 * sign * lcos[0]; auto pcos2 = Ratio(lcos[1]) / lsq2 * sign * lcos[1]; return q[0] < 2 ? pcos1 < pcos2 : pcos1 > pcos2; } // If in different quadrants, compare the quadrant indices only. return q[0] > q[1]; }); __nfp::buildPolygon(edgelist, rsh, top_nfp); return {rsh, top_nfp}; } template NfpResult nfpSimpleSimple(const RawShape& cstationary, const RawShape& cother) { // Algorithms are from the original algorithm proposed in paper: // https://eprints.soton.ac.uk/36850/1/CORMSIS-05-05.pdf // ///////////////////////////////////////////////////////////////////////// // Algorithm 1: Obtaining the minkowski sum // ///////////////////////////////////////////////////////////////////////// // I guess this is not a full minkowski sum of the two input polygons by // definition. This yields a subset that is compatible with the next 2 // algorithms. using Result = NfpResult; using Vertex = TPoint; using Coord = TCoord; using Edge = _Segment; namespace sl = shapelike; using std::signbit; using std::sort; using std::vector; using std::ref; using std::reference_wrapper; // TODO The original algorithms expects the stationary polygon in // counter clockwise and the orbiter in clockwise order. // So for preventing any further complication, I will make the input // the way it should be, than make my way around the orientations. // Reverse the stationary contour to counter clockwise auto stcont = sl::contour(cstationary); { std::reverse(sl::begin(stcont), sl::end(stcont)); stcont.pop_back(); auto it = std::min_element(sl::begin(stcont), sl::end(stcont), [](const Vertex& v1, const Vertex& v2) { return getY(v1) < getY(v2); }); std::rotate(sl::begin(stcont), it, sl::end(stcont)); sl::addVertex(stcont, sl::front(stcont)); } RawShape stationary; sl::contour(stationary) = stcont; // Reverse the orbiter contour to counter clockwise auto orbcont = sl::contour(cother); { std::reverse(orbcont.begin(), orbcont.end()); // Step 1: Make the orbiter reverse oriented orbcont.pop_back(); auto it = std::min_element(orbcont.begin(), orbcont.end(), [](const Vertex& v1, const Vertex& v2) { return getY(v1) < getY(v2); }); std::rotate(orbcont.begin(), it, orbcont.end()); orbcont.emplace_back(orbcont.front()); for(auto &v : orbcont) v = -v; } // Copy the orbiter (contour only), we will have to work on it RawShape orbiter; sl::contour(orbiter) = orbcont; // An edge with additional data for marking it struct MarkedEdge { Edge e; Radians turn_angle = 0; bool is_turning_point = false; MarkedEdge() = default; MarkedEdge(const Edge& ed, Radians ta, bool tp): e(ed), turn_angle(ta), is_turning_point(tp) {} // debug std::string label; }; // Container for marked edges using EdgeList = vector; EdgeList A, B; // This is how an edge list is created from the polygons auto fillEdgeList = [](EdgeList& L, const RawShape& ppoly, int dir) { auto& poly = sl::contour(ppoly); L.reserve(sl::contourVertexCount(poly)); if(dir > 0) { auto it = poly.begin(); auto nextit = std::next(it); double turn_angle = 0; bool is_turn_point = false; while(nextit != poly.end()) { L.emplace_back(Edge(*it, *nextit), turn_angle, is_turn_point); it++; nextit++; } } else { auto it = sl::rbegin(poly); auto nextit = std::next(it); double turn_angle = 0; bool is_turn_point = false; while(nextit != sl::rend(poly)) { L.emplace_back(Edge(*it, *nextit), turn_angle, is_turn_point); it++; nextit++; } } auto getTurnAngle = [](const Edge& e1, const Edge& e2) { auto phi = e1.angleToXaxis(); auto phi_prev = e2.angleToXaxis(); auto turn_angle = phi-phi_prev; if(turn_angle > Pi) turn_angle -= TwoPi; if(turn_angle < -Pi) turn_angle += TwoPi; return turn_angle; }; auto eit = L.begin(); auto enext = std::next(eit); eit->turn_angle = getTurnAngle(L.front().e, L.back().e); while(enext != L.end()) { enext->turn_angle = getTurnAngle( enext->e, eit->e); eit->is_turning_point = signbit(enext->turn_angle) != signbit(eit->turn_angle); ++eit; ++enext; } L.back().is_turning_point = signbit(L.back().turn_angle) != signbit(L.front().turn_angle); }; // Step 2: Fill the edgelists fillEdgeList(A, stationary, 1); fillEdgeList(B, orbiter, 1); int i = 1; for(MarkedEdge& me : A) { std::cout << "a" << i << ":\n\t" << getX(me.e.first()) << " " << getY(me.e.first()) << "\n\t" << getX(me.e.second()) << " " << getY(me.e.second()) << "\n\t" << "Turning point: " << (me.is_turning_point ? "yes" : "no") << std::endl; me.label = "a"; me.label += std::to_string(i); i++; } i = 1; for(MarkedEdge& me : B) { std::cout << "b" << i << ":\n\t" << getX(me.e.first()) << " " << getY(me.e.first()) << "\n\t" << getX(me.e.second()) << " " << getY(me.e.second()) << "\n\t" << "Turning point: " << (me.is_turning_point ? "yes" : "no") << std::endl; me.label = "b"; me.label += std::to_string(i); i++; } // A reference to a marked edge that also knows its container struct MarkedEdgeRef { reference_wrapper eref; reference_wrapper> container; Coord dir = 1; // Direction modifier inline Radians angleX() const { return eref.get().e.angleToXaxis(); } inline const Edge& edge() const { return eref.get().e; } inline Edge& edge() { return eref.get().e; } inline bool isTurningPoint() const { return eref.get().is_turning_point; } inline bool isFrom(const vector& cont ) { return &(container.get()) == &cont; } inline bool eq(const MarkedEdgeRef& mr) { return &(eref.get()) == &(mr.eref.get()); } MarkedEdgeRef(reference_wrapper er, reference_wrapper> ec): eref(er), container(ec), dir(1) {} MarkedEdgeRef(reference_wrapper er, reference_wrapper> ec, Coord d): eref(er), container(ec), dir(d) {} }; using EdgeRefList = vector; // Comparing two marked edges auto sortfn = [](const MarkedEdgeRef& e1, const MarkedEdgeRef& e2) { return e1.angleX() < e2.angleX(); }; EdgeRefList Aref, Bref; // We create containers for the references Aref.reserve(A.size()); Bref.reserve(B.size()); // Fill reference container for the stationary polygon std::for_each(A.begin(), A.end(), [&Aref](MarkedEdge& me) { Aref.emplace_back( ref(me), ref(Aref) ); }); // Fill reference container for the orbiting polygon std::for_each(B.begin(), B.end(), [&Bref](MarkedEdge& me) { Bref.emplace_back( ref(me), ref(Bref) ); }); auto mink = [sortfn] // the Mink(Q, R, direction) sub-procedure (const EdgeRefList& Q, const EdgeRefList& R, bool positive) { // Step 1 "merge sort_list(Q) and sort_list(R) to form merge_list(Q,R)" // Sort the containers of edge references and merge them. // Q could be sorted only once and be reused here but we would still // need to merge it with sorted(R). EdgeRefList merged; EdgeRefList S, seq; merged.reserve(Q.size() + R.size()); merged.insert(merged.end(), R.begin(), R.end()); std::stable_sort(merged.begin(), merged.end(), sortfn); merged.insert(merged.end(), Q.begin(), Q.end()); std::stable_sort(merged.begin(), merged.end(), sortfn); // Step 2 "set i = 1, k = 1, direction = 1, s1 = q1" // we don't use i, instead, q is an iterator into Q. k would be an index // into the merged sequence but we use "it" as an iterator for that // here we obtain references for the containers for later comparisons const auto& Rcont = R.begin()->container.get(); const auto& Qcont = Q.begin()->container.get(); // Set the initial direction Coord dir = 1; // roughly i = 1 (so q = Q.begin()) and s1 = q1 so S[0] = q; if(positive) { auto q = Q.begin(); S.emplace_back(*q); // Roughly step 3 std::cout << "merged size: " << merged.size() << std::endl; auto mit = merged.begin(); for(bool finish = false; !finish && q != Q.end();) { ++q; // "Set i = i + 1" while(!finish && mit != merged.end()) { if(mit->isFrom(Rcont)) { auto s = *mit; s.dir = dir; S.emplace_back(s); } if(mit->eq(*q)) { S.emplace_back(*q); if(mit->isTurningPoint()) dir = -dir; if(q == Q.begin()) finish = true; break; } mit += dir; // __nfp::advance(mit, merged, dir > 0); } } } else { auto q = Q.rbegin(); S.emplace_back(*q); // Roughly step 3 std::cout << "merged size: " << merged.size() << std::endl; auto mit = merged.begin(); for(bool finish = false; !finish && q != Q.rend();) { ++q; // "Set i = i + 1" while(!finish && mit != merged.end()) { if(mit->isFrom(Rcont)) { auto s = *mit; s.dir = dir; S.emplace_back(s); } if(mit->eq(*q)) { S.emplace_back(*q); S.back().dir = -1; if(mit->isTurningPoint()) dir = -dir; if(q == Q.rbegin()) finish = true; break; } mit += dir; // __nfp::advance(mit, merged, dir > 0); } } } // Step 4: // "Let starting edge r1 be in position si in sequence" // whaaat? I guess this means the following: auto it = S.begin(); while(!it->eq(*R.begin())) ++it; // "Set j = 1, next = 2, direction = 1, seq1 = si" // we don't use j, seq is expanded dynamically. dir = 1; auto next = std::next(R.begin()); seq.emplace_back(*it); // Step 5: // "If all si edges have been allocated to seqj" should mean that // we loop until seq has equal size with S auto send = it; //it == S.begin() ? it : std::prev(it); while(it != S.end()) { ++it; if(it == S.end()) it = S.begin(); if(it == send) break; if(it->isFrom(Qcont)) { seq.emplace_back(*it); // "If si is from Q, j = j + 1, seqj = si" // "If si is a turning point in Q, // direction = - direction, next = next + direction" if(it->isTurningPoint()) { dir = -dir; next += dir; // __nfp::advance(next, R, dir > 0); } } if(it->eq(*next) /*&& dir == next->dir*/) { // "If si = direction.rnext" // "j = j + 1, seqj = si, next = next + direction" seq.emplace_back(*it); next += dir; // __nfp::advance(next, R, dir > 0); } } return seq; }; std::vector seqlist; seqlist.reserve(Bref.size()); EdgeRefList Bslope = Bref; // copy Bref, we will make a slope diagram // make the slope diagram of B std::sort(Bslope.begin(), Bslope.end(), sortfn); auto slopeit = Bslope.begin(); // search for the first turning point while(!slopeit->isTurningPoint() && slopeit != Bslope.end()) slopeit++; if(slopeit == Bslope.end()) { // no turning point means convex polygon. seqlist.emplace_back(mink(Aref, Bref, true)); } else { int dir = 1; auto firstturn = Bref.begin(); while(!firstturn->eq(*slopeit)) ++firstturn; assert(firstturn != Bref.end()); EdgeRefList bgroup; bgroup.reserve(Bref.size()); bgroup.emplace_back(*slopeit); auto b_it = std::next(firstturn); while(b_it != firstturn) { if(b_it == Bref.end()) b_it = Bref.begin(); while(!slopeit->eq(*b_it)) { __nfp::advance(slopeit, Bslope, dir > 0); } if(!slopeit->isTurningPoint()) { bgroup.emplace_back(*slopeit); } else { if(!bgroup.empty()) { if(dir > 0) bgroup.emplace_back(*slopeit); for(auto& me : bgroup) { std::cout << me.eref.get().label << ", "; } std::cout << std::endl; seqlist.emplace_back(mink(Aref, bgroup, dir == 1 ? true : false)); bgroup.clear(); if(dir < 0) bgroup.emplace_back(*slopeit); } else { bgroup.emplace_back(*slopeit); } dir *= -1; } ++b_it; } } // while(it != Bref.end()) // This is step 3 and step 4 in one loop // if(it->isTurningPoint()) { // R = {R.last, it++}; // auto seq = mink(Q, R, orientation); // // TODO step 6 (should be 5 shouldn't it?): linking edges from A // // I don't get this step // seqlist.insert(seqlist.end(), seq.begin(), seq.end()); // orientation = !orientation; // } else ++it; // if(seqlist.empty()) seqlist = mink(Q, {Bref.begin(), Bref.end()}, true); // ///////////////////////////////////////////////////////////////////////// // Algorithm 2: breaking Minkowski sums into track line trips // ///////////////////////////////////////////////////////////////////////// // ///////////////////////////////////////////////////////////////////////// // Algorithm 3: finding the boundary of the NFP from track line trips // ///////////////////////////////////////////////////////////////////////// for(auto& seq : seqlist) { std::cout << "seqlist size: " << seq.size() << std::endl; for(auto& s : seq) { std::cout << (s.dir > 0 ? "" : "-") << s.eref.get().label << ", "; } std::cout << std::endl; } auto& seq = seqlist.front(); RawShape rsh; Vertex top_nfp; std::vector edgelist; edgelist.reserve(seq.size()); for(auto& s : seq) { edgelist.emplace_back(s.eref.get().e); } __nfp::buildPolygon(edgelist, rsh, top_nfp); return Result(rsh, top_nfp); } // Specializable NFP implementation class. Specialize it if you have a faster // or better NFP implementation template struct NfpImpl { NfpResult operator()(const RawShape& sh, const RawShape& other) { static_assert(nfptype == NfpLevel::CONVEX_ONLY, "Nfp::noFitPolygon() unimplemented!"); // Libnest2D has a default implementation for convex polygons and will // use it if feasible. return nfpConvexOnly(sh, other); } }; /// Helper function to get the NFP template inline NfpResult noFitPolygon(const RawShape& sh, const RawShape& other) { NfpImpl nfps; return nfps(sh, other); } } } #endif // GEOMETRIES_NOFITPOLYGON_HPP libnest2d-5.0.0/include/libnest2d/libnest2d.hpp000066400000000000000000000122321422601530300213060ustar00rootroot00000000000000#ifndef LIBNEST2D_HPP #define LIBNEST2D_HPP // The type of backend should be set conditionally by the cmake configuriation // for now we set it statically to clipper backend #ifdef LIBNEST2D_GEOMETRIES_clipper #include #endif #ifdef LIBNEST2D_OPTIMIZER_nlopt // We include the stock optimizers for local and global optimization #include // Local subplex for NfpPlacer #include // Genetic for min. bounding box #endif #include #include #include #include #include #include namespace libnest2d { using Point = PointImpl; using Coord = TCoord; using Box = _Box; using Segment = _Segment; using Circle = _Circle; using Item = _Item; using Rectangle = _Rectangle; using PackGroup = _PackGroup; using FillerSelection = selections::_FillerSelection; using FirstFitSelection = selections::_FirstFitSelection; using DJDHeuristic = selections::_DJDHeuristic; template // Generic placer for arbitrary bin types using _NfpPlacer = placers::_NofitPolyPlacer; // NfpPlacer is with Box bin using NfpPlacer = _NfpPlacer; // This supports only box shaped bins using BottomLeftPlacer = placers::_BottomLeftPlacer; #ifdef LIBNEST2D_STATIC extern template class _Nester; extern template class _Nester; extern template std::size_t _Nester::execute( std::vector::iterator, std::vector::iterator); extern template std::size_t _Nester::execute( std::vector::iterator, std::vector::iterator); #endif template struct NestConfig { typename Placer::Config placer_config; typename Selector::Config selector_config; using Placement = typename Placer::Config; using Selection = typename Selector::Config; NestConfig() = default; NestConfig(const typename Placer::Config &cfg) : placer_config{cfg} {} NestConfig(const typename Selector::Config &cfg) : selector_config{cfg} {} NestConfig(const typename Placer::Config & pcfg, const typename Selector::Config &scfg) : placer_config{pcfg}, selector_config{scfg} {} }; struct NestControl { ProgressFunction progressfn; StopCondition stopcond = []{ return false; }; NestControl() = default; NestControl(ProgressFunction pr) : progressfn{std::move(pr)} {} NestControl(StopCondition sc) : stopcond{std::move(sc)} {} NestControl(ProgressFunction pr, StopCondition sc) : progressfn{std::move(pr)}, stopcond{std::move(sc)} {} }; template::iterator> std::size_t nest(Iterator from, Iterator to, const typename Placer::BinType & bin, Coord dist = 0, const NestConfig &cfg = {}, NestControl ctl = {}) { _Nester nester{bin, dist, cfg.placer_config, cfg.selector_config}; if(ctl.progressfn) nester.progressIndicator(ctl.progressfn); if(ctl.stopcond) nester.stopCondition(ctl.stopcond); return nester.execute(from, to); } #ifdef LIBNEST2D_STATIC extern template class _Nester; extern template class _Nester; extern template std::size_t nest(std::vector::iterator from, std::vector::iterator to, const Box & bin, Coord dist, const NestConfig &cfg, NestControl ctl); extern template std::size_t nest(std::vector::iterator from, std::vector::iterator to, const Box & bin, Coord dist, const NestConfig &cfg, NestControl ctl); #endif template> std::size_t nest(Container&& cont, const typename Placer::BinType & bin, Coord dist = 0, const NestConfig &cfg = {}, NestControl ctl = {}) { return nest(cont.begin(), cont.end(), bin, dist, cfg, ctl); } template enable_if_t::value, TCoord> mm(T val = T(1)) { return TCoord(val * CoordType::MM_IN_COORDS); } } #endif // LIBNEST2D_HPP libnest2d-5.0.0/include/libnest2d/nester.hpp000066400000000000000000000667651422601530300207440ustar00rootroot00000000000000#ifndef NESTER_HPP #define NESTER_HPP #include #include #include #include #include #include #include namespace libnest2d { static const constexpr int BIN_ID_UNSET = -1; /** * \brief An item to be placed on a bin. * * It holds a copy of the original shape object but supports move construction * from the shape objects if its an rvalue reference. This way we can construct * the items without the cost of copying a potentially large amount of input. * * The results of some calculations are cached for maintaining fast run times. * For this reason, memory demands are much higher but this should pay off. */ template class _Item { using Coord = TCoord>; using Vertex = TPoint; using Box = _Box; using VertexConstIterator = typename TContour::const_iterator; // The original shape that gets encapsulated. RawShape sh_; // Transformation data Vertex translation_{0, 0}; Radians rotation_{0.0}; Coord inflation_{0}; // Info about whether the transformations will have to take place // This is needed because if floating point is used, it is hard to say // that a zero angle is not a rotation because of testing for equality. bool has_rotation_ = false, has_translation_ = false, has_inflation_ = false; // For caching the calculations as they can get pretty expensive. mutable RawShape tr_cache_; mutable bool tr_cache_valid_ = false; mutable double area_cache_ = 0; mutable bool area_cache_valid_ = false; mutable RawShape inflate_cache_; mutable bool inflate_cache_valid_ = false; enum class Convexity: char { UNCHECKED, C_TRUE, C_FALSE }; mutable Convexity convexity_ = Convexity::UNCHECKED; mutable VertexConstIterator rmt_; // rightmost top vertex mutable VertexConstIterator lmb_; // leftmost bottom vertex mutable bool rmt_valid_ = false, lmb_valid_ = false; mutable struct BBCache { Box bb; bool valid; BBCache(): valid(false) {} } bb_cache_; int binid_{BIN_ID_UNSET}, priority_{0}; bool fixed_{false}; /** * \brief If this is a fixed area, indicates whether it is a disallowed area * or a previously placed item. * * If this is a disallowed area, other objects will not get packed close * together with this item. It only blocks other items in its area. */ bool disallowed_{false}; public: /// The type of the shape which was handed over as the template argument. using ShapeType = RawShape; /** * \brief Iterator type for the outer vertices. * * Only const iterators can be used. The _Item type is not intended to * modify the carried shapes from the outside. The main purpose of this type * is to cache the calculation results from the various operators it * supports. Giving out a non const iterator would make it impossible to * perform correct cache invalidation. */ using Iterator = VertexConstIterator; /** * @brief Get the orientation of the polygon. * * The orientation have to be specified as a specialization of the * OrientationType struct which has a Value constant. * * @return The orientation type identifier for the _Item type. */ static BP2D_CONSTEXPR Orientation orientation() { return OrientationType::Value; } /** * @brief Constructing an _Item form an existing raw shape. The shape will * be copied into the _Item object. * @param sh The original shape object. */ explicit inline _Item(const RawShape& sh): sh_(sh) {} /** * @brief Construction of an item by moving the content of the raw shape, * assuming that it supports move semantics. * @param sh The original shape object. */ explicit inline _Item(RawShape&& sh): sh_(std::move(sh)) {} /** * @brief Create an item from an initializer list. * @param il The initializer list of vertices. */ inline _Item(const std::initializer_list< Vertex >& il): sh_(sl::create(il)) {} inline _Item(const TContour& contour, const THolesContainer& holes = {}): sh_(sl::create(contour, holes)) {} inline _Item(TContour&& contour, THolesContainer&& holes): sh_(sl::create(std::move(contour), std::move(holes))) {} inline bool isFixed() const noexcept { return fixed_; } inline bool isDisallowedArea() const noexcept { return disallowed_; } inline void markAsFixedInBin(int binid) { fixed_ = binid >= 0; binid_ = binid; disallowed_ = false; } inline void markAsDisallowedAreaInBin(int binid) { fixed_ = binid >= 0; binid_ = binid; disallowed_ = fixed_; } inline void binId(int idx) { binid_ = idx; } inline int binId() const noexcept { return binid_; } inline void priority(int p) { priority_ = p; } inline int priority() const noexcept { return priority_; } /** * @brief Convert the polygon to string representation. The format depends * on the implementation of the polygon. * @return */ inline std::string toString() const { return sl::toString(sh_); } /// Iterator tho the first contour vertex in the polygon. inline Iterator begin() const { return sl::cbegin(sh_); } /// Alias to begin() inline Iterator cbegin() const { return sl::cbegin(sh_); } /// Iterator to the last contour vertex. inline Iterator end() const { return sl::cend(sh_); } /// Alias to end() inline Iterator cend() const { return sl::cend(sh_); } /** * @brief Get a copy of an outer vertex within the carried shape. * * Note that the vertex considered here is taken from the original shape * that this item is constructed from. This means that no transformation is * applied to the shape in this call. * * @param idx The index of the requested vertex. * @return A copy of the requested vertex. */ inline Vertex vertex(unsigned long idx) const { return sl::vertex(sh_, idx); } /** * @brief Modify a vertex. * * Note that this method will invalidate every cached calculation result * including polygon offset and transformations. * * @param idx The index of the requested vertex. * @param v The new vertex data. */ inline void setVertex(unsigned long idx, const Vertex& v ) { invalidateCache(); sl::vertex(sh_, idx) = v; } /** * @brief Calculate the shape area. * * The method returns absolute value and does not reflect polygon * orientation. The result is cached, subsequent calls will have very little * cost. * @return The shape area in floating point double precision. */ inline double area() const { double ret ; if(area_cache_valid_) ret = area_cache_; else { ret = sl::area(infaltedShape()); area_cache_ = ret; area_cache_valid_ = true; } return ret; } inline bool isContourConvex() const { bool ret = false; switch(convexity_) { case Convexity::UNCHECKED: ret = sl::isConvex(sl::contour(transformedShape())); convexity_ = ret? Convexity::C_TRUE : Convexity::C_FALSE; break; case Convexity::C_TRUE: ret = true; break; case Convexity::C_FALSE:; } return ret; } inline bool isHoleConvex(unsigned /*holeidx*/) const { return false; } inline bool areHolesConvex() const { return false; } /// The number of the outer ring vertices. inline size_t vertexCount() const { return sl::contourVertexCount(sh_); } inline size_t holeCount() const { return sl::holeCount(sh_); } /** * @brief isPointInside * @param p * @return */ inline bool isInside(const Vertex& p) const { return sl::isInside(p, transformedShape()); } inline bool isInside(const _Item& sh) const { return sl::isInside(transformedShape(), sh.transformedShape()); } inline bool isInside(const RawShape& sh) const { return sl::isInside(transformedShape(), sh); } inline bool isInside(const _Box>& box) const; inline bool isInside(const _Circle>& box) const; inline void translate(const Vertex& d) BP2D_NOEXCEPT { translation(translation() + d); } inline void rotate(const Radians& rads) BP2D_NOEXCEPT { rotation(rotation() + rads); } inline void inflation(Coord distance) BP2D_NOEXCEPT { inflation_ = distance; has_inflation_ = true; invalidateCache(); } inline Coord inflation() const BP2D_NOEXCEPT { return inflation_; } inline void inflate(Coord distance) BP2D_NOEXCEPT { inflation(inflation() + distance); } inline Radians rotation() const BP2D_NOEXCEPT { return rotation_; } inline TPoint translation() const BP2D_NOEXCEPT { return translation_; } inline void rotation(Radians rot) BP2D_NOEXCEPT { if(rotation_ != rot) { rotation_ = rot; has_rotation_ = true; tr_cache_valid_ = false; rmt_valid_ = false; lmb_valid_ = false; bb_cache_.valid = false; } } inline void translation(const TPoint& tr) BP2D_NOEXCEPT { if(translation_ != tr) { translation_ = tr; has_translation_ = true; tr_cache_valid_ = false; //bb_cache_.valid = false; } } inline const RawShape& transformedShape() const { if(tr_cache_valid_) return tr_cache_; RawShape cpy = infaltedShape(); if(has_rotation_) sl::rotate(cpy, rotation_); if(has_translation_) sl::translate(cpy, translation_); tr_cache_ = cpy; tr_cache_valid_ = true; rmt_valid_ = false; lmb_valid_ = false; return tr_cache_; } inline operator RawShape() const { return transformedShape(); } inline const RawShape& rawShape() const BP2D_NOEXCEPT { return sh_; } inline void resetTransformation() BP2D_NOEXCEPT { has_translation_ = false; has_rotation_ = false; has_inflation_ = false; invalidateCache(); } inline Box boundingBox() const { if(!bb_cache_.valid) { if(!has_rotation_) bb_cache_.bb = sl::boundingBox(infaltedShape()); else { // TODO make sure this works auto rotsh = infaltedShape(); sl::rotate(rotsh, rotation_); bb_cache_.bb = sl::boundingBox(rotsh); } bb_cache_.valid = true; } auto &bb = bb_cache_.bb; auto &tr = translation_; return {bb.minCorner() + tr, bb.maxCorner() + tr }; } inline Vertex referenceVertex() const { return rightmostTopVertex(); } inline Vertex rightmostTopVertex() const { if(!rmt_valid_ || !tr_cache_valid_) { // find max x and max y vertex auto& tsh = transformedShape(); rmt_ = std::max_element(sl::cbegin(tsh), sl::cend(tsh), vsort); rmt_valid_ = true; } return *rmt_; } inline Vertex leftmostBottomVertex() const { if(!lmb_valid_ || !tr_cache_valid_) { // find min x and min y vertex auto& tsh = transformedShape(); lmb_ = std::min_element(sl::cbegin(tsh), sl::cend(tsh), vsort); lmb_valid_ = true; } return *lmb_; } //Static methods: inline static bool intersects(const _Item& sh1, const _Item& sh2) { return sl::intersects(sh1.transformedShape(), sh2.transformedShape()); } inline static bool touches(const _Item& sh1, const _Item& sh2) { return sl::touches(sh1.transformedShape(), sh2.transformedShape()); } private: inline const RawShape& infaltedShape() const { if(has_inflation_ ) { if(inflate_cache_valid_) return inflate_cache_; inflate_cache_ = sh_; sl::offset(inflate_cache_, inflation_); inflate_cache_valid_ = true; return inflate_cache_; } return sh_; } inline void invalidateCache() const BP2D_NOEXCEPT { tr_cache_valid_ = false; lmb_valid_ = false; rmt_valid_ = false; area_cache_valid_ = false; inflate_cache_valid_ = false; bb_cache_.valid = false; convexity_ = Convexity::UNCHECKED; } static inline bool vsort(const Vertex& v1, const Vertex& v2) { TCompute x1 = getX(v1), x2 = getX(v2); TCompute y1 = getY(v1), y2 = getY(v2); return y1 == y2 ? x1 < x2 : y1 < y2; } }; /** * \brief Subclass of _Item for regular rectangle items. */ template class _Rectangle: public _Item { using _Item::vertex; using TO = Orientation; public: using Unit = TCoord>; template::Value> inline _Rectangle(Unit width, Unit height, // disable this ctor if o != CLOCKWISE enable_if_t< o == TO::CLOCKWISE, int> = 0 ): _Item( sl::create( { {0, 0}, {0, height}, {width, height}, {width, 0}, {0, 0} } )) { } template::Value> inline _Rectangle(Unit width, Unit height, // disable this ctor if o != COUNTER_CLOCKWISE enable_if_t< o == TO::COUNTER_CLOCKWISE, int> = 0 ): _Item( sl::create( { {0, 0}, {width, 0}, {width, height}, {0, height}, {0, 0} } )) { } inline Unit width() const BP2D_NOEXCEPT { return getX(vertex(2)); } inline Unit height() const BP2D_NOEXCEPT { return getY(vertex(2)); } }; template inline bool _Item::isInside(const _Box>& box) const { return sl::isInside(boundingBox(), box); } template inline bool _Item::isInside(const _Circle>& circ) const { return sl::isInside(transformedShape(), circ); } template using _ItemRef = std::reference_wrapper<_Item>; template using _ItemGroup = std::vector<_ItemRef>; /** * \brief A list of packed item vectors. Each vector represents a bin. */ template using _PackGroup = std::vector>>; template struct ConstItemRange { Iterator from; Iterator to; bool valid = false; ConstItemRange() = default; ConstItemRange(Iterator f, Iterator t): from(f), to(t), valid(true) {} }; template inline ConstItemRange rem(typename Container::const_iterator it, const Container& cont) { return {std::next(it), cont.end()}; } /** * \brief A wrapper interface (trait) class for any placement strategy provider. * * If a client wants to use its own placement algorithm, all it has to do is to * specialize this class template and define all the ten methods it has. It can * use the strategies::PlacerBoilerplace class for creating a new placement * strategy where only the constructor and the trypack method has to be provided * and it will work out of the box. */ template class PlacementStrategyLike { PlacementStrategy impl_; public: using RawShape = typename PlacementStrategy::ShapeType; /// The item type that the placer works with. using Item = _Item; /// The placer's config type. Should be a simple struct but can be anything. using Config = typename PlacementStrategy::Config; /** * \brief The type of the bin that the placer works with. * * Can be a box or an arbitrary shape or just a width or height without a * second dimension if an infinite bin is considered. */ using BinType = typename PlacementStrategy::BinType; /** * \brief Pack result that can be used to accept or discard it. See trypack * method. */ using PackResult = typename PlacementStrategy::PackResult; using ItemGroup = _ItemGroup; using DefaultIterator = typename ItemGroup::const_iterator; /** * @brief Constructor taking the bin and an optional configuration. * @param bin The bin object whose type is defined by the placement strategy. * @param config The configuration for the particular placer. */ explicit PlacementStrategyLike(const BinType& bin, const Config& config = Config()): impl_(bin) { configure(config); } /** * @brief Provide a different configuration for the placer. * * Note that it depends on the particular placer implementation how it * reacts to config changes in the middle of a calculation. * * @param config The configuration object defined by the placement strategy. */ inline void configure(const Config& config) { impl_.configure(config); } /** * Try to pack an item with a result object that contains the packing * information for later accepting it. * * \param item_store A container of items that are intended to be packed * later. Can be used by the placer to switch tactics. When it's knows that * many items will come a greedy strategy may not be the best. * \param from The iterator to the item from which the packing should start, * including the pointed item * \param count How many items should be packed. If the value is 1, than * just the item pointed to by "from" argument should be packed. */ template inline PackResult trypack( Item& item, const ConstItemRange& remaining = ConstItemRange()) { return impl_.trypack(item, remaining); } /** * @brief A method to accept a previously tried item (or items). * * If the pack result is a failure the method should ignore it. * @param r The result of a previous trypack call. */ inline void accept(PackResult& r) { impl_.accept(r); } /** * @brief pack Try to pack and immediately accept it on success. * * A default implementation would be to call * { auto&& r = trypack(...); accept(r); return r; } but we should let the * implementor of the placement strategy to harvest any optimizations from * the absence of an intermediate step. The above version can still be used * in the implementation. * * @param item The item to pack. * @return Returns true if the item was packed or false if it could not be * packed. */ template> inline bool pack( Item& item, const Range& remaining = Range()) { return impl_.pack(item, remaining); } /** * This method makes possible to "preload" some items into the placer. It * will not move these items but will consider them as already packed. */ inline void preload(const ItemGroup& packeditems) { impl_.preload(packeditems); } /// Unpack the last element (remove it from the list of packed items). inline void unpackLast() { impl_.unpackLast(); } /// Get the bin object. inline const BinType& bin() const { return impl_.bin(); } /// Set a new bin object. inline void bin(const BinType& bin) { impl_.bin(bin); } /// Get the packed items. inline ItemGroup getItems() { return impl_.getItems(); } /// Clear the packed items so a new session can be started. inline void clearItems() { impl_.clearItems(); } inline double filledArea() const { return impl_.filledArea(); } }; // The progress function will be called with the number of placed items using ProgressFunction = std::function; using StopCondition = std::function; /** * A wrapper interface (trait) class for any selections strategy provider. */ template class SelectionStrategyLike { SelectionStrategy impl_; public: using RawShape = typename SelectionStrategy::ShapeType; using Item = _Item; using PackGroup = _PackGroup; using Config = typename SelectionStrategy::Config; /** * @brief Provide a different configuration for the selection strategy. * * Note that it depends on the particular placer implementation how it * reacts to config changes in the middle of a calculation. * * @param config The configuration object defined by the selection strategy. */ inline void configure(const Config& config) { impl_.configure(config); } /** * @brief A function callback which should be called whenever an item or * a group of items where successfully packed. * @param fn A function callback object taking one unsigned integer as the * number of the remaining items to pack. */ void progressIndicator(ProgressFunction fn) { impl_.progressIndicator(fn); } void stopCondition(StopCondition cond) { impl_.stopCondition(cond); } /** * \brief A method to start the calculation on the input sequence. * * \tparam TPlacer The only mandatory template parameter is the type of * placer compatible with the PlacementStrategyLike interface. * * \param first, last The first and last iterator if the input sequence. It * can be only an iterator of a type convertible to Item. * \param bin. The shape of the bin. It has to be supported by the placement * strategy. * \param An optional config object for the placer. */ template::BinType, class PConfig = typename PlacementStrategyLike::Config> inline void packItems( TIterator first, TIterator last, TBin&& bin, PConfig&& config = PConfig() ) { impl_.template packItems(first, last, std::forward(bin), std::forward(config)); } /** * @brief Get the items for a particular bin. * @param binIndex The index of the requested bin. * @return Returns a list of all items packed into the requested bin. */ inline const PackGroup& getResult() const { return impl_.getResult(); } void clear() { impl_.clear(); } }; /** * The _Nester is the front-end class for the libnest2d library. It takes the * input items and changes their transformations to be inside the provided bin. */ template class _Nester { using TSel = SelectionStrategyLike; TSel selector_; public: using Item = typename PlacementStrategy::Item; using ShapeType = typename Item::ShapeType; using ItemRef = std::reference_wrapper; using TPlacer = PlacementStrategyLike; using BinType = typename TPlacer::BinType; using PlacementConfig = typename TPlacer::Config; using SelectionConfig = typename TSel::Config; using Coord = TCoord>; using PackGroup = _PackGroup; using ResultType = PackGroup; private: BinType bin_; PlacementConfig pconfig_; Coord min_obj_distance_; using SItem = typename SelectionStrategy::Item; using TPItem = remove_cvref_t; using TSItem = remove_cvref_t; StopCondition stopfn_; template using TVal = remove_ref_t; template using ItemIteratorOnly = enable_if_t&, TPItem&>::value, Out>; public: /** * \brief Constructor taking the bin as the only mandatory parameter. * * \param bin The bin shape that will be used by the placers. The type * of the bin should be one that is supported by the placer type. */ template _Nester(TBinType&& bin, Coord min_obj_distance = 0, const PConf& pconfig = PConf(), const SConf& sconfig = SConf()): bin_(std::forward(bin)), pconfig_(pconfig), min_obj_distance_(min_obj_distance) { static_assert( std::is_same::value, "Incompatible placement and selection strategy!"); selector_.configure(sconfig); } void configure(const PlacementConfig& pconf) { pconfig_ = pconf; } void configure(const SelectionConfig& sconf) { selector_.configure(sconf); } void configure(const PlacementConfig& pconf, const SelectionConfig& sconf) { pconfig_ = pconf; selector_.configure(sconf); } void configure(const SelectionConfig& sconf, const PlacementConfig& pconf) { pconfig_ = pconf; selector_.configure(sconf); } /** * \brief Arrange an input sequence of _Item-s. * * To get the result, call the translation(), rotation() and binId() * methods of each item. If only the transformed polygon is needed, call * transformedShape() to get the properly transformed shapes. * * The number of groups in the pack group is the number of bins opened by * the selection algorithm. */ template inline ItemIteratorOnly execute(It from, It to) { auto infl = static_cast(std::ceil(min_obj_distance_/2.0)); if(infl > 0) std::for_each(from, to, [this, infl](Item& item) { item.inflate(infl); }); selector_.template packItems( from, to, bin_, pconfig_); if(min_obj_distance_ > 0) std::for_each(from, to, [infl](Item& item) { item.inflate(-infl); }); return selector_.getResult().size(); } /// Set a progress indicator function object for the selector. inline _Nester& progressIndicator(ProgressFunction func) { selector_.progressIndicator(func); return *this; } /// Set a predicate to tell when to abort nesting. inline _Nester& stopCondition(StopCondition fn) { stopfn_ = fn; selector_.stopCondition(fn); return *this; } inline const PackGroup& lastResult() const { return selector_.getResult(); } }; } #endif // NESTER_HPP libnest2d-5.0.0/include/libnest2d/optimizer.hpp000066400000000000000000000172301422601530300214450ustar00rootroot00000000000000#ifndef OPTIMIZER_HPP #define OPTIMIZER_HPP #include #include #include #include namespace libnest2d { namespace opt { using std::forward; using std::tuple; using std::make_tuple; /// A Type trait for upper and lower limit of a numeric type. template struct limits { inline static T min() { return std::numeric_limits::min(); } inline static T max() { return std::numeric_limits::max(); } }; template struct limits::has_infinity, void>> { inline static T min() { return -std::numeric_limits::infinity(); } inline static T max() { return std::numeric_limits::infinity(); } }; /// An interval of possible input values for optimization template class Bound { T min_; T max_; public: Bound(const T& min = limits::min(), const T& max = limits::max()): min_(min), max_(max) {} inline const T min() const BP2D_NOEXCEPT { return min_; } inline const T max() const BP2D_NOEXCEPT { return max_; } }; /** * Helper function to make a Bound object with its type deduced automatically. */ template inline Bound bound(const T& min, const T& max) { return Bound(min, max); } /** * This is the type of an input tuple for the object function. It holds the * values and their type in each dimension. */ template using Input = tuple; template inline tuple initvals(Args...args) { return make_tuple(args...); } /** * @brief Specific optimization methods for which a default optimizer * implementation can be instantiated. */ enum class Method { L_SIMPLEX, L_SUBPLEX, G_GENETIC, G_PARTICLE_SWARM //... }; /** * @brief Info about result of an optimization. These codes are exactly the same * as the nlopt codes for convinience. */ enum ResultCodes { FAILURE = -1, /* generic failure code */ INVALID_ARGS = -2, OUT_OF_MEMORY = -3, ROUNDOFF_LIMITED = -4, FORCED_STOP = -5, SUCCESS = 1, /* generic success code */ STOPVAL_REACHED = 2, FTOL_REACHED = 3, XTOL_REACHED = 4, MAXEVAL_REACHED = 5, MAXTIME_REACHED = 6 }; /** * \brief A type to hold the complete result of the optimization. */ template struct Result { ResultCodes resultcode; tuple optimum; double score; }; /** * @brief A type for specifying the stop criteria. */ struct StopCriteria { /// If the absolute value difference between two scores. double absolute_score_difference = std::nan(""); /// If the relative value difference between two scores. double relative_score_difference = std::nan(""); /// Stop if this value or better is found. double stop_score = std::nan(""); /// A predicate that if evaluates to true, the optimization should terminate /// and the best result found prior to termination should be returned. std::function stop_condition = [] { return false; }; /// The max allowed number of iterations. unsigned max_iterations = 0; }; /** * \brief The Optimizer base class with CRTP pattern. */ template class Optimizer { protected: enum class OptDir{ MIN, MAX } dir_; StopCriteria stopcr_; public: inline explicit Optimizer(const StopCriteria& scr = {}): stopcr_(scr) {} /** * \brief Optimize for minimum value of the provided objectfunction. * \param objectfunction The function that will be searched for the minimum * return value. * \param initvals A tuple with the initial values for the search * \param bounds A parameter pack with the bounds for each dimension. * \return Returns a Result structure. * An example call would be: * auto result = opt.optimize_min( * [](tuple x) // object function * { * return std::pow(std::get<0>(x), 2); * }, * make_tuple(-0.5), // initial value * {-1.0, 1.0} // search space bounds * ); */ template inline Result optimize_min(Func&& objectfunction, Input initvals, Bound... bounds) { dir_ = OptDir::MIN; return static_cast(this)->template optimize( forward(objectfunction), initvals, bounds... ); } template inline Result optimize_min(Func&& objectfunction, Input initvals) { dir_ = OptDir::MIN; return static_cast(this)->template optimize( forward(objectfunction), initvals, Bound()... ); } template inline Result optimize_min(Func&& objectfunction) { dir_ = OptDir::MIN; return static_cast(this)->template optimize( forward(objectfunction), Input(), Bound()... ); } /// Same as optimize_min but optimizes for maximum function value. template inline Result optimize_max(Func&& objectfunction, Input initvals, Bound... bounds) { dir_ = OptDir::MAX; return static_cast(this)->template optimize( forward(objectfunction), initvals, bounds... ); } template inline Result optimize_max(Func&& objectfunction, Input initvals) { dir_ = OptDir::MAX; return static_cast(this)->template optimize( forward(objectfunction), initvals, Bound()... ); } template inline Result optimize_max(Func&& objectfunction) { dir_ = OptDir::MAX; return static_cast(this)->template optimize( forward(objectfunction), Input(), Bound()... ); } }; // Just to be able to instantiate an unimplemented method and generate compile // error. template class DummyOptimizer : public Optimizer> { friend class Optimizer>; public: DummyOptimizer() { static_assert(always_false::value, "Optimizer unimplemented!"); } DummyOptimizer(const StopCriteria&) { static_assert(always_false::value, "Optimizer unimplemented!"); } template Result optimize(Func&& /*func*/, tuple /*initvals*/, Bound... /*args*/) { return Result(); } }; // Specializing this struct will tell what kind of optimizer to generate for // a given method template struct OptimizerSubclass { using Type = DummyOptimizer<>; }; /// Optimizer type based on the method provided in parameter m. template using TOptimizer = typename OptimizerSubclass::Type; /// Global optimizer with an explicitly specified local method. template inline TOptimizer GlobalOptimizer(Method, const StopCriteria& scr = {}) { // Need to be specialized in order to do anything useful. return TOptimizer(scr); } } } #endif // OPTIMIZER_HPP libnest2d-5.0.0/include/libnest2d/optimizers/000077500000000000000000000000001422601530300211145ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/optimizers/nlopt/000077500000000000000000000000001422601530300222505ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/optimizers/nlopt/CMakeLists.txt000066400000000000000000000011271422601530300250110ustar00rootroot00000000000000add_library(nloptOptimizer INTERFACE) find_package(NLopt 2.7 REQUIRED) target_link_libraries(nloptOptimizer INTERFACE NLopt::nlopt) list(APPEND LIBNEST2D_SRCFILES include/libnest2d/optimizers/nlopt/simplex.hpp include/libnest2d/optimizers/nlopt/subplex.hpp include/libnest2d/optimizers/nlopt/genetic.hpp include/libnest2d/optimizers/nlopt/nlopt_boilerplate.hpp ) set(LIBNEST2D_SRCFILES ${LIBNEST2D_SRCFILES} PARENT_SCOPE) install(TARGETS nloptOptimizer EXPORT Libnest2DTargets INCLUDES DESTINATION include) set(LIBNEST2D_PUBLIC_PACKAGES "${LIBNEST2D_PUBLIC_PACKAGES};NLopt" CACHE INTERNAL "") libnest2d-5.0.0/include/libnest2d/optimizers/nlopt/genetic.hpp000066400000000000000000000014311422601530300243760ustar00rootroot00000000000000#ifndef GENETIC_HPP #define GENETIC_HPP #include "nlopt_boilerplate.hpp" namespace libnest2d { namespace opt { class GeneticOptimizer: public NloptOptimizer { public: inline explicit GeneticOptimizer(const StopCriteria& scr = {}): NloptOptimizer(method2nloptAlg(Method::G_GENETIC), scr) {} inline GeneticOptimizer& localMethod(Method m) { localmethod_ = m; return *this; } inline void seed(unsigned long val) { nlopt::srand(val); } }; template<> struct OptimizerSubclass { using Type = GeneticOptimizer; }; template<> inline TOptimizer GlobalOptimizer( Method localm, const StopCriteria& scr ) { return GeneticOptimizer (scr).localMethod(localm); } } } #endif // GENETIC_HPP libnest2d-5.0.0/include/libnest2d/optimizers/nlopt/nlopt_boilerplate.hpp000066400000000000000000000134011422601530300264760ustar00rootroot00000000000000#ifndef NLOPT_BOILERPLATE_HPP #define NLOPT_BOILERPLATE_HPP #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable: 4244) #pragma warning(disable: 4267) #endif #include #ifdef _MSC_VER #pragma warning(pop) #endif #include #include #include #include namespace libnest2d { namespace opt { inline nlopt::algorithm method2nloptAlg(Method m) { switch(m) { case Method::L_SIMPLEX: return nlopt::LN_NELDERMEAD; case Method::L_SUBPLEX: return nlopt::LN_SBPLX; case Method::G_GENETIC: return nlopt::GN_ESCH; default: assert(false); throw(m); } } /** * Optimizer based on NLopt. * * All the optimized types have to be convertible to double. */ class NloptOptimizer: public Optimizer { protected: nlopt::opt opt_; std::vector lower_bounds_; std::vector upper_bounds_; std::vector initvals_; nlopt::algorithm alg_; Method localmethod_; using Base = Optimizer; friend Base; // ********************************************************************** */ // TODO: CHANGE FOR LAMBDAS WHEN WE WILL MOVE TO C++14 struct BoundsFunc { NloptOptimizer& self; inline explicit BoundsFunc(NloptOptimizer& o): self(o) {} template void operator()(int N, T& bounds) { self.lower_bounds_[N] = bounds.min(); self.upper_bounds_[N] = bounds.max(); } }; struct InitValFunc { NloptOptimizer& self; inline explicit InitValFunc(NloptOptimizer& o): self(o) {} template void operator()(int N, T& initval) { self.initvals_[N] = initval; } }; struct ResultCopyFunc { NloptOptimizer& self; inline explicit ResultCopyFunc(NloptOptimizer& o): self(o) {} template void operator()(int N, T& resultval) { resultval = self.initvals_[N]; } }; struct FunvalCopyFunc { using D = const std::vector; D& params; inline explicit FunvalCopyFunc(D& p): params(p) {} template void operator()(int N, T& resultval) { resultval = params[N]; } }; /* ********************************************************************** */ template static double optfunc(const std::vector& params, std::vector& /*grad*/, void *data) { using TData = std::pair*, NloptOptimizer*>; auto typeddata = static_cast(data); if(typeddata->second->stopcr_.stop_condition()) typeddata->second->opt_.force_stop(); auto fnptr = typeddata->first; auto funval = std::tuple(); // copy the obtained objectfunction arguments to the funval tuple. metaloop::apply(FunvalCopyFunc(params), funval); auto ret = metaloop::callFunWithTuple(*fnptr, funval, index_sequence_for()); return ret; } template Result optimize(Func&& func, std::tuple initvals, Bound... args) { lower_bounds_.resize(sizeof...(Args)); upper_bounds_.resize(sizeof...(Args)); initvals_.resize(sizeof...(Args)); opt_ = nlopt::opt(alg_, sizeof...(Args) ); // Copy the bounds which is obtained as a parameter pack in args into // lower_bounds_ and upper_bounds_ metaloop::apply(BoundsFunc(*this), args...); opt_.set_lower_bounds(lower_bounds_); opt_.set_upper_bounds(upper_bounds_); nlopt::opt localopt; switch(opt_.get_algorithm()) { case nlopt::GN_MLSL: case nlopt::GN_MLSL_LDS: localopt = nlopt::opt(method2nloptAlg(localmethod_), sizeof...(Args)); localopt.set_lower_bounds(lower_bounds_); localopt.set_upper_bounds(upper_bounds_); opt_.set_local_optimizer(localopt); default: ; } double abs_diff = stopcr_.absolute_score_difference; double rel_diff = stopcr_.relative_score_difference; double stopval = stopcr_.stop_score; if(!std::isnan(abs_diff)) opt_.set_ftol_abs(abs_diff); if(!std::isnan(rel_diff)) opt_.set_ftol_rel(rel_diff); if(!std::isnan(stopval)) opt_.set_stopval(stopval); if(this->stopcr_.max_iterations > 0) opt_.set_maxeval(this->stopcr_.max_iterations ); // Take care of the initial values, copy them to initvals_ metaloop::apply(InitValFunc(*this), initvals); std::pair*, NloptOptimizer*> data = std::make_pair(&func, this); switch(dir_) { case OptDir::MIN: opt_.set_min_objective(optfunc, &data); break; case OptDir::MAX: opt_.set_max_objective(optfunc, &data); break; } Result result; nlopt::result rescode; try { rescode = opt_.optimize(initvals_, result.score); result.resultcode = static_cast(rescode); } catch( nlopt::forced_stop& ) { result.resultcode = ResultCodes::FORCED_STOP; } metaloop::apply(ResultCopyFunc(*this), result.optimum); return result; } public: inline explicit NloptOptimizer(nlopt::algorithm alg, StopCriteria stopcr = {}): Base(stopcr), alg_(alg), localmethod_(Method::L_SIMPLEX) {} }; } } #endif // NLOPT_BOILERPLATE_HPP libnest2d-5.0.0/include/libnest2d/optimizers/nlopt/simplex.hpp000066400000000000000000000006541422601530300244470ustar00rootroot00000000000000#ifndef SIMPLEX_HPP #define SIMPLEX_HPP #include "nlopt_boilerplate.hpp" namespace libnest2d { namespace opt { class SimplexOptimizer: public NloptOptimizer { public: inline explicit SimplexOptimizer(const StopCriteria& scr = {}): NloptOptimizer(method2nloptAlg(Method::L_SIMPLEX), scr) {} }; template<> struct OptimizerSubclass { using Type = SimplexOptimizer; }; } } #endif // SIMPLEX_HPP libnest2d-5.0.0/include/libnest2d/optimizers/nlopt/subplex.hpp000066400000000000000000000006541422601530300244500ustar00rootroot00000000000000#ifndef SUBPLEX_HPP #define SUBPLEX_HPP #include "nlopt_boilerplate.hpp" namespace libnest2d { namespace opt { class SubplexOptimizer: public NloptOptimizer { public: inline explicit SubplexOptimizer(const StopCriteria& scr = {}): NloptOptimizer(method2nloptAlg(Method::L_SUBPLEX), scr) {} }; template<> struct OptimizerSubclass { using Type = SubplexOptimizer; }; } } #endif // SUBPLEX_HPP libnest2d-5.0.0/include/libnest2d/optimizers/optimlib/000077500000000000000000000000001422601530300227335ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/optimizers/optimlib/CMakeLists.txt000066400000000000000000000003461422601530300254760ustar00rootroot00000000000000find_package(Armadillo REQUIRED) add_library(optimlibOptimizer INTERFACE) target_include_directories(optimlibOptimizer INTERFACE ${ARMADILLO_INCLUDE_DIRS}) target_link_libraries(optimlibOptimizer INTERFACE ${ARMADILLO_LIBRARIES})libnest2d-5.0.0/include/libnest2d/optimizers/optimlib/particleswarm.hpp000066400000000000000000000013771422601530300263310ustar00rootroot00000000000000#ifndef PARTICLESWARM_HPP #define PARTICLESWARM_HPP #include namespace libnest2d { namespace opt { class ParticleswarmOptimizer { public: inline explicit ParticleswarmOptimizer(const StopCriteria& scr = {}) {} inline ParticleswarmOptimizer& localMethod(Method m) { localmethod_ = m; return *this; } inline void seed(unsigned long val) { nlopt::srand(val); } }; template<> struct OptimizerSubclass { using Type = ParticleswarmOptimizer; }; template<> inline TOptimizer GlobalOptimizer( Method localm, const StopCriteria& scr ) { return ParticleswarmOptimizer (scr).localMethod(localm); } } } #endif // GENETIC_HPP libnest2d-5.0.0/include/libnest2d/parallel.hpp000066400000000000000000000027541422601530300212240ustar00rootroot00000000000000#ifndef LIBNEST2D_PARALLEL_HPP #define LIBNEST2D_PARALLEL_HPP #include #include #include #ifdef LIBNEST2D_THREADING_tbb #include #endif #ifdef LIBNEST2D_THREADING_omp #include #endif namespace libnest2d { namespace __parallel { template using TIteratorValue = typename std::iterator_traits::value_type; template inline void enumerate( Iterator from, Iterator to, std::function, size_t)> fn, std::launch policy = std::launch::deferred | std::launch::async) { using TN = size_t; auto iN = to-from; TN N = iN < 0? 0 : TN(iN); #ifdef LIBNEST2D_THREADING_tbb if((policy & std::launch::async) == std::launch::async) { tbb::parallel_for(0, N, [from, fn] (TN n) { fn(*(from + n), n); } ); } else { for(TN n = 0; n < N; n++) fn(*(from + n), n); } #endif #ifdef LIBNEST2D_THREADING_omp if((policy & std::launch::async) == std::launch::async) { #pragma omp parallel for for(int n = 0; n < int(N); n++) fn(*(from + n), TN(n)); } else { for(TN n = 0; n < N; n++) fn(*(from + n), n); } #endif #ifdef LIBNEST2D_THREADING_std std::vector> rets(N); auto it = from; for(TN b = 0; b < N; b++) { rets[b] = std::async(policy, fn, *it++, unsigned(b)); } for(TN fi = 0; fi < N; ++fi) rets[fi].wait(); #endif } }} #endif //LIBNEST2D_PARALLEL_HPP libnest2d-5.0.0/include/libnest2d/placers/000077500000000000000000000000001422601530300203405ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/placers/bottomleftplacer.hpp000066400000000000000000000323131422601530300244210ustar00rootroot00000000000000#ifndef BOTTOMLEFT_HPP #define BOTTOMLEFT_HPP #include #include "placer_boilerplate.hpp" namespace libnest2d { namespace placers { template struct DefaultEpsilon {}; template struct DefaultEpsilon::value, T> > { static const T Value = 1; }; template struct DefaultEpsilon::value, T> > { static const T Value = 1e-3; }; template struct BLConfig { DECLARE_MAIN_TYPES(RawShape); Coord min_obj_distance = 0; Coord epsilon = DefaultEpsilon::Value; bool allow_rotations = false; }; template class _BottomLeftPlacer: public PlacerBoilerplate< _BottomLeftPlacer, RawShape, _Box>, BLConfig > { using Base = PlacerBoilerplate<_BottomLeftPlacer, RawShape, _Box>, BLConfig>; DECLARE_PLACER(Base) public: explicit _BottomLeftPlacer(const BinType& bin): Base(bin) {} template> PackResult trypack(Item& item, const Range& = Range()) { auto r = _trypack(item); if(!r && Base::config_.allow_rotations) { item.rotate(Degrees(90)); r =_trypack(item); } return r; } enum class Dir { LEFT, DOWN }; inline RawShape leftPoly(const Item& item) const { return toWallPoly(item, Dir::LEFT); } inline RawShape downPoly(const Item& item) const { return toWallPoly(item, Dir::DOWN); } inline Coord availableSpaceLeft(const Item& item) { return availableSpace(item, Dir::LEFT); } inline Coord availableSpaceDown(const Item& item) { return availableSpace(item, Dir::DOWN); } protected: PackResult _trypack(Item& item) { // Get initial position for item in the top right corner setInitialPosition(item); Coord d = availableSpaceDown(item); auto eps = config_.epsilon; bool can_move = d > eps; bool can_be_packed = can_move; bool left = true; while(can_move) { if(left) { // write previous down move and go down item.translate({0, -d+eps}); d = availableSpaceLeft(item); can_move = d > eps; left = false; } else { // write previous left move and go down item.translate({-d+eps, 0}); d = availableSpaceDown(item); can_move = d > eps; left = true; } } if(can_be_packed) { Item trsh(item.transformedShape()); for(auto& v : trsh) can_be_packed = can_be_packed && getX(v) < bin_.width() && getY(v) < bin_.height(); } return can_be_packed? PackResult(item) : PackResult(); } void setInitialPosition(Item& item) { auto bb = item.boundingBox(); Vertex v = { getX(bb.maxCorner()), getY(bb.minCorner()) }; Coord dx = getX(bin_.maxCorner()) - getX(v); Coord dy = getY(bin_.maxCorner()) - getY(v); item.translate({dx, dy}); } template static enable_if_t::value, bool> isInTheWayOf( const Item& item, const Item& other, const RawShape& scanpoly) { auto tsh = other.transformedShape(); return ( sl::intersects(tsh, scanpoly) || sl::isInside(tsh, scanpoly) ) && ( !sl::intersects(tsh, item.rawShape()) && !sl::isInside(tsh, item.rawShape()) ); } template static enable_if_t::value, bool> isInTheWayOf( const Item& item, const Item& other, const RawShape& scanpoly) { auto tsh = other.transformedShape(); bool inters_scanpoly = sl::intersects(tsh, scanpoly) && !sl::touches(tsh, scanpoly); bool inters_item = sl::intersects(tsh, item.rawShape()) && !sl::touches(tsh, item.rawShape()); return ( inters_scanpoly || sl::isInside(tsh, scanpoly)) && ( !inters_item && !sl::isInside(tsh, item.rawShape()) ); } ItemGroup itemsInTheWayOf(const Item& item, const Dir dir) { // Get the left or down polygon, that has the same area as the shadow // of input item reflected to the left or downwards auto&& scanpoly = dir == Dir::LEFT? leftPoly(item) : downPoly(item); ItemGroup ret; // packed items 'in the way' of item ret.reserve(items_.size()); // Predicate to find items that are 'in the way' for left (down) move auto predicate = [&scanpoly, &item](const Item& it) { return isInTheWayOf(item, it, scanpoly); }; // Get the items that are in the way for the left (or down) movement std::copy_if(items_.begin(), items_.end(), std::back_inserter(ret), predicate); return ret; } Coord availableSpace(const Item& _item, const Dir dir) { Item item (_item.transformedShape()); std::function getCoord; std::function< std::pair(const Segment&, const Vertex&) > availableDistanceSV; std::function< std::pair(const Vertex&, const Segment&) > availableDistance; if(dir == Dir::LEFT) { getCoord = [](const Vertex& v) { return getX(v); }; availableDistance = pointlike::horizontalDistance; availableDistanceSV = [](const Segment& s, const Vertex& v) { auto ret = pointlike::horizontalDistance(v, s); if(ret.second) ret.first = -ret.first; return ret; }; } else { getCoord = [](const Vertex& v) { return getY(v); }; availableDistance = pointlike::verticalDistance; availableDistanceSV = [](const Segment& s, const Vertex& v) { auto ret = pointlike::verticalDistance(v, s); if(ret.second) ret.first = -ret.first; return ret; }; } auto&& items_in_the_way = itemsInTheWayOf(item, dir); // Comparison function for finding min vertex auto cmp = [&getCoord](const Vertex& v1, const Vertex& v2) { return getCoord(v1) < getCoord(v2); }; // find minimum left or down coordinate of item auto minvertex_it = std::min_element(item.begin(), item.end(), cmp); // Get the initial distance in floating point Coord m = getCoord(*minvertex_it); // Check available distance for every vertex of item to the objects // in the way for the nearest intersection if(!items_in_the_way.empty()) { // This is crazy, should be optimized... for(Item& pleft : items_in_the_way) { // For all segments in items_to_left assert(pleft.vertexCount() > 0); auto trpleft_poly = pleft.transformedShape(); auto& trpleft = sl::contour(trpleft_poly); auto first = sl::begin(trpleft); auto next = first + 1; auto endit = sl::end(trpleft); while(next != endit) { Segment seg(*(first++), *(next++)); for(auto& v : item) { // For all vertices in item auto d = availableDistance(v, seg); if(d.second && d.first < m) m = d.first; } } } auto first = item.begin(); auto next = first + 1; auto endit = item.end(); // For all edges in item: while(next != endit) { Segment seg(*(first++), *(next++)); // for all shapes in items_to_left for(Item& sh : items_in_the_way) { assert(sh.vertexCount() > 0); Item tsh(sh.transformedShape()); for(auto& v : tsh) { // For all vertices in item auto d = availableDistanceSV(seg, v); if(d.second && d.first < m) m = d.first; } } } } return m; } /** * Implementation of the left (and down) polygon as described by * [López-Camacho et al. 2013]\ * (http://www.cs.stir.ac.uk/~goc/papers/EffectiveHueristic2DAOR2013.pdf) * see algorithm 8 for details... */ RawShape toWallPoly(const Item& _item, const Dir dir) const { // The variable names reflect the case of left polygon calculation. // // We will iterate through the item's vertices and search for the top // and bottom vertices (or right and left if dir==Dir::DOWN). // Save the relevant vertices and their indices into `bottom` and // `top` vectors. In case of left polygon construction these will // contain the top and bottom polygons which have the same vertical // coordinates (in case there is more of them). // // We get the leftmost (or downmost) vertex from the `bottom` and `top` // vectors and construct the final polygon. Item item (_item.transformedShape()); auto getCoord = [dir](const Vertex& v) { return dir == Dir::LEFT? getY(v) : getX(v); }; Coord max_y = std::numeric_limits::min(); Coord min_y = std::numeric_limits::max(); using El = std::pair>; std::function cmp; if(dir == Dir::LEFT) cmp = [](const El& e1, const El& e2) { return getX(e1.second.get()) < getX(e2.second.get()); }; else cmp = [](const El& e1, const El& e2) { return getY(e1.second.get()) < getY(e2.second.get()); }; std::vector< El > top; std::vector< El > bottom; size_t idx = 0; for(auto& v : item) { // Find the bottom and top vertices and save them auto vref = std::cref(v); auto vy = getCoord(v); if( vy > max_y ) { max_y = vy; top.clear(); top.emplace_back(idx, vref); } else if(vy == max_y) { top.emplace_back(idx, vref); } if(vy < min_y) { min_y = vy; bottom.clear(); bottom.emplace_back(idx, vref); } else if(vy == min_y) { bottom.emplace_back(idx, vref); } idx++; } // Get the top and bottom leftmost vertices, or the right and left // downmost vertices (if dir == Dir::DOWN) auto topleft_it = std::min_element(top.begin(), top.end(), cmp); auto bottomleft_it = std::min_element(bottom.begin(), bottom.end(), cmp); auto& topleft_vertex = topleft_it->second.get(); auto& bottomleft_vertex = bottomleft_it->second.get(); // Start and finish positions for the vertices that will be part of the // new polygon auto start = std::min(topleft_it->first, bottomleft_it->first); auto finish = std::max(topleft_it->first, bottomleft_it->first); RawShape ret; // the return shape auto& rsh = sl::contour(ret); // reserve for all vertices plus 2 for the left horizontal wall, 2 for // the additional vertices for maintaning min object distance sl::reserve(rsh, finish-start+4); /*auto addOthers = [&rsh, finish, start, &item](){ for(size_t i = start+1; i < finish; i++) sl::addVertex(rsh, item.vertex(i)); };*/ auto reverseAddOthers = [&rsh, finish, start, &item](){ for(auto i = finish-1; i > start; i--) sl::addVertex(rsh, item.vertex( static_cast(i))); }; // Final polygon construction... static_assert(OrientationType::Value == Orientation::CLOCKWISE, "Counter clockwise toWallPoly() Unimplemented!"); // Clockwise polygon construction sl::addVertex(rsh, topleft_vertex); if(dir == Dir::LEFT) reverseAddOthers(); else { sl::addVertex(rsh, getX(topleft_vertex), 0); sl::addVertex(rsh, getX(bottomleft_vertex), 0); } sl::addVertex(rsh, bottomleft_vertex); if(dir == Dir::LEFT) { sl::addVertex(rsh, 0, getY(bottomleft_vertex)); sl::addVertex(rsh, 0, getY(topleft_vertex)); } else reverseAddOthers(); // Close the polygon sl::addVertex(rsh, topleft_vertex); return ret; } }; } } #endif //BOTTOMLEFT_HPP libnest2d-5.0.0/include/libnest2d/placers/nfpplacer.hpp000066400000000000000000001144401422601530300230270ustar00rootroot00000000000000#ifndef NOFITPOLY_HPP #define NOFITPOLY_HPP #include // For parallel for #include #include #include #include #ifndef NDEBUG #include #endif #include #include #include "placer_boilerplate.hpp" // temporary //#include "../tools/svgtools.hpp" #include namespace libnest2d { namespace placers { template struct NfpPConfig { using ItemGroup = _ItemGroup; enum class Alignment { CENTER, BOTTOM_LEFT, BOTTOM_RIGHT, TOP_LEFT, TOP_RIGHT, DONT_ALIGN //!> Warning: parts may end up outside the bin with the //! default object function. }; /// Which angles to try out for better results. std::vector rotations; /// Where to align the resulting packed pile. Alignment alignment; /// Where to start putting objects in the bin. Alignment starting_point; /** * @brief A function object representing the fitting function in the * placement optimization process. (Optional) * * This is the most versatile tool to configure the placer. The fitting * function is evaluated many times when a new item is being placed into the * bin. The output should be a rated score of the new item's position. * * This is not a mandatory option as there is a default fitting function * that will optimize for the best pack efficiency. With a custom fitting * function you can e.g. influence the shape of the arranged pile. * * \param item The only parameter is the candidate item which has info * about its current position. Your job is to rate this position compared to * the already packed items. * */ std::function&)> object_function; /** * @brief The quality of search for an optimal placement. * This is a compromise slider between quality and speed. Zero is the * fast and poor solution while 1.0 is the slowest but most accurate. */ float accuracy = 0.65f; /** * @brief If you want to see items inside other item's holes, you have to * turn this switch on. * * This will only work if a suitable nfp implementation is provided. * The library has no such implementation right now. */ bool explore_holes = false; /** * @brief If true, use all CPUs available. Run on a single core otherwise. */ bool parallel = true; /** * @brief before_packing Callback that is called just before a search for * a new item's position is started. You can use this to create various * cache structures and update them between subsequent packings. * * \param merged pile A polygon that is the union of all items in the bin. * * \param pile The items parameter is a container with all the placed * polygons excluding the current candidate. You can for instance check the * alignment with the candidate item or do anything else. * * \param remaining A container with the remaining items waiting to be * placed. You can use some features about the remaining items to alter the * score of the current placement. If you know that you have to leave place * for other items as well, that might influence your decision about where * the current candidate should be placed. E.g. imagine three big circles * which you want to place into a box: you might place them in a triangle * shape which has the maximum pack density. But if there is a 4th big * circle than you won't be able to pack it. If you knew apriori that * there four circles are to be placed, you would have placed the first 3 * into an L shape. This parameter can be used to make these kind of * decisions (for you or a more intelligent AI). */ std::function&, // merged pile const ItemGroup&, // packed items const ItemGroup& // remaining items )> before_packing; NfpPConfig(): rotations({0.0, Pi/2.0, Pi, 3*Pi/2}), alignment(Alignment::CENTER), starting_point(Alignment::CENTER) {} }; /** * A class for getting a point on the circumference of the polygon (in log time) * * This is a transformation of the provided polygon to be able to pinpoint * locations on the circumference. The optimizer will pass a floating point * value e.g. within <0,1> and we have to transform this value quickly into a * coordinate on the circumference. By definition 0 should yield the first * vertex and 1.0 would be the last (which should coincide with first). * * We also have to make this work for the holes of the captured polygon. */ template class EdgeCache { using Vertex = TPoint; using Coord = TCoord; using Edge = _Segment; struct ContourCache { mutable std::vector corners; std::vector emap; std::vector distances; double full_distance = 0; } contour_; std::vector holes_; double accuracy_ = 1.0; static double length(const Edge &e) { return std::sqrt(e.template sqlength()); } void createCache(const RawShape& sh) { { // For the contour auto first = shapelike::cbegin(sh); auto next = std::next(first); auto endit = shapelike::cend(sh); contour_.distances.reserve(shapelike::contourVertexCount(sh)); while(next != endit) { contour_.emap.emplace_back(*(first++), *(next++)); contour_.full_distance += length(contour_.emap.back()); contour_.distances.emplace_back(contour_.full_distance); } } for(auto& h : shapelike::holes(sh)) { // For the holes auto first = h.begin(); auto next = std::next(first); auto endit = h.end(); ContourCache hc; hc.distances.reserve(endit - first); while(next != endit) { hc.emap.emplace_back(*(first++), *(next++)); hc.full_distance += length(hc.emap.back()); hc.distances.emplace_back(hc.full_distance); } holes_.emplace_back(std::move(hc)); } } size_t stride(const size_t N) const { using std::round; using std::pow; return static_cast( round(N/pow(N, pow(accuracy_, 1.0/3.0))) ); } void fetchCorners() const { if(!contour_.corners.empty()) return; const auto N = contour_.distances.size(); const auto S = stride(N); contour_.corners.reserve(N / S + 1); contour_.corners.emplace_back(0.0); auto N_1 = N-1; contour_.corners.emplace_back(0.0); for(size_t i = 0; i < N_1; i += S) { contour_.corners.emplace_back( contour_.distances.at(i) / contour_.full_distance); } } void fetchHoleCorners(unsigned hidx) const { auto& hc = holes_[hidx]; if(!hc.corners.empty()) return; const auto N = hc.distances.size(); auto N_1 = N-1; const auto S = stride(N); hc.corners.reserve(N / S + 1); hc.corners.emplace_back(0.0); for(size_t i = 0; i < N_1; i += S) { hc.corners.emplace_back( hc.distances.at(i) / hc.full_distance); } } inline Vertex coords(const ContourCache& cache, double distance) const { assert(distance >= .0 && distance <= 1.0); // distance is from 0.0 to 1.0, we scale it up to the full length of // the circumference double d = distance*cache.full_distance; auto& distances = cache.distances; // Magic: we find the right edge in log time auto it = std::lower_bound(distances.begin(), distances.end(), d); auto idx = it - distances.begin(); // get the index of the edge auto edge = cache.emap[idx]; // extrac the edge // Get the remaining distance on the target edge auto ed = d - (idx > 0 ? *std::prev(it) : 0 ); auto angle = edge.angleToXaxis(); Vertex ret = edge.first(); // Get the point on the edge which lies in ed distance from the start ret += { static_cast(std::round(ed*std::cos(angle))), static_cast(std::round(ed*std::sin(angle))) }; return ret; } public: using iterator = std::vector::iterator; using const_iterator = std::vector::const_iterator; inline EdgeCache() = default; inline EdgeCache(const _Item& item) { createCache(item.transformedShape()); } inline EdgeCache(const RawShape& sh) { createCache(sh); } /// Resolution of returned corners. The stride is derived from this value. void accuracy(double a /* within <0.0, 1.0>*/) { accuracy_ = a; } /** * @brief Get a point on the circumference of a polygon. * @param distance A relative distance from the starting point to the end. * Can be from 0.0 to 1.0 where 0.0 is the starting point and 1.0 is the * closing point (which should be eqvivalent with the starting point with * closed polygons). * @return Returns the coordinates of the point lying on the polygon * circumference. */ inline Vertex coords(double distance) const { return coords(contour_, distance); } inline Vertex coords(unsigned hidx, double distance) const { assert(hidx < holes_.size()); return coords(holes_[hidx], distance); } inline double circumference() const BP2D_NOEXCEPT { return contour_.full_distance; } inline double circumference(unsigned hidx) const BP2D_NOEXCEPT { return holes_[hidx].full_distance; } /// Get the normalized distance values for each vertex inline const std::vector& corners() const BP2D_NOEXCEPT { fetchCorners(); return contour_.corners; } /// corners for a specific hole inline const std::vector& corners(unsigned holeidx) const BP2D_NOEXCEPT { fetchHoleCorners(holeidx); return holes_[holeidx].corners; } /// The number of holes in the abstracted polygon inline size_t holeCount() const BP2D_NOEXCEPT { return holes_.size(); } }; template struct Lvl { static const nfp::NfpLevel value = lvl; }; template inline void correctNfpPosition(nfp::NfpResult& nfp, const _Item& stationary, const _Item& orbiter) { // The provided nfp is somewhere in the dark. We need to get it // to the right position around the stationary shape. // This is done by choosing the leftmost lowest vertex of the // orbiting polygon to be touched with the rightmost upper // vertex of the stationary polygon. In this configuration, the // reference vertex of the orbiting polygon (which can be dragged around // the nfp) will be its rightmost upper vertex that coincides with the // rightmost upper vertex of the nfp. No proof provided other than Jonas // Lindmark's reasoning about the reference vertex of nfp in his thesis // ("No fit polygon problem" - section 2.1.9) auto touch_sh = stationary.rightmostTopVertex(); auto touch_other = orbiter.leftmostBottomVertex(); auto dtouch = touch_sh - touch_other; auto top_other = orbiter.rightmostTopVertex() + dtouch; auto dnfp = top_other - nfp.second; // nfp.second is the nfp reference point shapelike::translate(nfp.first, dnfp); } template inline void correctNfpPosition(nfp::NfpResult& nfp, const RawShape& stationary, const _Item& orbiter) { auto touch_sh = nfp::rightmostUpVertex(stationary); auto touch_other = orbiter.leftmostBottomVertex(); auto dtouch = touch_sh - touch_other; auto top_other = orbiter.rightmostTopVertex() + dtouch; auto dnfp = top_other - nfp.second; shapelike::translate(nfp.first, dnfp); } template> > Circle minimizeCircle(const RawShape& sh) { using Point = TPoint; using Coord = TCoord; auto& ctr = sl::contour(sh); if(ctr.empty()) return {{0, 0}, 0}; auto bb = sl::boundingBox(sh); auto capprx = bb.center(); auto rapprx = pl::distance(bb.minCorner(), bb.maxCorner()); opt::StopCriteria stopcr; stopcr.max_iterations = 30; stopcr.relative_score_difference = 1e-3; opt::TOptimizer solver(stopcr); std::vector dists(ctr.size(), 0); auto result = solver.optimize_min( [capprx, rapprx, &ctr, &dists](double xf, double yf) { auto xt = Coord( std::round(getX(capprx) + rapprx*xf) ); auto yt = Coord( std::round(getY(capprx) + rapprx*yf) ); Point centr(xt, yt); unsigned i = 0; for(auto v : ctr) { dists[i++] = pl::distance(v, centr); } auto mit = std::max_element(dists.begin(), dists.end()); assert(mit != dists.end()); return *mit; }, opt::initvals(0.0, 0.0), opt::bound(-1.0, 1.0), opt::bound(-1.0, 1.0) ); double oxf = std::get<0>(result.optimum); double oyf = std::get<1>(result.optimum); auto xt = Coord( std::round(getX(capprx) + rapprx*oxf) ); auto yt = Coord( std::round(getY(capprx) + rapprx*oyf) ); Point cc(xt, yt); auto r = result.score; return {cc, r}; } template _Circle> boundingCircle(const RawShape& sh) { return minimizeCircle(sh); } template>> class _NofitPolyPlacer: public PlacerBoilerplate<_NofitPolyPlacer, RawShape, TBin, NfpPConfig> { using Base = PlacerBoilerplate<_NofitPolyPlacer, RawShape, TBin, NfpPConfig>; DECLARE_PLACER(Base) using Box = _Box>; using MaxNfpLevel = nfp::MaxNfpLevel; // Norming factor for the optimization function const double norm_; public: using Pile = nfp::Shapes; inline explicit _NofitPolyPlacer(const BinType& bin): Base(bin), norm_(std::sqrt(sl::area(bin))) { // In order to not have items out of bin, it will be shrinked by an // very little empiric offset value. // sl::offset(bin_, 1e-5 * norm_); } _NofitPolyPlacer(const _NofitPolyPlacer&) = default; _NofitPolyPlacer& operator=(const _NofitPolyPlacer&) = default; #ifndef BP2D_COMPILER_MSVC12 // MSVC2013 does not support default move ctors _NofitPolyPlacer(_NofitPolyPlacer&&) = default; _NofitPolyPlacer& operator=(_NofitPolyPlacer&&) = default; #endif static inline double overfit(const Box& bb, const RawShape& bin) { auto bbin = sl::boundingBox(bin); auto d = bbin.center() - bb.center(); _Rectangle rect(bb.width(), bb.height()); rect.translate(bb.minCorner() + d); return sl::isInside(rect.transformedShape(), bin) ? -1.0 : 1; } static inline double overfit(const RawShape& chull, const RawShape& bin) { auto bbch = sl::boundingBox(chull); auto bbin = sl::boundingBox(bin); auto d = bbch.center() - bbin.center(); auto chullcpy = chull; sl::translate(chullcpy, d); return sl::isInside(chullcpy, bin) ? -1.0 : 1.0; } static inline double overfit(const RawShape& chull, const Box& bin) { auto bbch = sl::boundingBox(chull); return overfit(bbch, bin); } static inline double overfit(const Box& bb, const Box& bin) { auto Bw = bin.width(); auto Bh = bin.height(); auto mBw = -Bw; auto mBh = -Bh; auto wdiff = double(bb.width()) + mBw; auto hdiff = double(bb.height()) + mBh; double diff = 0; if(wdiff > 0) diff += wdiff; if(hdiff > 0) diff += hdiff; return diff; } static inline double overfit(const Box& bb, const _Circle& bin) { double boxr = 0.5*pl::distance(bb.minCorner(), bb.maxCorner()); double diff = boxr - bin.radius(); return diff; } static inline double overfit(const RawShape& chull, const _Circle& bin) { double r = boundingCircle(chull).radius(); double diff = r - bin.radius(); return diff; } template> PackResult trypack(Item& item, const Range& remaining = Range()) { auto result = _trypack(item, remaining); // Experimental // if(!result) repack(item, result); return result; } ~_NofitPolyPlacer() { clearItems(); } inline void clearItems() { finalAlign(bin_); Base::clearItems(); } private: using Shapes = TMultiShape; Shapes calcnfp(const Item &trsh, Lvl) { using namespace nfp; Shapes nfps(items_.size()); // ///////////////////////////////////////////////////////////////////// // TODO: this is a workaround and should be solved in Item with mutexes // guarding the mutable members when writing them. // ///////////////////////////////////////////////////////////////////// trsh.transformedShape(); trsh.referenceVertex(); trsh.rightmostTopVertex(); trsh.leftmostBottomVertex(); for(Item& itm : items_) { itm.transformedShape(); itm.referenceVertex(); itm.rightmostTopVertex(); itm.leftmostBottomVertex(); } // ///////////////////////////////////////////////////////////////////// __parallel::enumerate(items_.begin(), items_.end(), [&nfps, &trsh](const Item& sh, size_t n) { auto& fixedp = sh.transformedShape(); auto& orbp = trsh.transformedShape(); auto subnfp_r = noFitPolygon(fixedp, orbp); correctNfpPosition(subnfp_r, sh, trsh); nfps[n] = subnfp_r.first; }); return nfp::merge(nfps); } template Shapes calcnfp(const Item &trsh, Level) { // Function for arbitrary level of nfp implementation using namespace nfp; Shapes nfps; auto& orb = trsh.transformedShape(); bool orbconvex = trsh.isContourConvex(); for(Item& sh : items_) { nfp::NfpResult subnfp; auto& stat = sh.transformedShape(); if(sh.isContourConvex() && orbconvex) subnfp = nfp::noFitPolygon(stat, orb); else if(orbconvex) subnfp = nfp::noFitPolygon(stat, orb); else subnfp = nfp::noFitPolygon(stat, orb); correctNfpPosition(subnfp, sh, trsh); nfps = nfp::merge(nfps, subnfp.first); } return nfps; } // Very much experimental void repack(Item& item, PackResult& result) { if((sl::area(bin_) - this->filledArea()) >= item.area()) { auto prev_func = config_.object_function; unsigned iter = 0; ItemGroup backup_rf = items_; std::vector backup_cpy; for(Item& itm : items_) backup_cpy.emplace_back(itm); auto ofn = [this, &item, &result, &iter, &backup_cpy, &backup_rf] (double ratio) { auto& bin = bin_; iter++; config_.object_function = [bin, ratio]( nfp::Shapes& pile, const Item& item, const ItemGroup& /*remaining*/) { pile.emplace_back(item.transformedShape()); auto ch = sl::convexHull(pile); auto pbb = sl::boundingBox(pile); pile.pop_back(); double parea = 0.5*(sl::area(ch) + sl::area(pbb)); double pile_area = std::accumulate( pile.begin(), pile.end(), item.area(), [](double sum, const RawShape& sh){ return sum + sl::area(sh); }); // The pack ratio -- how much is the convex hull occupied double pack_rate = (pile_area)/parea; // ratio of waste double waste = 1.0 - pack_rate; // Score is the square root of waste. This will extend the // range of good (lower) values and shrink the range of bad // (larger) values. auto wscore = std::sqrt(waste); auto ibb = item.boundingBox(); auto bbb = sl::boundingBox(bin); auto c = ibb.center(); double norm = 0.5*pl::distance(bbb.minCorner(), bbb.maxCorner()); double dscore = pl::distance(c, pbb.center()) / norm; return ratio*wscore + (1.0 - ratio) * dscore; }; auto bb = sl::boundingBox(bin); double norm = bb.width() + bb.height(); auto items = items_; clearItems(); auto it = items.begin(); while(auto pr = _trypack(*it++)) { this->accept(pr); if(it == items.end()) break; } auto count_diff = items.size() - items_.size(); double score = count_diff; if(count_diff == 0) { result = _trypack(item); if(result) { std::cout << "Success" << std::endl; score = 0.0; } else { score += result.overfit() / norm; } } else { result = PackResult(); items_ = backup_rf; for(unsigned i = 0; i < items_.size(); i++) { items_[i].get() = backup_cpy[i]; } } std::cout << iter << " repack result: " << score << " " << ratio << " " << count_diff << std::endl; return score; }; opt::StopCriteria stopcr; stopcr.max_iterations = 30; stopcr.stop_score = 1e-20; opt::TOptimizer solver(stopcr); solver.optimize_min(ofn, opt::initvals(0.5), opt::bound(0.0, 1.0)); // optimize config_.object_function = prev_func; } } struct Optimum { double relpos; unsigned nfpidx; int hidx; Optimum(double pos, unsigned nidx): relpos(pos), nfpidx(nidx), hidx(-1) {} Optimum(double pos, unsigned nidx, int holeidx): relpos(pos), nfpidx(nidx), hidx(holeidx) {} }; class Optimizer: public opt::TOptimizer { public: Optimizer(float accuracy = 1.f) { opt::StopCriteria stopcr; stopcr.max_iterations = unsigned(std::floor(1000 * accuracy)); stopcr.relative_score_difference = 1e-20; this->stopcr_ = stopcr; } }; using Edges = EdgeCache; template> PackResult _trypack( Item& item, const Range& remaining = Range()) { PackResult ret; bool can_pack = false; double best_overfit = std::numeric_limits::max(); ItemGroup remlist; if(remaining.valid) { remlist.insert(remlist.end(), remaining.from, remaining.to); } if(std::all_of(items_.begin(), items_.end(), [](const Item& item) { return item.isDisallowedArea(); })) { setInitialPosition(item); best_overfit = overfit(item.transformedShape(), bin_); can_pack = best_overfit <= 0; } else { double global_score = std::numeric_limits::max(); auto initial_tr = item.translation(); auto initial_rot = item.rotation(); Vertex final_tr = {0, 0}; Radians final_rot = initial_rot; Shapes nfps; for(auto rot : config_.rotations) { item.translation(initial_tr); item.rotation(initial_rot + rot); item.boundingBox(); // fill the bb cache // place the new item outside of the print bed to make sure // it is disjunct from the current merged pile placeOutsideOfBin(item); nfps = calcnfp(item, Lvl()); auto iv = item.referenceVertex(); auto startpos = item.translation(); std::vector ecache; ecache.reserve(nfps.size()); for(auto& nfp : nfps ) { ecache.emplace_back(nfp); ecache.back().accuracy(config_.accuracy); } Shapes pile; pile.reserve(items_.size()+1); // double pile_area = 0; for(Item& mitem : items_) { pile.emplace_back(mitem.transformedShape()); // pile_area += mitem.area(); } auto merged_pile = nfp::merge(pile); auto& bin = bin_; double norm = norm_; auto pbb = sl::boundingBox(merged_pile); auto binbb = sl::boundingBox(bin); // This is the kernel part of the object function that is // customizable by the library client std::function _objfunc; if(config_.object_function) _objfunc = config_.object_function; else { // Inside check has to be strict if no alignment was enabled std::function ins_check; if(config_.alignment == Config::Alignment::DONT_ALIGN) ins_check = [&binbb, norm](const Box& fullbb) { double ret = 0; if(!sl::isInside(fullbb, binbb)) ret += norm; return ret; }; else ins_check = [&bin](const Box& fullbb) { double miss = overfit(fullbb, bin); miss = miss > 0? miss : 0; return std::pow(miss, 2); }; _objfunc = [norm, binbb, pbb, ins_check](const Item& item) { auto ibb = item.boundingBox(); auto fullbb = sl::boundingBox(pbb, ibb); double score = pl::distance(ibb.center(), binbb.center()); score /= norm; score += ins_check(fullbb); return score; }; } // Our object function for placement auto rawobjfunc = [_objfunc, iv, startpos] (Vertex v, Item& itm) { auto d = v - iv; d += startpos; itm.translation(d); return _objfunc(itm); }; auto getNfpPoint = [&ecache](const Optimum& opt) { return opt.hidx < 0? ecache[opt.nfpidx].coords(opt.relpos) : ecache[opt.nfpidx].coords(opt.hidx, opt.relpos); }; auto alignment = config_.alignment; auto boundaryCheck = [alignment, &merged_pile, &getNfpPoint, &item, &bin, &iv, &startpos] (const Optimum& o) { auto v = getNfpPoint(o); auto d = v - iv; d += startpos; item.translation(d); merged_pile.emplace_back(item.transformedShape()); auto chull = sl::convexHull(merged_pile); merged_pile.pop_back(); double miss = 0; if(alignment == Config::Alignment::DONT_ALIGN) miss = sl::isInside(chull, bin) ? -1.0 : 1.0; else miss = overfit(chull, bin); return miss; }; Optimum optimum(0, 0); double best_score = std::numeric_limits::max(); std::launch policy = std::launch::deferred; if(config_.parallel) policy |= std::launch::async; if(config_.before_packing) config_.before_packing(merged_pile, items_, remlist); using OptResult = opt::Result; using OptResults = std::vector; // Local optimization with the four polygon corners as // starting points for(unsigned ch = 0; ch < ecache.size(); ch++) { auto& cache = ecache[ch]; OptResults results(cache.corners().size()); auto& rofn = rawobjfunc; auto& nfpoint = getNfpPoint; float accuracy = config_.accuracy; __parallel::enumerate( cache.corners().begin(), cache.corners().end(), [&results, &item, &rofn, &nfpoint, ch, accuracy] (double pos, size_t n) { Optimizer solver(accuracy); Item itemcpy = item; auto contour_ofn = [&rofn, &nfpoint, ch, &itemcpy] (double relpos) { Optimum op(relpos, ch); return rofn(nfpoint(op), itemcpy); }; try { results[n] = solver.optimize_min(contour_ofn, opt::initvals(pos), opt::bound(0, 1.0) ); } catch(std::exception& e) { derr() << "ERROR: " << e.what() << "\n"; } }, policy); auto resultcomp = []( const OptResult& r1, const OptResult& r2 ) { return r1.score < r2.score; }; auto mr = *std::min_element(results.begin(), results.end(), resultcomp); if(mr.score < best_score) { Optimum o(std::get<0>(mr.optimum), ch, -1); double miss = boundaryCheck(o); if(miss <= 0) { best_score = mr.score; optimum = o; } else { best_overfit = std::min(miss, best_overfit); } } for(unsigned hidx = 0; hidx < cache.holeCount(); ++hidx) { results.clear(); results.resize(cache.corners(hidx).size()); // TODO : use parallel for __parallel::enumerate(cache.corners(hidx).begin(), cache.corners(hidx).end(), [&results, &item, &nfpoint, &rofn, ch, hidx, accuracy] (double pos, size_t n) { Optimizer solver(accuracy); Item itmcpy = item; auto hole_ofn = [&rofn, &nfpoint, ch, hidx, &itmcpy] (double pos) { Optimum opt(pos, ch, hidx); return rofn(nfpoint(opt), itmcpy); }; try { results[n] = solver.optimize_min(hole_ofn, opt::initvals(pos), opt::bound(0, 1.0) ); } catch(std::exception& e) { derr() << "ERROR: " << e.what() << "\n"; } }, policy); auto hmr = *std::min_element(results.begin(), results.end(), resultcomp); if(hmr.score < best_score) { Optimum o(std::get<0>(hmr.optimum), ch, hidx); double miss = boundaryCheck(o); if(miss <= 0.0) { best_score = hmr.score; optimum = o; } else { best_overfit = std::min(miss, best_overfit); } } } } if( best_score < global_score ) { auto d = getNfpPoint(optimum) - iv; d += startpos; final_tr = d; final_rot = initial_rot + rot; can_pack = true; global_score = best_score; } } item.translation(final_tr); item.rotation(final_rot); } if(can_pack) { ret = PackResult(item); } else { ret = PackResult(best_overfit); } return ret; } inline void finalAlign(const RawShape& pbin) { auto bbin = sl::boundingBox(pbin); finalAlign(bbin); } inline void finalAlign(_Circle> cbin) { if(items_.empty() || config_.alignment == Config::Alignment::DONT_ALIGN) return; nfp::Shapes m; m.reserve(items_.size()); for(Item& item : items_) m.emplace_back(item.transformedShape()); auto c = boundingCircle(sl::convexHull(m)); auto d = cbin.center() - c.center(); for(Item& item : items_) item.translate(d); } inline void finalAlign(Box bbin) { if(items_.empty() || config_.alignment == Config::Alignment::DONT_ALIGN) return; nfp::Shapes m; m.reserve(items_.size()); for(Item& item : items_) m.emplace_back(item.transformedShape()); auto&& bb = sl::boundingBox(m); Vertex ci, cb; switch(config_.alignment) { case Config::Alignment::CENTER: { ci = bb.center(); cb = bbin.center(); break; } case Config::Alignment::BOTTOM_LEFT: { ci = bb.minCorner(); cb = bbin.minCorner(); break; } case Config::Alignment::BOTTOM_RIGHT: { ci = {getX(bb.maxCorner()), getY(bb.minCorner())}; cb = {getX(bbin.maxCorner()), getY(bbin.minCorner())}; break; } case Config::Alignment::TOP_LEFT: { ci = {getX(bb.minCorner()), getY(bb.maxCorner())}; cb = {getX(bbin.minCorner()), getY(bbin.maxCorner())}; break; } case Config::Alignment::TOP_RIGHT: { ci = bb.maxCorner(); cb = bbin.maxCorner(); break; } default: ; // DONT_ALIGN } auto d = cb - ci; for(Item& item : items_) item.translate(d); } void setInitialPosition(Item& item) { auto sh = item.rawShape(); sl::translate(sh, item.translation()); sl::rotate(sh, item.rotation()); Box bb = sl::boundingBox(sh); Vertex ci, cb; auto bbin = sl::boundingBox(bin_); switch(config_.starting_point) { case Config::Alignment::CENTER: { ci = bb.center(); cb = bbin.center(); break; } case Config::Alignment::BOTTOM_LEFT: { ci = bb.minCorner(); cb = bbin.minCorner(); break; } case Config::Alignment::BOTTOM_RIGHT: { ci = {getX(bb.maxCorner()), getY(bb.minCorner())}; cb = {getX(bbin.maxCorner()), getY(bbin.minCorner())}; break; } case Config::Alignment::TOP_LEFT: { ci = {getX(bb.minCorner()), getY(bb.maxCorner())}; cb = {getX(bbin.minCorner()), getY(bbin.maxCorner())}; break; } case Config::Alignment::TOP_RIGHT: { ci = bb.maxCorner(); cb = bbin.maxCorner(); break; } default:; } auto d = cb - ci; item.translate(d); } void placeOutsideOfBin(Item& item) { auto&& bb = item.boundingBox(); Box binbb = sl::boundingBox(bin_); Vertex v = { getX(bb.maxCorner()), getY(bb.minCorner()) }; Coord dx = getX(binbb.maxCorner()) - getX(v); Coord dy = getY(binbb.maxCorner()) - getY(v); item.translate({dx, dy}); } }; } } #endif // NOFITPOLY_H libnest2d-5.0.0/include/libnest2d/placers/placer_boilerplate.hpp000066400000000000000000000067301422601530300247070ustar00rootroot00000000000000#ifndef PLACER_BOILERPLATE_HPP #define PLACER_BOILERPLATE_HPP #include namespace libnest2d { namespace placers { struct EmptyConfig {}; template class PlacerBoilerplate { mutable bool farea_valid_ = false; mutable double farea_ = 0.0; public: using ShapeType = RawShape; using Item = _Item; using Vertex = TPoint; using Segment = _Segment; using BinType = TBin; using Coord = TCoord; using Config = Cfg; using ItemGroup = _ItemGroup; using DefaultIter = typename ItemGroup::const_iterator; class PackResult { Item *item_ptr_; Vertex move_; Radians rot_; double overfit_; friend class PlacerBoilerplate; friend Subclass; PackResult(Item& item): item_ptr_(&item), move_(item.translation()), rot_(item.rotation()) {} PackResult(double overfit = 1.0): item_ptr_(nullptr), overfit_(overfit) {} public: operator bool() { return item_ptr_ != nullptr; } double overfit() const { return overfit_; } }; inline PlacerBoilerplate(const BinType& bin, unsigned cap = 50): bin_(bin) { items_.reserve(cap); } inline const BinType& bin() const BP2D_NOEXCEPT { return bin_; } template inline void bin(TB&& b) { bin_ = std::forward(b); } inline void configure(const Config& config) BP2D_NOEXCEPT { config_ = config; } template> bool pack(Item& item, const Range& rem = Range()) { auto&& r = static_cast(this)->trypack(item, rem); if(r) { items_.emplace_back(*(r.item_ptr_)); farea_valid_ = false; } return r; } void preload(const ItemGroup& packeditems) { items_.insert(items_.end(), packeditems.begin(), packeditems.end()); farea_valid_ = false; } void accept(PackResult& r) { if(r) { r.item_ptr_->translation(r.move_); r.item_ptr_->rotation(r.rot_); items_.emplace_back(*(r.item_ptr_)); farea_valid_ = false; } } void unpackLast() { items_.pop_back(); farea_valid_ = false; } inline const ItemGroup& getItems() const { return items_; } inline void clearItems() { items_.clear(); farea_valid_ = false; } inline double filledArea() const { if(farea_valid_) return farea_; else { farea_ = .0; std::for_each(items_.begin(), items_.end(), [this] (Item& item) { farea_ += item.area(); }); farea_valid_ = true; } return farea_; } protected: BinType bin_; ItemGroup items_; Cfg config_; }; #define DECLARE_PLACER(Base) \ using Base::bin_; \ using Base::items_; \ using Base::config_; \ public: \ using typename Base::ShapeType; \ using typename Base::Item; \ using typename Base::ItemGroup; \ using typename Base::BinType; \ using typename Base::Config; \ using typename Base::Vertex; \ using typename Base::Segment; \ using typename Base::PackResult; \ using typename Base::Coord; \ private: } } #endif // PLACER_BOILERPLATE_HPP libnest2d-5.0.0/include/libnest2d/selections/000077500000000000000000000000001422601530300210575ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/selections/djd_heuristic.hpp000066400000000000000000000611101422601530300244070ustar00rootroot00000000000000#ifndef DJD_HEURISTIC_HPP #define DJD_HEURISTIC_HPP #include #include #include #include #include "selection_boilerplate.hpp" namespace libnest2d { namespace selections { /** * Selection heuristic based on [López-Camacho]\ * (http://www.cs.stir.ac.uk/~goc/papers/EffectiveHueristic2DAOR2013.pdf) */ template class _DJDHeuristic: public SelectionBoilerplate { using Base = SelectionBoilerplate; class SpinLock { std::atomic_flag& lck_; public: inline SpinLock(std::atomic_flag& flg): lck_(flg) {} inline void lock() { while(lck_.test_and_set(std::memory_order_acquire)) {} } inline void unlock() { lck_.clear(std::memory_order_release); } }; public: using typename Base::Item; using ItemRef = std::reference_wrapper; /** * @brief The Config for DJD heuristic. */ struct Config { /** * If true, the algorithm will try to place pair and triplets in all * possible order. It will have a hugely negative impact on performance. */ bool try_reverse_order = true; /** * @brief try_pairs Whether to try pairs of items to pack. It will add * a quadratic component to the complexity. */ bool try_pairs = true; /** * @brief Whether to try groups of 3 items to pack. This could be very * slow for large number of items (>100) as it adds a cubic component * to the complexity. */ bool try_triplets = false; /** * The initial fill proportion of the bin area that will be filled before * trying items one by one, or pairs or triplets. * * The initial fill proportion suggested by * [López-Camacho]\ * (http://www.cs.stir.ac.uk/~goc/papers/EffectiveHueristic2DAOR2013.pdf) * is one third of the area of bin. */ double initial_fill_proportion = 1.0/3.0; /** * @brief How much is the acceptable waste incremented at each iteration */ double waste_increment = 0.1; /** * @brief Allow parallel jobs for filling multiple bins. * * This will decrease the soution quality but can greatly boost up * performance for large number of items. */ bool allow_parallel = true; /** * @brief Always use parallel processing if the items don't fit into * one bin. */ bool force_parallel = false; }; private: using Base::packed_bins_; using ItemGroup = typename Base::ItemGroup; using Container = ItemGroup; Container store_; Config config_; static const unsigned MAX_ITEMS_SEQUENTIALLY = 30; static const unsigned MAX_VERTICES_SEQUENTIALLY = MAX_ITEMS_SEQUENTIALLY*20; public: inline void configure(const Config& config) { config_ = config; } template::BinType, class PConfig = typename PlacementStrategyLike::Config> void packItems( TIterator first, TIterator last, const TBin& bin, PConfig&& pconfig = PConfig() ) { using Placer = PlacementStrategyLike; using ItemList = std::list; const double bin_area = sl::area(bin); const double w = bin_area * config_.waste_increment; const double INITIAL_FILL_PROPORTION = config_.initial_fill_proportion; const double INITIAL_FILL_AREA = bin_area*INITIAL_FILL_PROPORTION; store_.clear(); store_.reserve(last-first); // TODO: support preloading packed_bins_.clear(); std::copy(first, last, std::back_inserter(store_)); std::sort(store_.begin(), store_.end(), [](Item& i1, Item& i2) { return i1.area() > i2.area(); }); size_t glob_vertex_count = 0; std::for_each(store_.begin(), store_.end(), [&glob_vertex_count](const Item& item) { glob_vertex_count += item.vertexCount(); }); std::vector placers; bool try_reverse = config_.try_reverse_order; // Will use a subroutine to add a new bin auto addBin = [this, &placers, &bin, &pconfig]() { placers.emplace_back(bin); packed_bins_.emplace_back(); placers.back().configure(pconfig); }; // Types for pairs and triplets using TPair = std::tuple; using TTriplet = std::tuple; // Method for checking a pair whether it was a pack failure. auto check_pair = [](const std::vector& wrong_pairs, ItemRef i1, ItemRef i2) { return std::any_of(wrong_pairs.begin(), wrong_pairs.end(), [&i1, &i2](const TPair& pair) { Item& pi1 = std::get<0>(pair), &pi2 = std::get<1>(pair); Item& ri1 = i1, &ri2 = i2; return (&pi1 == &ri1 && &pi2 == &ri2) || (&pi1 == &ri2 && &pi2 == &ri1); }); }; // Method for checking if a triplet was a pack failure auto check_triplet = []( const std::vector& wrong_triplets, ItemRef i1, ItemRef i2, ItemRef i3) { return std::any_of(wrong_triplets.begin(), wrong_triplets.end(), [&i1, &i2, &i3](const TTriplet& tripl) { Item& pi1 = std::get<0>(tripl); Item& pi2 = std::get<1>(tripl); Item& pi3 = std::get<2>(tripl); Item& ri1 = i1, &ri2 = i2, &ri3 = i3; return (&pi1 == &ri1 && &pi2 == &ri2 && &pi3 == &ri3) || (&pi1 == &ri1 && &pi2 == &ri3 && &pi3 == &ri2) || (&pi1 == &ri2 && &pi2 == &ri1 && &pi3 == &ri3) || (&pi1 == &ri3 && &pi2 == &ri2 && &pi3 == &ri1); }); }; using ItemListIt = typename ItemList::iterator; auto largestPiece = [](ItemListIt it, ItemList& not_packed) { return it == not_packed.begin()? std::next(it) : not_packed.begin(); }; auto secondLargestPiece = [&largestPiece](ItemListIt it, ItemList& not_packed) { auto ret = std::next(largestPiece(it, not_packed)); return ret == it? std::next(ret) : ret; }; auto smallestPiece = [](ItemListIt it, ItemList& not_packed) { auto last = std::prev(not_packed.end()); return it == last? std::prev(it) : last; }; auto secondSmallestPiece = [&smallestPiece](ItemListIt it, ItemList& not_packed) { auto ret = std::prev(smallestPiece(it, not_packed)); return ret == it? std::prev(ret) : ret; }; auto tryOneByOne = // Subroutine to try adding items one by one. [&bin_area] (Placer& placer, ItemList& not_packed, double waste, double& free_area, double& filled_area) { double item_area = 0; bool ret = false; auto it = not_packed.begin(); auto pack = [&placer, ¬_packed](ItemListIt it) { return placer.pack(*it, rem(it, not_packed)); }; while(it != not_packed.end() && !ret && free_area - (item_area = it->get().area()) <= waste) { if(item_area <= free_area && pack(it) ) { free_area -= item_area; filled_area = bin_area - free_area; ret = true; } else it++; } if(ret) not_packed.erase(it); return ret; }; auto tryGroupsOfTwo = // Try adding groups of two items into the bin. [&bin_area, &check_pair, &largestPiece, &smallestPiece, try_reverse] (Placer& placer, ItemList& not_packed, double waste, double& free_area, double& filled_area) { double item_area = 0; const auto endit = not_packed.end(); if(not_packed.size() < 2) return false; // No group of two items double largest_area = not_packed.front().get().area(); auto itmp = not_packed.begin(); itmp++; double second_largest = itmp->get().area(); if( free_area - second_largest - largest_area > waste) return false; // If even the largest two items do not fill // the bin to the desired waste than we can end here. bool ret = false; auto it = not_packed.begin(); auto it2 = it; std::vector wrong_pairs; using std::placeholders::_1; auto trypack = [&placer, ¬_packed](ItemListIt it) { return placer.trypack(*it, rem(it, not_packed)); }; while(it != endit && !ret && free_area - (item_area = it->get().area()) - largestPiece(it, not_packed)->get().area() <= waste) { if(item_area + smallestPiece(it, not_packed)->get().area() > free_area ) { it++; continue; } auto pr = trypack(it); // First would fit it2 = not_packed.begin(); double item2_area = 0; while(it2 != endit && pr && !ret && free_area - (item2_area = it2->get().area()) - item_area <= waste) { double area_sum = item_area + item2_area; if(it == it2 || area_sum > free_area || check_pair(wrong_pairs, *it, *it2)) { it2++; continue; } placer.accept(pr); auto pr2 = trypack(it2); if(!pr2) { placer.unpackLast(); // remove first if(try_reverse) { pr2 = trypack(it2); if(pr2) { placer.accept(pr2); auto pr12 = trypack(it); if(pr12) { placer.accept(pr12); ret = true; } else { placer.unpackLast(); } } } } else { placer.accept(pr2); ret = true; } if(ret) { // Second fits as well free_area -= area_sum; filled_area = bin_area - free_area; } else { wrong_pairs.emplace_back(*it, *it2); it2++; } } if(!ret) it++; } if(ret) { not_packed.erase(it); not_packed.erase(it2); } return ret; }; auto tryGroupsOfThree = // Try adding groups of three items. [&bin_area, &smallestPiece, &largestPiece, &secondSmallestPiece, &secondLargestPiece, &check_pair, &check_triplet, try_reverse] (Placer& placer, ItemList& not_packed, double waste, double& free_area, double& filled_area) { auto np_size = not_packed.size(); if(np_size < 3) return false; auto it = not_packed.begin(); // from const auto endit = not_packed.end(); // to auto it2 = it, it3 = it; // Containers for pairs and triplets that were tried before and // do not work. std::vector wrong_pairs; std::vector wrong_triplets; auto cap = np_size*np_size / 2 ; wrong_pairs.reserve(cap); wrong_triplets.reserve(cap); // Will be true if a succesfull pack can be made. bool ret = false; auto area = [](const ItemListIt& it) { return it->get().area(); }; auto trypack = [&placer, ¬_packed](ItemListIt it) { return placer.trypack(*it, rem(it, not_packed)); }; auto pack = [&placer, ¬_packed](ItemListIt it) { return placer.pack(*it, rem(it, not_packed)); }; while (it != endit && !ret) { // drill down 1st level // We need to determine in each iteration the largest, second // largest, smallest and second smallest item in terms of area. Item& largest = *largestPiece(it, not_packed); Item& second_largest = *secondLargestPiece(it, not_packed); double area_of_two_largest = largest.area() + second_largest.area(); // Check if there is enough free area for the item and the two // largest item if(free_area - area(it) - area_of_two_largest > waste) break; // Determine the area of the two smallest item. Item& smallest = *smallestPiece(it, not_packed); Item& second_smallest = *secondSmallestPiece(it, not_packed); // Check if there is enough free area for the item and the two // smallest item. double area_of_two_smallest = smallest.area() + second_smallest.area(); if(area(it) + area_of_two_smallest > free_area) { it++; continue; } auto pr = trypack(it); // Check for free area and try to pack the 1st item... if(!pr) { it++; continue; } it2 = not_packed.begin(); double rem2_area = free_area - largest.area(); double a2_sum = 0; while(it2 != endit && !ret && rem2_area - (a2_sum = area(it) + area(it2)) <= waste) { // Drill down level 2 if(a2_sum != area(it) + area(it2)) throw -1; if(it == it2 || check_pair(wrong_pairs, *it, *it2)) { it2++; continue; } if(a2_sum + smallest.area() > free_area) { it2++; continue; } bool can_pack2 = false; placer.accept(pr); auto pr2 = trypack(it2); auto pr12 = pr; if(!pr2) { placer.unpackLast(); // remove first if(try_reverse) { pr2 = trypack(it2); if(pr2) { placer.accept(pr2); pr12 = trypack(it); if(pr12) can_pack2 = true; placer.unpackLast(); } } } else { placer.unpackLast(); can_pack2 = true; } if(!can_pack2) { wrong_pairs.emplace_back(*it, *it2); it2++; continue; } // Now we have packed a group of 2 items. // The 'smallest' variable now could be identical with // it2 but we don't bother with that it3 = not_packed.begin(); double a3_sum = 0; while(it3 != endit && !ret && free_area - (a3_sum = a2_sum + area(it3)) <= waste) { // 3rd level if(it3 == it || it3 == it2 || check_triplet(wrong_triplets, *it, *it2, *it3)) { it3++; continue; } if(a3_sum > free_area) { it3++; continue; } placer.accept(pr12); placer.accept(pr2); bool can_pack3 = pack(it3); if(!can_pack3) { placer.unpackLast(); placer.unpackLast(); } if(!can_pack3 && try_reverse) { std::array indices = {0, 1, 2}; std::array candidates = {it, it2, it3}; auto tryPack = [&placer, &candidates, &pack]( const decltype(indices)& idx) { std::array packed = {false}; for(auto id : idx) packed.at(id) = pack(candidates[id]); bool check = std::all_of(packed.begin(), packed.end(), [](bool b) { return b; }); if(!check) for(bool b : packed) if(b) placer.unpackLast(); return check; }; while (!can_pack3 && std::next_permutation( indices.begin(), indices.end())){ can_pack3 = tryPack(indices); }; } if(can_pack3) { // finishit free_area -= a3_sum; filled_area = bin_area - free_area; ret = true; } else { wrong_triplets.emplace_back(*it, *it2, *it3); it3++; } } // 3rd while if(!ret) it2++; } // Second while if(!ret) it++; } // First while if(ret) { // If we eventually succeeded, remove all the packed ones. not_packed.erase(it); not_packed.erase(it2); not_packed.erase(it3); } return ret; }; this->template remove_unpackable_items(store_, bin, pconfig); int acounter = int(store_.size()); std::atomic_flag flg = ATOMIC_FLAG_INIT; SpinLock slock(flg); auto makeProgress = [this, &acounter, &slock] (Placer& placer, size_t idx, int packednum) { packed_bins_[idx] = placer.getItems(); // TODO here should be a spinlock slock.lock(); acounter -= packednum; this->progress_(acounter); slock.unlock(); }; double items_area = 0; for(Item& item : store_) items_area += item.area(); // Number of bins that will definitely be needed auto bincount_guess = unsigned(std::ceil(items_area / bin_area)); // Do parallel if feasible bool do_parallel = config_.allow_parallel && bincount_guess > 1 && ((glob_vertex_count > MAX_VERTICES_SEQUENTIALLY || store_.size() > MAX_ITEMS_SEQUENTIALLY) || config_.force_parallel); if(do_parallel) dout() << "Parallel execution..." << "\n"; bool do_pairs = config_.try_pairs; bool do_triplets = config_.try_triplets; StopCondition stopcond = this->stopcond_; // The DJD heuristic algorithm itself: auto packjob = [INITIAL_FILL_AREA, bin_area, w, do_triplets, do_pairs, stopcond, &tryOneByOne, &tryGroupsOfTwo, &tryGroupsOfThree, &makeProgress] (Placer& placer, ItemList& not_packed, size_t idx) { double filled_area = placer.filledArea(); double free_area = bin_area - filled_area; double waste = .0; bool lasttry = false; while(!not_packed.empty() && !stopcond()) { {// Fill the bin up to INITIAL_FILL_PROPORTION of its capacity auto it = not_packed.begin(); while(it != not_packed.end() && !stopcond() && filled_area < INITIAL_FILL_AREA) { if(placer.pack(*it, rem(it, not_packed))) { filled_area += it->get().area(); free_area = bin_area - filled_area; it = not_packed.erase(it); makeProgress(placer, idx, 1); } else it++; } } // try pieces one by one while(tryOneByOne(placer, not_packed, waste, free_area, filled_area)) { waste = 0; lasttry = false; makeProgress(placer, idx, 1); } // try groups of 2 pieces while(do_pairs && tryGroupsOfTwo(placer, not_packed, waste, free_area, filled_area)) { waste = 0; lasttry = false; makeProgress(placer, idx, 2); } // try groups of 3 pieces while(do_triplets && tryGroupsOfThree(placer, not_packed, waste, free_area, filled_area)) { waste = 0; lasttry = false; makeProgress(placer, idx, 3); } waste += w; if(!lasttry && waste > free_area) lasttry = true; else if(lasttry) break; } }; size_t idx = 0; ItemList remaining; if(do_parallel) { std::vector not_packeds(bincount_guess); // Preallocating the bins for(unsigned b = 0; b < bincount_guess; b++) { addBin(); ItemList& not_packed = not_packeds[b]; for(unsigned idx = b; idx < store_.size(); idx+=bincount_guess) { not_packed.emplace_back(store_[idx]); } } // The parallel job auto job = [&placers, ¬_packeds, &packjob](unsigned idx) { Placer& placer = placers[idx]; ItemList& not_packed = not_packeds[idx]; return packjob(placer, not_packed, idx); }; // We will create jobs for each bin std::vector> rets(bincount_guess); for(unsigned b = 0; b < bincount_guess; b++) { // launch the jobs rets[b] = std::async(std::launch::async, job, b); } for(unsigned fi = 0; fi < rets.size(); ++fi) { rets[fi].wait(); // Collect remaining items while waiting for the running jobs remaining.merge( not_packeds[fi], [](Item& i1, Item& i2) { return i1.area() > i2.area(); }); } idx = placers.size(); // Try to put the remaining items into one of the packed bins if(remaining.size() <= placers.size()) for(size_t j = 0; j < idx && !remaining.empty(); j++) { packjob(placers[j], remaining, j); } } else { remaining = ItemList(store_.begin(), store_.end()); } while(!remaining.empty()) { addBin(); packjob(placers[idx], remaining, idx); idx++; } int binid = 0; for(auto &bin : packed_bins_) { for(Item& itm : bin) itm.binId(binid); binid++; } } }; } } #endif // DJD_HEURISTIC_HPP libnest2d-5.0.0/include/libnest2d/selections/filler.hpp000066400000000000000000000045441422601530300230540ustar00rootroot00000000000000#ifndef FILLER_HPP #define FILLER_HPP #include "selection_boilerplate.hpp" namespace libnest2d { namespace selections { template class _FillerSelection: public SelectionBoilerplate { using Base = SelectionBoilerplate; public: using typename Base::Item; using Config = int; //dummy private: using Base::packed_bins_; using typename Base::ItemGroup; using Container = ItemGroup; Container store_; public: void configure(const Config& /*config*/) { } template::BinType, class PConfig = typename PlacementStrategyLike::Config> void packItems(TIterator first, TIterator last, TBin&& bin, PConfig&& pconfig = PConfig()) { using Placer = PlacementStrategyLike; store_.clear(); auto total = last-first; store_.reserve(total); // TODO: support preloading packed_bins_.clear(); packed_bins_.emplace_back(); auto makeProgress = [this, &total]( PlacementStrategyLike& placer) { packed_bins_.back() = placer.getItems(); #ifndef NDEBUG packed_bins_.back().insert(packed_bins_.back().end(), placer.getDebugItems().begin(), placer.getDebugItems().end()); #endif this->progress_(--total); }; std::copy(first, last, std::back_inserter(store_)); auto sortfunc = [](Item& i1, Item& i2) { return i1.area() > i2.area(); }; this->template remove_unpackable_items(store_, bin, pconfig); std::sort(store_.begin(), store_.end(), sortfunc); Placer placer(bin); placer.configure(pconfig); auto it = store_.begin(); while(it != store_.end() && !this->stopcond_()) { if(!placer.pack(*it, {std::next(it), store_.end()})) { if(packed_bins_.back().empty()) ++it; placer.clearItems(); packed_bins_.emplace_back(); } else { makeProgress(placer); ++it; } } } }; } } #endif //BOTTOMLEFT_HPP libnest2d-5.0.0/include/libnest2d/selections/firstfit.hpp000066400000000000000000000065241422601530300234310ustar00rootroot00000000000000#ifndef FIRSTFIT_HPP #define FIRSTFIT_HPP #include "selection_boilerplate.hpp" namespace libnest2d { namespace selections { template class _FirstFitSelection: public SelectionBoilerplate { using Base = SelectionBoilerplate; public: using typename Base::Item; using Config = int; //dummy private: using Base::packed_bins_; using typename Base::ItemGroup; using Container = ItemGroup;//typename std::vector<_Item>; Container store_; public: void configure(const Config& /*config*/) { } template::BinType, class PConfig = typename PlacementStrategyLike::Config> void packItems(TIterator first, TIterator last, TBin&& bin, PConfig&& pconfig = PConfig()) { using Placer = PlacementStrategyLike; store_.clear(); store_.reserve(last-first); std::vector placers; placers.reserve(last-first); std::for_each(first, last, [this](Item& itm) { if(itm.isFixed()) { if (itm.binId() < 0) itm.binId(0); auto binidx = size_t(itm.binId()); while(packed_bins_.size() <= binidx) packed_bins_.emplace_back(); packed_bins_[binidx].emplace_back(itm); } else { store_.emplace_back(itm); } }); // If the packed_items array is not empty we have to create as many // placers as there are elements in packed bins and preload each item // into the appropriate placer for(ItemGroup& ig : packed_bins_) { placers.emplace_back(bin); placers.back().configure(pconfig); placers.back().preload(ig); } auto sortfunc = [](Item& i1, Item& i2) { int p1 = i1.priority(), p2 = i2.priority(); return p1 == p2 ? i1.area() > i2.area() : p1 > p2; }; std::sort(store_.begin(), store_.end(), sortfunc); auto total = last-first; auto makeProgress = [this, &total](Placer& placer, size_t idx) { packed_bins_[idx] = placer.getItems(); this->progress_(static_cast(--total)); }; auto& cancelled = this->stopcond_; this->template remove_unpackable_items(store_, bin, pconfig); auto it = store_.begin(); while(it != store_.end() && !cancelled()) { bool was_packed = false; size_t j = 0; while(!was_packed && !cancelled()) { for(; j < placers.size() && !was_packed && !cancelled(); j++) { if((was_packed = placers[j].pack(*it, rem(it, store_) ))) { it->get().binId(int(j)); makeProgress(placers[j], j); } } if(!was_packed) { placers.emplace_back(bin); placers.back().configure(pconfig); packed_bins_.emplace_back(); j = placers.size() - 1; } } ++it; } } }; } } #endif // FIRSTFIT_HPP libnest2d-5.0.0/include/libnest2d/selections/selection_boilerplate.hpp000066400000000000000000000033131422601530300261370ustar00rootroot00000000000000#ifndef SELECTION_BOILERPLATE_HPP #define SELECTION_BOILERPLATE_HPP #include #include namespace libnest2d { namespace selections { template class SelectionBoilerplate { public: using ShapeType = RawShape; using Item = _Item; using ItemGroup = _ItemGroup; using PackGroup = _PackGroup; inline const PackGroup& getResult() const { return packed_bins_; } inline void progressIndicator(ProgressFunction fn) { progress_ = fn; } inline void stopCondition(StopCondition cond) { stopcond_ = cond; } inline void clear() { packed_bins_.clear(); } protected: template void remove_unpackable_items(Container &c, const Bin &bin, const PCfg& pcfg) { // Safety test: try to pack each item into an empty bin. If it fails // then it should be removed from the list auto it = c.begin(); while (it != c.end() && !stopcond_()) { // WARNING: The copy of itm needs to be created before Placer. // Placer is working with references and its destructor still // manipulates the item this is why the order of stack creation // matters here. const Item& itm = *it; Item cpy{itm}; Placer p{bin}; p.configure(pcfg); if (itm.area() <= 0 || !p.pack(cpy)) it = c.erase(it); else it++; } } PackGroup packed_bins_; ProgressFunction progress_ = [](unsigned){}; StopCondition stopcond_ = [](){ return false; }; }; } } #endif // SELECTION_BOILERPLATE_HPP libnest2d-5.0.0/include/libnest2d/utils/000077500000000000000000000000001422601530300200475ustar00rootroot00000000000000libnest2d-5.0.0/include/libnest2d/utils/bigint.hpp000066400000000000000000000064021422601530300220360ustar00rootroot00000000000000#ifndef LIBNEST2D_BIGINT_HPP #define LIBNEST2D_BIGINT_HPP #include #include #include #include namespace libnest2d { template using Bits = std::integral_constant; template class BigInt { static const int N = Bits::value / (8 * sizeof(I)) + Bits::value % (8 * sizeof(I)) / 8; static const int IBase = sizeof(I) * 8; std::array v_; int sign_ = 1; public: BigInt() = default; explicit constexpr inline BigInt(I v) : v_({v < 0 ? -v : v}), sign_(v < 0 ? -1 : 1) { static_assert(std::is_integral::value, "Only integral types are allowed for BigInt!"); } BigInt& operator+=(const BigInt& /*o*/) { return *this; } BigInt& operator*=(const BigInt& /*o*/) { return *this; } BigInt& operator-=(const BigInt& /*o*/) { return *this; } BigInt& operator/=(const BigInt& /*o*/) { return *this; } BigInt& operator+=(I /*o*/) { return *this; } BigInt& operator*=(I /*o*/) { return *this; } BigInt& operator-=(I /*o*/) { return *this; } BigInt& operator/=(I /*o*/) { return *this; } BigInt operator+(const BigInt& /*o*/) const { return *this; } BigInt operator*(const BigInt& /*o*/) const { return *this; } BigInt operator-(const BigInt& /*o*/) const { return *this; } BigInt operator/(const BigInt& /*o*/) const { return *this; } BigInt operator+(I /*o*/) const { return *this; } BigInt operator*(I /*o*/) const { return *this; } BigInt operator-(I /*o*/) const { return *this; } BigInt operator/(I /*o*/) const { return *this; } BigInt operator-() const { auto cpy = *this; sign_ > 0 ? cpy.sign_ = -1 : 1; return cpy; } bool operator< (I) const { return false; } bool operator> (I) const { return false; } bool operator<=(I) const { return false; } bool operator>=(I) const { return false; } bool operator==(I) const { return false; } bool operator!=(I) const { return false; } bool operator< (const BigInt& ) const { return false; } bool operator> (const BigInt& ) const { return false; } bool operator<=(const BigInt& ) const { return false; } bool operator>=(const BigInt& ) const { return false; } bool operator==(const BigInt& ) const { return false; } bool operator!=(const BigInt& ) const { return false; } long double to_floating() const { long double r = 0.0l; int n = 0; for(I a : v_) r += static_cast(a) * std::pow(2, IBase * n); return r; } }; template using BigInt128 = BigInt>; template using BigInt256 = BigInt>; template using BigInt512 = BigInt>; template struct _NumTag> { using Type = BigIntTag; }; template T cast(const Bi& r, BigIntTag, ScalarTag) { static_assert(std::is_floating_point::value, "BigInt should only be casted to floating point type"); return static_cast(r.to_floating()); } template inline Bi abs(const Bi& v, BigIntTag) { return v < Bi(0) ? -v : v; } } #endif // BIGINT_HPP libnest2d-5.0.0/include/libnest2d/utils/boost_alg.hpp000066400000000000000000000336631422601530300225440ustar00rootroot00000000000000#ifndef BOOST_ALG_HPP #define BOOST_ALG_HPP #ifndef DISABLE_BOOST_SERIALIZE #include #endif #ifdef __clang__ #undef _MSC_EXTENSIONS #endif #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable: 4244) #pragma warning(disable: 4267) #endif #include #ifdef _MSC_VER #pragma warning(pop) #endif // this should be removed to not confuse the compiler // #include namespace bp2d { using libnest2d::TCoord; using libnest2d::PointImpl; using Coord = TCoord; using libnest2d::PolygonImpl; using libnest2d::PathImpl; using libnest2d::Orientation; using libnest2d::OrientationType; using libnest2d::getX; using libnest2d::getY; using libnest2d::setX; using libnest2d::setY; using Box = libnest2d::_Box; using Segment = libnest2d::_Segment; using Shapes = libnest2d::nfp::Shapes; } /** * We have to make all the libnest2d geometry types available to boost. The real * models of the geometries remain the same if a conforming model for libnest2d * was defined by the library client. Boost is used only as an optional * implementer of some algorithms that can be implemented by the model itself * if a faster alternative exists. * * However, boost has its own type traits and we have to define the needed * specializations to be able to use boost::geometry. This can be done with the * already provided model. */ namespace boost { namespace geometry { namespace traits { /* ************************************************************************** */ /* Point concept adaptaion ************************************************** */ /* ************************************************************************** */ template<> struct tag { using type = point_tag; }; template<> struct coordinate_type { using type = bp2d::Coord; }; template<> struct coordinate_system { using type = cs::cartesian; }; template<> struct dimension: boost::mpl::int_<2> {}; template<> struct access { static inline bp2d::Coord get(bp2d::PointImpl const& a) { return libnest2d::getX(a); } static inline void set(bp2d::PointImpl& a, bp2d::Coord const& value) { libnest2d::setX(a, value); } }; template<> struct access { static inline bp2d::Coord get(bp2d::PointImpl const& a) { return libnest2d::getY(a); } static inline void set(bp2d::PointImpl& a, bp2d::Coord const& value) { libnest2d::setY(a, value); } }; /* ************************************************************************** */ /* Box concept adaptaion **************************************************** */ /* ************************************************************************** */ template<> struct tag { using type = box_tag; }; template<> struct point_type { using type = bp2d::PointImpl; }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Box const& box) { return bp2d::getX(box.minCorner()); } static inline void set(bp2d::Box &box, bp2d::Coord const& coord) { bp2d::setX(box.minCorner(), coord); } }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Box const& box) { return bp2d::getY(box.minCorner()); } static inline void set(bp2d::Box &box, bp2d::Coord const& coord) { bp2d::setY(box.minCorner(), coord); } }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Box const& box) { return bp2d::getX(box.maxCorner()); } static inline void set(bp2d::Box &box, bp2d::Coord const& coord) { bp2d::setX(box.maxCorner(), coord); } }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Box const& box) { return bp2d::getY(box.maxCorner()); } static inline void set(bp2d::Box &box, bp2d::Coord const& coord) { bp2d::setY(box.maxCorner(), coord); } }; /* ************************************************************************** */ /* Segment concept adaptaion ************************************************ */ /* ************************************************************************** */ template<> struct tag { using type = segment_tag; }; template<> struct point_type { using type = bp2d::PointImpl; }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Segment const& seg) { return bp2d::getX(seg.first()); } static inline void set(bp2d::Segment &seg, bp2d::Coord const& coord) { auto p = seg.first(); bp2d::setX(p, coord); seg.first(p); } }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Segment const& seg) { return bp2d::getY(seg.first()); } static inline void set(bp2d::Segment &seg, bp2d::Coord const& coord) { auto p = seg.first(); bp2d::setY(p, coord); seg.first(p); } }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Segment const& seg) { return bp2d::getX(seg.second()); } static inline void set(bp2d::Segment &seg, bp2d::Coord const& coord) { auto p = seg.second(); bp2d::setX(p, coord); seg.second(p); } }; template<> struct indexed_access { static inline bp2d::Coord get(bp2d::Segment const& seg) { return bp2d::getY(seg.second()); } static inline void set(bp2d::Segment &seg, bp2d::Coord const& coord) { auto p = seg.second(); bp2d::setY(p, coord); seg.second(p); } }; /* ************************************************************************** */ /* Polygon concept adaptation *********************************************** */ /* ************************************************************************** */ // Connversion between libnest2d::Orientation and order_selector /////////////// template struct ToBoostOrienation {}; template<> struct ToBoostOrienation { static const order_selector Value = clockwise; }; template<> struct ToBoostOrienation { static const order_selector Value = counterclockwise; }; static const bp2d::Orientation RealOrientation = bp2d::OrientationType::Value; // Ring implementation ///////////////////////////////////////////////////////// // Boost would refer to ClipperLib::Path (alias bp2d::PolygonImpl) as a ring template<> struct tag { using type = ring_tag; }; template<> struct point_order { static const order_selector value = ToBoostOrienation::Value; }; // All our Paths should be closed for the bin packing application template<> struct closure { static const closure_selector value = closed; }; // Polygon implementation ////////////////////////////////////////////////////// template<> struct tag { using type = polygon_tag; }; template<> struct exterior_ring { static inline bp2d::PathImpl& get(bp2d::PolygonImpl& p) { return libnest2d::shapelike::contour(p); } static inline bp2d::PathImpl const& get(bp2d::PolygonImpl const& p) { return libnest2d::shapelike::contour(p); } }; template<> struct ring_const_type { using type = const bp2d::PathImpl&; }; template<> struct ring_mutable_type { using type = bp2d::PathImpl&; }; template<> struct interior_const_type { using type = const libnest2d::THolesContainer&; }; template<> struct interior_mutable_type { using type = libnest2d::THolesContainer&; }; template<> struct interior_rings { static inline libnest2d::THolesContainer& get( bp2d::PolygonImpl& p) { return libnest2d::shapelike::holes(p); } static inline const libnest2d::THolesContainer& get( bp2d::PolygonImpl const& p) { return libnest2d::shapelike::holes(p); } }; /* ************************************************************************** */ /* MultiPolygon concept adaptation ****************************************** */ /* ************************************************************************** */ template<> struct tag { using type = multi_polygon_tag; }; } // traits } // geometry // This is an addition to the ring implementation of Polygon concept template<> struct range_value { using type = bp2d::PointImpl; }; template<> struct range_value { using type = bp2d::PolygonImpl; }; } // boost /* ************************************************************************** */ /* Algorithms *************************************************************** */ /* ************************************************************************** */ namespace libnest2d { // Now the algorithms that boost can provide... //namespace pointlike { //template<> //inline double distance(const PointImpl& p1, const PointImpl& p2 ) //{ // return boost::geometry::distance(p1, p2); //} //template<> //inline double distance(const PointImpl& p, const bp2d::Segment& seg ) //{ // return boost::geometry::distance(p, seg); //} //} namespace shapelike { // Tell libnest2d how to make string out of a ClipperPolygon object template<> inline bool intersects(const PathImpl& sh1, const PathImpl& sh2) { return boost::geometry::intersects(sh1, sh2); } // Tell libnest2d how to make string out of a ClipperPolygon object template<> inline bool intersects(const PolygonImpl& sh1, const PolygonImpl& sh2) { return boost::geometry::intersects(sh1, sh2); } // Tell libnest2d how to make string out of a ClipperPolygon object template<> inline bool intersects(const bp2d::Segment& s1, const bp2d::Segment& s2) { return boost::geometry::intersects(s1, s2); } #ifndef DISABLE_BOOST_AREA template<> inline double area(const PolygonImpl& shape, const PolygonTag&) { return boost::geometry::area(shape); } #endif template<> inline bool isInside(const PointImpl& point, const PolygonImpl& shape, const PointTag&, const PolygonTag&) { return boost::geometry::within(point, shape); } template<> inline bool isInside(const PolygonImpl& sh1, const PolygonImpl& sh2, const PolygonTag&, const PolygonTag&) { return boost::geometry::within(sh1, sh2); } template<> inline bool touches(const PolygonImpl& sh1, const PolygonImpl& sh2) { return boost::geometry::touches(sh1, sh2); } template<> inline bool touches( const PointImpl& point, const PolygonImpl& shape) { return boost::geometry::touches(point, shape); } #ifndef DISABLE_BOOST_BOUNDING_BOX template<> inline bp2d::Box boundingBox(const PathImpl& sh, const PathTag&) { bp2d::Box b; boost::geometry::envelope(sh, b); return b; } template<> inline bp2d::Box boundingBox(const bp2d::Shapes& shapes, const MultiPolygonTag&) { bp2d::Box b; boost::geometry::envelope(shapes, b); return b; } #endif #ifndef DISABLE_BOOST_CONVEX_HULL template<> inline PathImpl convexHull(const PathImpl& sh, const PathTag&) { PathImpl ret; boost::geometry::convex_hull(sh, ret); return ret; } template<> inline PolygonImpl convexHull(const TMultiShape& shapes, const MultiPolygonTag&) { PolygonImpl ret; boost::geometry::convex_hull(shapes, ret); return ret; } #endif #ifndef DISABLE_BOOST_OFFSET template<> inline void offset(PolygonImpl& sh, bp2d::Coord distance) { PolygonImpl cpy = sh; boost::geometry::buffer(cpy, sh, distance); } #endif #ifndef DISABLE_BOOST_SERIALIZE template<> inline std::string serialize( const PolygonImpl& sh, double scale) { std::stringstream ss; std::string style = "fill: none; stroke: black; stroke-width: 1px;"; using namespace boost::geometry; using Pointf = model::point; using Polygonf = model::polygon; Polygonf::ring_type ring; Polygonf::inner_container_type holes; ring.reserve(shapelike::contourVertexCount(sh)); for(auto it = shapelike::cbegin(sh); it != shapelike::cend(sh); it++) { auto& v = *it; ring.emplace_back(getX(v)*scale, getY(v)*scale); }; auto H = shapelike::holes(sh); for(PathImpl& h : H ) { Polygonf::ring_type hf; for(auto it = h.begin(); it != h.end(); it++) { auto& v = *it; hf.emplace_back(getX(v)*scale, getY(v)*scale); }; holes.emplace_back(std::move(hf)); } Polygonf poly; poly.outer() = ring; poly.inners() = holes; auto svg_data = boost::geometry::svg(poly, style); ss << svg_data << std::endl; return ss.str(); } #endif #ifndef DISABLE_BOOST_UNSERIALIZE template<> inline void unserialize( PolygonImpl& sh, const std::string& str) { } #endif template<> inline std::pair isValid(const PolygonImpl& sh) { std::string message; bool ret = boost::geometry::is_valid(sh, message); return {ret, message}; } } namespace nfp { #ifndef DISABLE_BOOST_NFP_MERGE // Warning: I could not get boost union_ to work. Geometries will overlap. template<> inline bp2d::Shapes nfp::merge(const bp2d::Shapes& shapes, const PolygonImpl& sh) { bp2d::Shapes retv; boost::geometry::union_(shapes, sh, retv); return retv; } template<> inline bp2d::Shapes nfp::merge(const bp2d::Shapes& shapes) { bp2d::Shapes retv; boost::geometry::union_(shapes, shapes.back(), retv); return retv; } #endif } } #endif // BOOST_ALG_HPP libnest2d-5.0.0/include/libnest2d/utils/metaloop.hpp000066400000000000000000000164161422601530300224100ustar00rootroot00000000000000#ifndef METALOOP_HPP #define METALOOP_HPP #include #include #include namespace libnest2d { /* ************************************************************************** */ /* C++14 std::index_sequence implementation: */ /* ************************************************************************** */ /** * \brief C++11 compatible implementation of the index_sequence type from C++14 */ template struct index_sequence { using value_type = size_t; BP2D_CONSTEXPR value_type size() const { return sizeof...(Ints); } }; // A Help structure to generate the integer list template struct genSeq; // Recursive template to generate the list template struct genSeq { // Type will contain a genSeq with Nseq appended by one element using Type = typename genSeq< I - 1, I - 1, Nseq...>::Type; }; // Terminating recursion template struct genSeq<0, Nseq...> { // If I is zero, Type will contain index_sequence with the fuly generated // integer list. using Type = index_sequence; }; /// Helper alias to make an index sequence from 0 to N template using make_index_sequence = typename genSeq::Type; /// Helper alias to make an index sequence for a parameter pack template using index_sequence_for = make_index_sequence; /* ************************************************************************** */ namespace opt { using std::forward; using std::tuple; using std::get; using std::tuple_element; /** * @brief Helper class to be able to loop over a parameter pack's elements. */ class metaloop { // The implementation is based on partial struct template specializations. // Basically we need a template type that is callable and takes an integer // non-type template parameter which can be used to implement recursive calls. // // C++11 will not allow the usage of a plain template function that is why we // use struct with overloaded call operator. At the same time C++11 prohibits // partial template specialization with a non type parameter such as int. We // need to wrap that in a type (see metaloop::Int). /* * A helper alias to create integer values wrapped as a type. It is necessary * because a non type template parameter (such as int) would be prohibited in * a partial specialization. Also for the same reason we have to use a class * _Metaloop instead of a simple function as a functor. A function cannot be * partially specialized in a way that is necessary for this trick. */ template using Int = std::integral_constant; /* * Helper class to implement in-place functors. * * We want to be able to use inline functors like a lambda to keep the code * as clear as possible. */ template class MapFn { Fn&& fn_; public: // It takes the real functor that can be specified in-place but only // with C++14 because the second parameter's type will depend on the // type of the parameter pack element that is processed. In C++14 we can // specify this second parameter type as auto in the lambda parameter list. inline MapFn(Fn&& fn): fn_(forward(fn)) {} template void operator ()(T&& pack_element) { // We provide the index as the first parameter and the pack (or tuple) // element as the second parameter to the functor. fn_(N, forward(pack_element)); } }; /* * Implementation of the template loop trick. * We create a mechanism for looping over a parameter pack in compile time. * \tparam Idx is the loop index which will be decremented at each recursion. * \tparam Args The parameter pack that will be processed. * */ template class _MetaLoop {}; // Implementation for the first element of Args... template class _MetaLoop, Args...> { public: const static BP2D_CONSTEXPR int N = 0; const static BP2D_CONSTEXPR int ARGNUM = sizeof...(Args)-1; template void run( Tup&& valtup, Fn&& fn) { MapFn {forward(fn)} (get(valtup)); } }; // Implementation for the N-th element of Args... template class _MetaLoop, Args...> { public: const static BP2D_CONSTEXPR int ARGNUM = sizeof...(Args)-1; template void run(Tup&& valtup, Fn&& fn) { MapFn {forward(fn)} (std::get(valtup)); // Recursive call to process the next element of Args _MetaLoop, Args...> ().run(forward(valtup), forward(fn)); } }; /* * Instantiation: We must instantiate the template with the last index because * the generalized version calls the decremented instantiations recursively. * Once the instantiation with the first index is called, the terminating * version of run is called which does not call itself anymore. * * If you are utterly annoyed, at least you have learned a super crazy * functional meta-programming pattern. */ template using MetaLoop = _MetaLoop, Args...>; public: /** * \brief The final usable function template. * * This is similar to what varags was on C but in compile time C++11. * You can call: * apply(, ); * For example: * * struct mapfunc { * template void operator()(int N, T&& element) { * std::cout << "The value of the parameter "<< N <<": " * << element << std::endl; * } * }; * * apply(mapfunc(), 'a', 10, 151.545); * * C++14: * apply([](int N, auto&& element){ * std::cout << "The value of the parameter "<< N <<": " * << element << std::endl; * }, 'a', 10, 151.545); * * This yields the output: * The value of the parameter 0: a * The value of the parameter 1: 10 * The value of the parameter 2: 151.545 * * As an addition, the function can be called with a tuple as the second * parameter holding the arguments instead of a parameter pack. * */ template inline static void apply(Fn&& fn, Args&&...args) { MetaLoop().run(tuple(forward(args)...), forward(fn)); } /// The version of apply with a tuple rvalue reference. template inline static void apply(Fn&& fn, tuple&& tup) { MetaLoop().run(std::move(tup), forward(fn)); } /// The version of apply with a tuple lvalue reference. template inline static void apply(Fn&& fn, tuple& tup) { MetaLoop().run(tup, forward(fn)); } /// The version of apply with a tuple const reference. template inline static void apply(Fn&& fn, const tuple& tup) { MetaLoop().run(tup, forward(fn)); } /** * Call a function with its arguments encapsualted in a tuple. */ template inline static auto callFunWithTuple(Fn&& fn, Tup&& tup, index_sequence) -> decltype(fn(std::get(tup)...)) { return fn(std::get(tup)...); } }; } } #endif // METALOOP_HPP libnest2d-5.0.0/include/libnest2d/utils/rational.hpp000066400000000000000000000102751422601530300223760ustar00rootroot00000000000000#ifndef LIBNEST2D_RATIONAL_HPP #define LIBNEST2D_RATIONAL_HPP #include namespace libnest2d { template struct NoGCD { T operator()(const T&, const T&) { return T(1); } }; // A very simple representation of an unnormalized rational number. // The sign of the denominator is still normalized to be always positive. template , class TD = T> class Rational { T num; T den; inline void normsign() { if(den < 0) { den = -den; num = -num; } } inline void normalize() { T n = GCD()(num, den); num /= n; den /= n; } public: using BaseType = T; using DoubleType = TD; inline Rational(): num(T(0)), den(T(1)) {} inline explicit Rational(const T& n, const T& d = T(1)): num(n), den(d) { normsign(); normalize(); } inline bool operator>(const Rational& o) const { return TD(o.den) * num > TD(den) * o.num; } inline bool operator<(const Rational& o) const { return TD(o.den) * num < TD(den) * o.num; } inline bool operator==(const Rational& o) const { return TD(o.den) * num == TD(den) * o.num; } inline bool operator!=(const Rational& o) const { return !(*this == o); } inline bool operator<=(const Rational& o) const { return TD(o.den) * num <= TD(den) * o.num; } inline bool operator>=(const Rational& o) const { return TD(o.den) * num >= TD(den) * o.num; } inline bool operator< (const T& v) const { return TD(num) < TD(v) * den; } inline bool operator> (const T& v) const { return TD(num) > TD(v) * den; } inline bool operator<=(const T& v) const { return TD(num) <= TD(v) * den; } inline bool operator>=(const T& v) const { return TD(num) >= TD(v) * den; } inline Rational& operator*=(const Rational& o) { num *= o.num; den *= o.den; normalize(); return *this; } inline Rational& operator/=(const Rational& o) { num *= o.den; den *= o.num; normsign(); normalize(); return *this; } inline Rational& operator+=(const Rational& o) { den *= o.den; num = o.den * num + o.num * den; normalize(); return *this; } inline Rational& operator-=(const Rational& o) { den *= o.den; num = o.den * num - o.num * den; normalize(); return *this; } inline Rational& operator*=(const T& v) { const T gcd = GCD()(v, den); num *= v / gcd; den /= gcd; return *this; } inline Rational& operator/=(const T& v) { if(num == T{}) return *this; // Avoid overflow and preserve normalization const T gcd = GCD()(num, v); num /= gcd; den *= v / gcd; if(den < T{}) { num = -num; den = -den; } den *= v; return *this; } inline Rational& operator+=(const T& v) { num += v * den; return *this; } inline Rational& operator-=(const T& v) { num -= v * den; return *this; } inline Rational operator*(const T& v) const { auto tmp = *this; tmp *= v; return tmp; } inline Rational operator/(const T& v) const { auto tmp = *this; tmp /= v; return tmp; } inline Rational operator+(const T& v) const { auto tmp = *this; tmp += v; return tmp; } inline Rational operator-(const T& v) const { auto tmp = *this; tmp -= v; return tmp; } inline Rational operator-() const { auto tmp = *this; tmp.num = -num; return tmp; } inline T numerator() const { return num; } inline T denominator() const { return den; } }; template inline T cast(const R& r, RationalTag, ScalarTag) { return cast(r.numerator()) / cast(r.denominator()); } template inline Rational cast(const R& r, RationalTag, RationalTag) { return Rational(static_cast(r.numerator()), static_cast(r.denominator())); } template struct _NumTag> { using Type = RationalTag; }; template inline R abs(const R& r, RationalTag) { return R(abs(r.numerator()), abs(r.denumerator())); } } #endif // LIBNEST2D_RATIONAL_HPP libnest2d-5.0.0/include/libnest2d/utils/rotcalipers.hpp000066400000000000000000000214671422601530300231210ustar00rootroot00000000000000#ifndef ROTCALIPERS_HPP #define ROTCALIPERS_HPP #include #include #include #include #include namespace libnest2d { template> class RotatedBox { Pt axis_; Unit bottom_ = Unit(0), right_ = Unit(0); public: RotatedBox() = default; RotatedBox(const Pt& axis, Unit b, Unit r): axis_(axis), bottom_(b), right_(r) {} inline long double area() const { long double asq = pl::magnsq(axis_); return cast(bottom_) * cast(right_) / asq; } inline long double width() const { return abs(bottom_) / std::sqrt(pl::magnsq(axis_)); } inline long double height() const { return abs(right_) / std::sqrt(pl::magnsq(axis_)); } inline Unit bottom_extent() const { return bottom_; } inline Unit right_extent() const { return right_; } inline const Pt& axis() const { return axis_; } inline Radians angleToX() const { double ret = std::atan2(getY(axis_), getX(axis_)); auto s = std::signbit(ret); if(s) ret += Pi_2; return -ret; } }; template , class Unit = TCompute> Poly removeCollinearPoints(const Poly& sh, Unit eps = Unit(0)) { Poly ret; sl::reserve(ret, sl::contourVertexCount(sh)); Pt eprev = *sl::cbegin(sh) - *std::prev(sl::cend(sh)); auto it = sl::cbegin(sh); auto itx = std::next(it); if(itx != sl::cend(sh)) while (it != sl::cend(sh)) { Pt enext = *itx - *it; auto dp = pl::dotperp(eprev, enext); if(abs(dp) > eps) sl::addVertex(ret, *it); eprev = enext; if (++itx == sl::cend(sh)) itx = sl::cbegin(sh); ++it; } return ret; } // The area of the bounding rectangle with the axis dir and support vertices template, class R = TCompute> inline R rectarea(const Pt& w, // the axis const Pt& vb, const Pt& vr, const Pt& vt, const Pt& vl) { Unit a = pl::dot(w, vr - vl); Unit b = pl::dot(-pl::perp(w), vt - vb); R m = R(a) / pl::magnsq(w); m = m * b; return m; }; template, class R = TCompute, class It = typename std::vector::const_iterator> inline R rectarea(const Pt& w, const std::array& rect) { return rectarea(w, *rect[0], *rect[1], *rect[2], *rect[3]); } // This function is only applicable to counter-clockwise oriented convex // polygons where only two points can be collinear witch each other. template , class Ratio = TCompute> RotatedBox, Unit> minAreaBoundingBox(const RawShape& sh) { using Point = TPoint; using Iterator = typename TContour::const_iterator; using pointlike::dot; using pointlike::magnsq; using pointlike::perp; // Get the first and the last vertex iterator auto first = sl::cbegin(sh); auto last = std::prev(sl::cend(sh)); // Check conditions and return undefined box if input is not sane. if(last == first) return {}; if(getX(*first) == getX(*last) && getY(*first) == getY(*last)) --last; if(last - first < 2) return {}; RawShape shcpy; // empty at this point { Point p = *first, q = *std::next(first), r = *last; // Determine orientation from first 3 vertex (should be consistent) Unit d = (Unit(getY(q)) - getY(p)) * (Unit(getX(r)) - getX(p)) - (Unit(getX(q)) - getX(p)) * (Unit(getY(r)) - getY(p)); if(d > 0) { // The polygon is clockwise. A flip is needed (for now) sl::reserve(shcpy, last - first); auto it = last; while(it != first) sl::addVertex(shcpy, *it--); sl::addVertex(shcpy, *first); first = sl::cbegin(shcpy); last = std::prev(sl::cend(shcpy)); } } // Cyclic iterator increment auto inc = [&first, &last](Iterator& it) { if(it == last) it = first; else ++it; }; // Cyclic previous iterator auto prev = [&first, &last](Iterator it) { return it == first ? last : std::prev(it); }; // Cyclic next iterator auto next = [&first, &last](Iterator it) { return it == last ? first : std::next(it); }; // Establish initial (axis aligned) rectangle support verices by determining // polygon extremes: auto it = first; Iterator minX = it, maxX = it, minY = it, maxY = it; do { // Linear walk through the vertices and save the extreme positions Point v = *it, d = v - *minX; if(getX(d) < 0 || (getX(d) == 0 && getY(d) < 0)) minX = it; d = v - *maxX; if(getX(d) > 0 || (getX(d) == 0 && getY(d) > 0)) maxX = it; d = v - *minY; if(getY(d) < 0 || (getY(d) == 0 && getX(d) > 0)) minY = it; d = v - *maxY; if(getY(d) > 0 || (getY(d) == 0 && getX(d) < 0)) maxY = it; } while(++it != std::next(last)); // Update the vertices defining the bounding rectangle. The rectangle with // the smallest rotation is selected and the supporting vertices are // returned in the 'rect' argument. auto update = [&next, &inc] (const Point& w, std::array& rect) { Iterator B = rect[0], Bn = next(B); Iterator R = rect[1], Rn = next(R); Iterator T = rect[2], Tn = next(T); Iterator L = rect[3], Ln = next(L); Point b = *Bn - *B, r = *Rn - *R, t = *Tn - *T, l = *Ln - *L; Point pw = perp(w); using Pt = Point; Unit dotwpb = dot( w, b), dotwpr = dot(-pw, r); Unit dotwpt = dot(-w, t), dotwpl = dot( pw, l); Unit dw = magnsq(w); std::array angles; angles[0] = (Ratio(dotwpb) / magnsq(b)) * dotwpb; angles[1] = (Ratio(dotwpr) / magnsq(r)) * dotwpr; angles[2] = (Ratio(dotwpt) / magnsq(t)) * dotwpt; angles[3] = (Ratio(dotwpl) / magnsq(l)) * dotwpl; using AngleIndex = std::pair; std::vector A; A.reserve(4); for (size_t i = 3, j = 0; j < 4; i = j++) { if(rect[i] != rect[j] && angles[i] < dw) { auto iv = std::make_pair(angles[i], i); auto it = std::lower_bound(A.begin(), A.end(), iv, [](const AngleIndex& ai, const AngleIndex& aj) { return ai.first > aj.first; }); A.insert(it, iv); } } // The polygon is supposed to be a rectangle. if(A.empty()) return false; auto amin = A.front().first; auto imin = A.front().second; for(auto& a : A) if(a.first == amin) inc(rect[a.second]); std::rotate(rect.begin(), rect.begin() + imin, rect.end()); return true; }; Point w(1, 0); Point w_min = w; Ratio minarea((Unit(getX(*maxX)) - getX(*minX)) * (Unit(getY(*maxY)) - getY(*minY))); std::array rect = {minY, maxX, maxY, minX}; std::array minrect = rect; // An edge might be examined twice in which case the algorithm terminates. size_t c = 0, count = last - first + 1; std::vector edgemask(count, false); while(c++ < count) { // Update the support vertices, if cannot be updated, break the cycle. if(! update(w, rect)) break; size_t eidx = size_t(rect[0] - first); if(edgemask[eidx]) break; edgemask[eidx] = true; // get the unnormalized direction vector w = *rect[0] - *prev(rect[0]); // get the area of the rotated rectangle Ratio rarea = rectarea(w, rect); // Update min area and the direction of the min bounding box; if(rarea <= minarea) { w_min = w; minarea = rarea; minrect = rect; } } Unit a = dot(w_min, *minrect[1] - *minrect[3]); Unit b = dot(-perp(w_min), *minrect[2] - *minrect[0]); RotatedBox bb(w_min, a, b); return bb; } template Radians minAreaBoundingBoxRotation(const RawShape& sh) { return minAreaBoundingBox(sh).angleToX(); } } #endif // ROTCALIPERS_HPP libnest2d-5.0.0/include/libnest2d/utils/rotfinder.hpp000066400000000000000000000021061422601530300225530ustar00rootroot00000000000000#ifndef ROTFINDER_HPP #define ROTFINDER_HPP #include #include #include namespace libnest2d { template Radians findBestRotation(_Item& item) { opt::StopCriteria stopcr; stopcr.absolute_score_difference = 0.01; stopcr.max_iterations = 10000; opt::TOptimizer solver(stopcr); auto orig_rot = item.rotation(); auto result = solver.optimize_min([&item, &orig_rot](Radians rot){ item.rotation(orig_rot + rot); auto bb = item.boundingBox(); return std::sqrt(bb.height()*bb.width()); }, opt::initvals(Radians(0)), opt::bound(-Pi/2, Pi/2)); item.rotation(orig_rot); return std::get<0>(result.optimum); } template void findMinimumBoundingBoxRotations(Iterator from, Iterator to) { using V = typename std::iterator_traits::value_type; std::for_each(from, to, [](V& item){ Radians rot = findBestRotation(item); item.rotate(rot); }); } } #endif // ROTFINDER_HPP libnest2d-5.0.0/src/000077500000000000000000000000001422601530300141655ustar00rootroot00000000000000libnest2d-5.0.0/src/libnest2d.cpp000066400000000000000000000021251422601530300165570ustar00rootroot00000000000000#include namespace libnest2d { template class _Nester; template class _Nester; template std::size_t _Nester::execute( std::vector::iterator, std::vector::iterator); template std::size_t _Nester::execute( std::vector::iterator, std::vector::iterator); template std::size_t nest(std::vector::iterator from, std::vector::iterator to, const Box & bin, Coord dist, const NestConfig &cfg, NestControl ctl); template std::size_t nest(std::vector::iterator from, std::vector::iterator to, const Box & bin, Coord dist, const NestConfig &cfg, NestControl ctl); } libnest2d-5.0.0/tests/000077500000000000000000000000001422601530300145405ustar00rootroot00000000000000libnest2d-5.0.0/tests/CMakeLists.txt000066400000000000000000000007051422601530300173020ustar00rootroot00000000000000find_package(catch2 2.9.1 REQUIRED) add_executable(tests_clipper_nlopt test.cpp ../tools/svgtools.hpp # ../tools/libnfpglue.hpp # ../tools/libnfpglue.cpp ../tools/printer_parts.hpp ../tools/printer_parts.cpp ) if (MSVC) # with catch, it is to much target_compile_options(tests_clipper_nlopt PRIVATE /bigobj) endif () target_link_libraries(tests_clipper_nlopt libnest2d Catch2::Catch2) add_test(libnest2d_tests tests_clipper_nlopt) libnest2d-5.0.0/tests/test.cpp000066400000000000000000000700521422601530300162270ustar00rootroot00000000000000#define CATCH_CONFIG_MAIN #include #include #include #include "../tools/printer_parts.hpp" //#include #include "../tools/svgtools.hpp" #include #if defined(_MSC_VER) && defined(__clang__) #define BOOST_NO_CXX17_HDR_STRING_VIEW #endif #include "boost/multiprecision/integer.hpp" #include "boost/rational.hpp" //#include "../tools/libnfpglue.hpp" //#include "../tools/nfp_svgnest_glue.hpp" namespace libnest2d { #if !defined(_MSC_VER) && defined(__SIZEOF_INT128__) && !defined(__APPLE__) using LargeInt = __int128; #else using LargeInt = boost::multiprecision::int128_t; template<> struct _NumTag { using Type = ScalarTag; }; #endif template struct _NumTag> { using Type = RationalTag; }; using RectangleItem = libnest2d::Rectangle; namespace nfp { template struct NfpImpl { NfpResult operator()(const S &sh, const S &other) { return nfpConvexOnly>(sh, other); } }; } } static std::vector& prusaParts() { static std::vector ret; if(ret.empty()) { ret.reserve(PRINTER_PART_POLYGONS.size()); for(auto& inp : PRINTER_PART_POLYGONS) ret.emplace_back(inp); } return ret; } TEST_CASE("Angles", "[Geometry]") { using namespace libnest2d; Degrees deg(180); Radians rad(deg); Degrees deg2(rad); REQUIRE(Approx(rad) == Pi); REQUIRE(Approx(deg) == 180); REQUIRE(Approx(deg2) == 180); REQUIRE(Approx(rad) == Radians(deg)); REQUIRE(Approx(Degrees(rad)) == deg); REQUIRE(rad == deg); Segment seg = {{0, 0}, {12, -10}}; REQUIRE(Degrees(seg.angleToXaxis()) > 270); REQUIRE(Degrees(seg.angleToXaxis()) < 360); seg = {{0, 0}, {12, 10}}; REQUIRE(Degrees(seg.angleToXaxis()) > 0); REQUIRE(Degrees(seg.angleToXaxis()) < 90); seg = {{0, 0}, {-12, 10}}; REQUIRE(Degrees(seg.angleToXaxis()) > 90); REQUIRE(Degrees(seg.angleToXaxis()) < 180); seg = {{0, 0}, {-12, -10}}; REQUIRE(Degrees(seg.angleToXaxis()) > 180); REQUIRE(Degrees(seg.angleToXaxis()) < 270); seg = {{0, 0}, {1, 0}}; REQUIRE(Degrees(seg.angleToXaxis()) == Approx(0.)); seg = {{0, 0}, {0, 1}}; REQUIRE(Degrees(seg.angleToXaxis()) == Approx(90.)); seg = {{0, 0}, {-1, 0}}; REQUIRE(Degrees(seg.angleToXaxis()) == Approx(180.)); seg = {{0, 0}, {0, -1}}; REQUIRE(Degrees(seg.angleToXaxis()) == Approx(270.)); } // Simple TEST_CASE, does not use gmock TEST_CASE("ItemCreationAndDestruction", "[Nesting]") { using namespace libnest2d; Item sh = { {0, 0}, {1, 0}, {1, 1}, {0, 1} }; REQUIRE(sh.vertexCount() == 4u); Item sh2 ({ {0, 0}, {1, 0}, {1, 1}, {0, 1} }); REQUIRE(sh2.vertexCount() == 4u); // copy Item sh3 = sh2; REQUIRE(sh3.vertexCount() == 4u); sh2 = {}; REQUIRE(sh2.vertexCount() == 0u); REQUIRE(sh3.vertexCount() == 4u); } TEST_CASE("boundingCircle", "[Geometry]") { using namespace libnest2d; using placers::boundingCircle; PolygonImpl p = {{{0, 10}, {10, 0}, {0, -10}, {0, 10}}, {}}; Circle c = boundingCircle(p); REQUIRE(c.center().X == 0); REQUIRE(c.center().Y == 0); REQUIRE(c.radius() == Approx(10)); shapelike::translate(p, PointImpl{10, 10}); c = boundingCircle(p); REQUIRE(c.center().X == 10); REQUIRE(c.center().Y == 10); REQUIRE(c.radius() == Approx(10)); auto parts = prusaParts(); int i = 0; for(auto& part : parts) { c = boundingCircle(part.transformedShape()); if(std::isnan(c.radius())) std::cout << "fail: radius is nan" << std::endl; else for(auto v : shapelike::contour(part.transformedShape()) ) { auto d = pointlike::distance(v, c.center()); if(d > c.radius() ) { auto e = std::abs( 1.0 - d/c.radius()); REQUIRE(e <= 1e-3); } } i++; } } TEST_CASE("Distance", "[Geometry]") { using namespace libnest2d; Point p1 = {0, 0}; Point p2 = {10, 0}; Point p3 = {10, 10}; REQUIRE(pointlike::distance(p1, p2) == Approx(10)); REQUIRE(pointlike::distance(p1, p3) == Approx(sqrt(200))); Segment seg(p1, p3); // REQUIRE(pointlike::distance(p2, seg) == Approx(7.0710678118654755)); auto result = pointlike::horizontalDistance(p2, seg); auto check = [](TCompute val, TCompute expected) { if(std::is_floating_point>::value) REQUIRE(static_cast(val) == Approx(static_cast(expected))); else REQUIRE(val == expected); }; REQUIRE(result.second); check(result.first, 10); result = pointlike::verticalDistance(p2, seg); REQUIRE(result.second); check(result.first, -10); result = pointlike::verticalDistance(Point{10, 20}, seg); REQUIRE(result.second); check(result.first, 10); Point p4 = {80, 0}; Segment seg2 = { {0, 0}, {0, 40} }; result = pointlike::horizontalDistance(p4, seg2); REQUIRE(result.second); check(result.first, 80); result = pointlike::verticalDistance(p4, seg2); // Point should not be related to the segment REQUIRE_FALSE(result.second); } TEST_CASE("Area", "[Geometry]") { using namespace libnest2d; RectangleItem rect(10, 10); REQUIRE(rect.area() == Approx(100)); RectangleItem rect2 = {100, 100}; REQUIRE(rect2.area() == Approx(10000)); Item item = { {61, 97}, {70, 151}, {176, 151}, {189, 138}, {189, 59}, {70, 59}, {61, 77}, {61, 97} }; REQUIRE(shapelike::area(item.transformedShape()) > 0 ); } TEST_CASE("IsPointInsidePolygon", "[Geometry]") { using namespace libnest2d; RectangleItem rect(10, 10); Point p = {1, 1}; REQUIRE(rect.isInside(p)); p = {11, 11}; REQUIRE_FALSE(rect.isInside(p)); p = {11, 12}; REQUIRE_FALSE(rect.isInside(p)); p = {3, 3}; REQUIRE(rect.isInside(p)); } //TEST_CASE(GeometryAlgorithms, Intersections) { // using namespace binpack2d; // RectangleItem rect(70, 30); // rect.translate({80, 60}); // RectangleItem rect2(80, 60); // rect2.translate({80, 0}); //// REQUIRE_FALSE(Item::intersects(rect, rect2)); // Segment s1({0, 0}, {10, 10}); // Segment s2({1, 1}, {11, 11}); // REQUIRE_FALSE(ShapeLike::intersects(s1, s1)); // REQUIRE_FALSE(ShapeLike::intersects(s1, s2)); //} TEST_CASE("LeftAndDownPolygon", "[Geometry]") { using namespace libnest2d; Box bin(100, 100); BottomLeftPlacer placer(bin); Item item = {{70, 75}, {88, 60}, {65, 50}, {60, 30}, {80, 20}, {42, 20}, {35, 35}, {35, 55}, {40, 75}, {70, 75}}; Item leftControl = { {40, 75}, {35, 55}, {35, 35}, {42, 20}, {0, 20}, {0, 75}, {40, 75}}; Item downControl = {{88, 60}, {88, 0}, {35, 0}, {35, 35}, {42, 20}, {80, 20}, {60, 30}, {65, 50}, {88, 60}}; Item leftp(placer.leftPoly(item)); REQUIRE(shapelike::isValid(leftp.rawShape()).first); REQUIRE(leftp.vertexCount() == leftControl.vertexCount()); for(unsigned long i = 0; i < leftControl.vertexCount(); i++) { REQUIRE(getX(leftp.vertex(i)) == getX(leftControl.vertex(i))); REQUIRE(getY(leftp.vertex(i)) == getY(leftControl.vertex(i))); } Item downp(placer.downPoly(item)); REQUIRE(shapelike::isValid(downp.rawShape()).first); REQUIRE(downp.vertexCount() == downControl.vertexCount()); for(unsigned long i = 0; i < downControl.vertexCount(); i++) { REQUIRE(getX(downp.vertex(i)) == getX(downControl.vertex(i))); REQUIRE(getY(downp.vertex(i)) == getY(downControl.vertex(i))); } } TEST_CASE("ArrangeRectanglesTight", "[Nesting]") { using namespace libnest2d; std::vector rects = { {80, 80}, {60, 90}, {70, 30}, {80, 60}, {60, 60}, {60, 40}, {40, 40}, {10, 10}, {10, 10}, {10, 10}, {10, 10}, {10, 10}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {20, 20} }; Box bin(210, 250, {105, 125}); REQUIRE(bin.width() == 210); REQUIRE(bin.height() == 250); REQUIRE(getX(bin.center()) == 105); REQUIRE(getY(bin.center()) == 125); _Nester arrange(bin); arrange.execute(rects.begin(), rects.end()); auto max_group = std::max_element(rects.begin(), rects.end(), [](const Item &i1, const Item &i2) { return i1.binId() < i2.binId(); }); int groups = max_group == rects.end() ? 0 : max_group->binId() + 1; REQUIRE(groups == 1u); REQUIRE( std::all_of(rects.begin(), rects.end(), [](const RectangleItem &itm) { return itm.binId() != BIN_ID_UNSET; })); // check for no intersections, no containment: bool valid = true; for(Item& r1 : rects) { for(Item& r2 : rects) { if(&r1 != &r2 ) { valid = !Item::intersects(r1, r2) || Item::touches(r1, r2); REQUIRE(valid); valid = (valid && !r1.isInside(r2) && !r2.isInside(r1)); REQUIRE(valid); } } } } TEST_CASE("ArrangeRectanglesLoose", "[Nesting]") { using namespace libnest2d; // std::vector rects = { {40, 40}, {10, 10}, {20, 20} }; std::vector rects = { {80, 80}, {60, 90}, {70, 30}, {80, 60}, {60, 60}, {60, 40}, {40, 40}, {10, 10}, {10, 10}, {10, 10}, {10, 10}, {10, 10}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {5, 5}, {20, 20} }; Box bin(210, 250, {105, 125}); REQUIRE(bin.width() == 210); REQUIRE(bin.height() == 250); REQUIRE(getX(bin.center()) == 105); REQUIRE(getY(bin.center()) == 125); Coord min_obj_distance = 5; _Nester arrange(bin, min_obj_distance); arrange.execute(rects.begin(), rects.end()); auto max_group = std::max_element(rects.begin(), rects.end(), [](const Item &i1, const Item &i2) { return i1.binId() < i2.binId(); }); auto groups = size_t(max_group == rects.end() ? 0 : max_group->binId() + 1); REQUIRE(groups == 1u); REQUIRE( std::all_of(rects.begin(), rects.end(), [](const RectangleItem &itm) { return itm.binId() != BIN_ID_UNSET; })); // check for no intersections, no containment: bool valid = true; for(Item& r1 : rects) { for(Item& r2 : rects) { if(&r1 != &r2 ) { valid = !Item::intersects(r1, r2); valid = (valid && !r1.isInside(r2) && !r2.isInside(r1)); REQUIRE(valid); } } } } namespace { using namespace libnest2d; template void exportSVG(std::vector>& result, const Bin& bin, int idx = 0) { std::string loc = "out"; static std::string svg_header = R"raw( )raw"; int i = idx; auto r = result; // for(auto r : result) { std::fstream out(loc + std::to_string(i) + ".svg", std::fstream::out); if(out.is_open()) { out << svg_header; Item rbin( RectangleItem(bin.width(), bin.height()) ); for(unsigned j = 0; j < rbin.vertexCount(); j++) { auto v = rbin.vertex(j); setY(v, -getY(v)/SCALE + 500 ); setX(v, getX(v)/SCALE); rbin.setVertex(j, v); } out << shapelike::serialize(rbin.rawShape()) << std::endl; for(Item& sh : r) { Item tsh(sh.transformedShape()); for(unsigned j = 0; j < tsh.vertexCount(); j++) { auto v = tsh.vertex(j); setY(v, -getY(v)/SCALE + 500); setX(v, getX(v)/SCALE); tsh.setVertex(j, v); } out << shapelike::serialize(tsh.rawShape()) << std::endl; } out << "\n" << std::endl; } out.close(); // i++; // } } } TEST_CASE("BottomLeftStressTest", "[Geometry]") { using namespace libnest2d; const Coord SCALE = 1000000; auto& input = prusaParts(); Box bin(210*SCALE, 250*SCALE); BottomLeftPlacer placer(bin); auto it = input.begin(); auto next = it; int i = 0; while(it != input.end() && ++next != input.end()) { placer.pack(*it); placer.pack(*next); auto result = placer.getItems(); bool valid = true; if(result.size() == 2) { Item& r1 = result[0]; Item& r2 = result[1]; valid = !Item::intersects(r1, r2) || Item::touches(r1, r2); valid = (valid && !r1.isInside(r2) && !r2.isInside(r1)); if(!valid) { std::cout << "error index: " << i << std::endl; exportSVG(result, bin, i); } REQUIRE(valid); } else { std::cout << "something went terribly wrong!" << std::endl; FAIL(); } placer.clearItems(); it++; i++; } } TEST_CASE("convexHull", "[Geometry]") { using namespace libnest2d; ClipperLib::Path poly = PRINTER_PART_POLYGONS[0]; auto chull = sl::convexHull(poly); REQUIRE(chull.size() == poly.size()); } TEST_CASE("PrusaPartsShouldFitIntoTwoBins", "[Nesting]") { // Get the input items and define the bin. std::vector input = prusaParts(); auto bin = Box(250000000, 210000000); // Do the nesting. Check in each step if the remaining items are less than // in the previous step. (Some algorithms can place more items in one step) size_t pcount = input.size(); size_t bins = libnest2d::nest(input, bin, 0, {}, ProgressFunction{[&pcount](unsigned cnt) { REQUIRE(cnt < pcount); pcount = cnt; }}); // For prusa parts, 2 bins should be enough... REQUIRE(bins > 0u); REQUIRE(bins <= 2u); // All parts should be processed by the algorithm REQUIRE( std::all_of(input.begin(), input.end(), [](const Item &itm) { return itm.binId() != BIN_ID_UNSET; })); // Gather the items into piles of arranged polygons... using Pile = TMultiShape; std::vector piles(bins); for (auto &itm : input) piles[size_t(itm.binId())].emplace_back(itm.transformedShape()); // Now check all the piles, the bounding box of each pile should be inside // the defined bin. for (auto &pile : piles) { auto bb = sl::boundingBox(pile); REQUIRE(sl::isInside(bb, bin)); } } TEST_CASE("EmptyItemShouldBeUntouched", "[Nesting]") { auto bin = Box(250000000, 210000000); // dummy bin std::vector items; items.emplace_back(Item{}); // Emplace empty item items.emplace_back(Item{0, 200, 0}); // Emplace zero area item size_t bins = libnest2d::nest(items, bin); REQUIRE(bins == 0u); for (auto &itm : items) REQUIRE(itm.binId() == BIN_ID_UNSET); } TEST_CASE("LargeItemShouldBeUntouched", "[Nesting]") { auto bin = Box(250000000, 210000000); // dummy bin std::vector items; items.emplace_back(RectangleItem{250000001, 210000001}); // Emplace large item size_t bins = libnest2d::nest(items, bin); REQUIRE(bins == 0u); REQUIRE(items.front().binId() == BIN_ID_UNSET); } TEST_CASE("Items can be preloaded", "[Nesting]") { auto bin = Box({0, 0}, {250000000, 210000000}); // dummy bin std::vector items; items.reserve(2); NestConfig<> cfg; cfg.placer_config.alignment = NestConfig<>::Placement::Alignment::DONT_ALIGN; items.emplace_back(RectangleItem{10000000, 10000000}); Item &fixed_rect = items.back(); fixed_rect.translate(bin.center()); items.emplace_back(RectangleItem{20000000, 20000000}); Item &movable_rect = items.back(); movable_rect.translate(bin.center()); SECTION("Preloaded Item should be untouched") { fixed_rect.markAsFixedInBin(0); size_t bins = libnest2d::nest(items, bin, 0, cfg); REQUIRE(bins == 1); REQUIRE(fixed_rect.binId() == 0); REQUIRE(fixed_rect.translation().X == bin.center().X); REQUIRE(fixed_rect.translation().Y == bin.center().Y); REQUIRE(movable_rect.binId() == 0); REQUIRE(movable_rect.translation().X != bin.center().X); REQUIRE(movable_rect.translation().Y != bin.center().Y); } SECTION("Preloaded Item should not affect free bins") { fixed_rect.markAsFixedInBin(1); size_t bins = libnest2d::nest(items, bin, 0, cfg); REQUIRE(bins == 2); REQUIRE(fixed_rect.binId() == 1); REQUIRE(fixed_rect.translation().X == bin.center().X); REQUIRE(fixed_rect.translation().Y == bin.center().Y); REQUIRE(movable_rect.binId() == 0); auto bb = movable_rect.boundingBox(); REQUIRE(bb.center().X == bin.center().X); REQUIRE(bb.center().Y == bin.center().Y); } } namespace { struct ItemPair { Item orbiter; Item stationary; }; std::vector nfp_testdata = { { { {80, 50}, {100, 70}, {120, 50}, {80, 50} }, { {10, 10}, {10, 40}, {40, 40}, {40, 10}, {10, 10} } }, { { {80, 50}, {60, 70}, {80, 90}, {120, 90}, {140, 70}, {120, 50}, {80, 50} }, { {10, 10}, {10, 40}, {40, 40}, {40, 10}, {10, 10} } }, { { {40, 10}, {30, 10}, {20, 20}, {20, 30}, {30, 40}, {40, 40}, {50, 30}, {50, 20}, {40, 10} }, { {80, 0}, {80, 30}, {110, 30}, {110, 0}, {80, 0} } }, { { {117, 107}, {118, 109}, {120, 112}, {122, 113}, {128, 113}, {130, 112}, {132, 109}, {133, 107}, {133, 103}, {132, 101}, {130, 98}, {128, 97}, {122, 97}, {120, 98}, {118, 101}, {117, 103}, {117, 107} }, { {102, 116}, {111, 126}, {114, 126}, {144, 106}, {148, 100}, {148, 85}, {147, 84}, {102, 84}, {102, 116}, } }, { { {99, 122}, {108, 140}, {110, 142}, {139, 142}, {151, 122}, {151, 102}, {142, 70}, {139, 68}, {111, 68}, {108, 70}, {99, 102}, {99, 122}, }, { {107, 124}, {128, 125}, {133, 125}, {136, 124}, {140, 121}, {142, 119}, {143, 116}, {143, 109}, {141, 93}, {139, 89}, {136, 86}, {134, 85}, {108, 85}, {107, 86}, {107, 124}, } }, { { {91, 100}, {94, 144}, {117, 153}, {118, 153}, {159, 112}, {159, 110}, {156, 66}, {133, 57}, {132, 57}, {91, 98}, {91, 100}, }, { {101, 90}, {103, 98}, {107, 113}, {114, 125}, {115, 126}, {135, 126}, {136, 125}, {144, 114}, {149, 90}, {149, 89}, {148, 87}, {145, 84}, {105, 84}, {102, 87}, {101, 89}, {101, 90}, } } }; std::vector nfp_concave_testdata = { { // ItemPair { { {533726, 142141}, {532359, 143386}, {530141, 142155}, {528649, 160091}, {533659, 157607}, {538669, 160091}, {537178, 142155}, {534959, 143386}, {533726, 142141}, } }, { { {118305, 11603}, {118311, 26616}, {113311, 26611}, {109311, 29604}, {109300, 44608}, {109311, 49631}, {113300, 52636}, {118311, 52636}, {118308, 103636}, {223830, 103636}, {236845, 90642}, {236832, 11630}, {232825, 11616}, {210149, 11616}, {211308, 13625}, {209315, 17080}, {205326, 17080}, {203334, 13629}, {204493, 11616}, {118305, 11603}, } }, } }; template void testNfp(const std::vector& testdata) { using namespace libnest2d; Box bin(210*SCALE, 250*SCALE); int TEST_CASEcase = 0; auto& exportfun = exportSVG; auto onetest = [&](Item& orbiter, Item& stationary, unsigned /*testidx*/){ TEST_CASEcase++; orbiter.translate({210*SCALE, 0}); auto&& nfp = nfp::noFitPolygon(stationary.rawShape(), orbiter.transformedShape()); placers::correctNfpPosition(nfp, stationary, orbiter); auto valid = shapelike::isValid(nfp.first); /*Item infp(nfp.first); if(!valid.first) { std::cout << "TEST_CASE instance: " << TEST_CASEidx << " " << valid.second << std::endl; std::vector> inp = {std::ref(infp)}; exportfun(inp, bin, TEST_CASEidx); }*/ REQUIRE(valid.first); Item infp(nfp.first); int i = 0; auto rorbiter = orbiter.transformedShape(); auto vo = nfp::referenceVertex(rorbiter); REQUIRE(stationary.isInside(infp)); for(auto v : infp) { auto dx = getX(v) - getX(vo); auto dy = getY(v) - getY(vo); Item tmp = orbiter; tmp.translate({dx, dy}); bool touching = Item::touches(tmp, stationary); if(!touching || !valid.first) { std::vector> inp = { std::ref(stationary), std::ref(tmp), std::ref(infp) }; exportfun(inp, bin, TEST_CASEcase*i++); } REQUIRE(touching); } }; unsigned tidx = 0; for(auto& td : testdata) { auto orbiter = td.orbiter; auto stationary = td.stationary; onetest(orbiter, stationary, tidx++); } tidx = 0; for(auto& td : testdata) { auto orbiter = td.stationary; auto stationary = td.orbiter; onetest(orbiter, stationary, tidx++); } } } TEST_CASE("nfpConvexConvex", "[Geometry]") { testNfp(nfp_testdata); } //TEST_CASE(GeometryAlgorithms, nfpConcaveConcave) { // TEST_CASENfp(nfp_concave_TEST_CASEdata); //} TEST_CASE("pointOnPolygonContour", "[Geometry]") { using namespace libnest2d; RectangleItem input(10, 10); placers::EdgeCache ecache(input); auto first = *input.begin(); REQUIRE(getX(first) == getX(ecache.coords(0))); REQUIRE(getY(first) == getY(ecache.coords(0))); auto last = *std::prev(input.end()); REQUIRE(getX(last) == getX(ecache.coords(1.0))); REQUIRE(getY(last) == getY(ecache.coords(1.0))); for(int i = 0; i <= 100; i++) { auto v = ecache.coords(i*(0.01)); REQUIRE(shapelike::touches(v, input.transformedShape())); } } TEST_CASE("mergePileWithPolygon", "[Geometry]") { using namespace libnest2d; RectangleItem rect1(10, 15); RectangleItem rect2(15, 15); RectangleItem rect3(20, 15); rect2.translate({10, 0}); rect3.translate({25, 0}); TMultiShape pile; pile.push_back(rect1.transformedShape()); pile.push_back(rect2.transformedShape()); auto result = nfp::merge(pile, rect3.transformedShape()); REQUIRE(result.size() == 1); RectangleItem ref(45, 15); REQUIRE(shapelike::area(result.front()) == Approx(ref.area())); } namespace { long double refMinAreaBox(const PolygonImpl& p) { auto it = sl::cbegin(p), itx = std::next(it); long double min_area = std::numeric_limits::max(); auto update_min = [&min_area, &it, &itx, &p]() { Segment s(*it, *itx); PolygonImpl rotated = p; sl::rotate(rotated, -s.angleToXaxis()); auto bb = sl::boundingBox(rotated); auto area = cast(sl::area(bb)); if(min_area > area) min_area = area; }; while(itx != sl::cend(p)) { update_min(); ++it; ++itx; } it = std::prev(sl::cend(p)); itx = sl::cbegin(p); update_min(); return min_area; } template struct BoostGCD { T operator()(const T &a, const T &b) { return boost::gcd(a, b); } }; using Unit = int64_t; using Ratio = boost::rational; } //TEST_CASE(GeometryAlgorithms, MinAreaBBCClk) { // auto u = [](ClipperLib::cInt n) { return n*1000000; }; // PolygonImpl poly({ {u(0), u(0)}, {u(4), u(1)}, {u(2), u(4)}}); // long double arearef = refMinAreaBox(poly); // long double area = minAreaBoundingBox(poly).area(); // REQUIRE(std::abs(area - arearef) <= 500e6 ); //} TEST_CASE("MinAreaBBWithRotatingCalipers", "[Geometry]") { long double err_epsilon = 500e6l; for(ClipperLib::Path rinput : PRINTER_PART_POLYGONS) { PolygonImpl poly(rinput); long double arearef = refMinAreaBox(poly); auto bb = minAreaBoundingBox(rinput); long double area = cast(bb.area()); bool succ = std::abs(arearef - area) < err_epsilon; REQUIRE(succ); } for(ClipperLib::Path rinput : STEGOSAUR_POLYGONS) { rinput.pop_back(); std::reverse(rinput.begin(), rinput.end()); PolygonImpl poly(removeCollinearPoints(rinput, 1000000)); long double arearef = refMinAreaBox(poly); auto bb = minAreaBoundingBox(poly); long double area = cast(bb.area()); bool succ = std::abs(arearef - area) < err_epsilon; REQUIRE(succ); } } libnest2d-5.0.0/tools/000077500000000000000000000000001422601530300145365ustar00rootroot00000000000000libnest2d-5.0.0/tools/benchmark.h000066400000000000000000000032111422601530300166360ustar00rootroot00000000000000/* * Copyright (C) Tamás Mészáros * 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 2 * 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, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef INCLUDE_BENCHMARK_H_ #define INCLUDE_BENCHMARK_H_ #include #include /** * A class for doing benchmarks. */ class Benchmark { typedef std::chrono::high_resolution_clock Clock; typedef Clock::duration Duration; typedef Clock::time_point TimePoint; TimePoint t1, t2; Duration d; inline double to_sec(Duration d) { return d.count() * double(Duration::period::num) / Duration::period::den; } public: /** * Measure time from the moment of this call. */ void start() { t1 = Clock::now(); } /** * Measure time to the moment of this call. */ void stop() { t2 = Clock::now(); } /** * Get the time elapsed between a start() end a stop() call. * @return Returns the elapsed time in seconds. */ double getElapsedSec() { d = t2 - t1; return to_sec(d); } }; #endif /* INCLUDE_BENCHMARK_H_ */ libnest2d-5.0.0/tools/libnfpglue.cpp000066400000000000000000000106011422601530300173670ustar00rootroot00000000000000//#ifndef NDEBUG //#define NFP_DEBUG //#endif #include "libnfpglue.hpp" #include "tools/libnfporb/libnfporb.hpp" namespace libnest2d { namespace { inline bool vsort(const libnfporb::point_t& v1, const libnfporb::point_t& v2) { using Coord = libnfporb::coord_t; Coord x1 = v1.x_, x2 = v2.x_, y1 = v1.y_, y2 = v2.y_; auto diff = y1 - y2; #ifdef LIBNFP_USE_RATIONAL long double diffv = diff.convert_to(); #else long double diffv = diff.val(); #endif if(std::abs(diffv) <= std::numeric_limits::epsilon()) return x1 < x2; return diff < 0; } TCoord getX(const libnfporb::point_t& p) { #ifdef LIBNFP_USE_RATIONAL return p.x_.convert_to>(); #else return static_cast>(std::round(p.x_.val())); #endif } TCoord getY(const libnfporb::point_t& p) { #ifdef LIBNFP_USE_RATIONAL return p.y_.convert_to>(); #else return static_cast>(std::round(p.y_.val())); #endif } libnfporb::point_t scale(const libnfporb::point_t& p, long double factor) { #ifdef LIBNFP_USE_RATIONAL auto px = p.x_.convert_to(); auto py = p.y_.convert_to(); #else long double px = p.x_.val(); long double py = p.y_.val(); #endif return {px*factor, py*factor}; } } NfpR _nfp(const PolygonImpl &sh, const PolygonImpl &cother) { namespace sl = shapelike; NfpR ret; try { libnfporb::polygon_t pstat, porb; boost::geometry::convert(sh, pstat); boost::geometry::convert(cother, porb); long double factor = 0.0000001;//libnfporb::NFP_EPSILON; long double refactor = 1.0/factor; for(auto& v : pstat.outer()) v = scale(v, factor); // std::string message; // boost::geometry::is_valid(pstat, message); // std::cout << message << std::endl; for(auto& h : pstat.inners()) for(auto& v : h) v = scale(v, factor); for(auto& v : porb.outer()) v = scale(v, factor); // message; // boost::geometry::is_valid(porb, message); // std::cout << message << std::endl; for(auto& h : porb.inners()) for(auto& v : h) v = scale(v, factor); // this can throw auto nfp = libnfporb::generateNFP(pstat, porb, true); auto &ct = sl::getContour(ret.first); ct.reserve(nfp.front().size()+1); for(auto v : nfp.front()) { v = scale(v, refactor); ct.emplace_back(getX(v), getY(v)); } ct.push_back(ct.front()); std::reverse(ct.begin(), ct.end()); auto &rholes = sl::holes(ret.first); for(size_t hidx = 1; hidx < nfp.size(); ++hidx) { if(nfp[hidx].size() >= 3) { rholes.emplace_back(); auto& h = rholes.back(); h.reserve(nfp[hidx].size()+1); for(auto& v : nfp[hidx]) { v = scale(v, refactor); h.emplace_back(getX(v), getY(v)); } h.push_back(h.front()); std::reverse(h.begin(), h.end()); } } ret.second = nfp::referenceVertex(ret.first); } catch(std::exception& e) { std::cout << "Error: " << e.what() << "\nTrying with convex hull..." << std::endl; // auto ch_stat = ShapeLike::convexHull(sh); // auto ch_orb = ShapeLike::convexHull(cother); ret = nfp::nfpConvexOnly(sh, cother); } return ret; } NfpR nfp::NfpImpl::operator()( const PolygonImpl &sh, const ClipperLib::PolygonImpl &cother) { return _nfp(sh, cother);//nfpConvexOnly(sh, cother); } NfpR nfp::NfpImpl::operator()( const PolygonImpl &sh, const ClipperLib::PolygonImpl &cother) { return _nfp(sh, cother); } NfpR nfp::NfpImpl::operator()( const PolygonImpl &sh, const ClipperLib::PolygonImpl &cother) { return _nfp(sh, cother); } //PolygonImpl //Nfp::NfpImpl::operator()( // const PolygonImpl &sh, const ClipperLib::PolygonImpl &cother) //{ // return _nfp(sh, cother); //} //PolygonImpl //Nfp::NfpImpl::operator()( // const PolygonImpl &sh, const ClipperLib::PolygonImpl &cother) //{ // return _nfp(sh, cother); //} } libnest2d-5.0.0/tools/libnfpglue.hpp000066400000000000000000000023051422601530300173760ustar00rootroot00000000000000#ifndef LIBNFPGLUE_HPP #define LIBNFPGLUE_HPP #include namespace libnest2d { using NfpR = nfp::NfpResult; NfpR _nfp(const PolygonImpl& sh, const PolygonImpl& cother); template<> struct nfp::NfpImpl { NfpR operator()(const PolygonImpl& sh, const PolygonImpl& cother); }; template<> struct nfp::NfpImpl { NfpR operator()(const PolygonImpl& sh, const PolygonImpl& cother); }; template<> struct nfp::NfpImpl { NfpR operator()(const PolygonImpl& sh, const PolygonImpl& cother); }; //template<> //struct Nfp::NfpImpl { // NfpResult operator()(const PolygonImpl& sh, const PolygonImpl& cother); //}; //template<> //struct Nfp::NfpImpl { // NfpResult operator()(const PolygonImpl& sh, const PolygonImpl& cother); //}; template<> struct nfp::MaxNfpLevel { static const BP2D_CONSTEXPR NfpLevel value = // NfpLevel::CONVEX_ONLY; NfpLevel::BOTH_CONCAVE; }; } #endif // LIBNFPGLUE_HPP libnest2d-5.0.0/tools/libnfporb/000077500000000000000000000000001422601530300165135ustar00rootroot00000000000000libnest2d-5.0.0/tools/libnfporb/LICENSE000066400000000000000000001045131422601530300175240ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. 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. Copyright (C) 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 . 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: Copyright (C) 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 . 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 . libnest2d-5.0.0/tools/libnfporb/ORIGIN000066400000000000000000000001351422601530300174240ustar00rootroot00000000000000https://github.com/kallaballa/libnfp.git commit hash a5cf9f6a76ddab95567fccf629d4d099b60237d7libnest2d-5.0.0/tools/libnfporb/README.md000066400000000000000000000106261422601530300177770ustar00rootroot00000000000000[![License: GPL v3](https://img.shields.io/badge/License-GPL%20v3-blue.svg)](https://www.gnu.org/licenses/gpl-3.0.en.html) ##### If you give me a real good reason i might be willing to give you permission to use it under a different license for a specific application. Real good reasons include the following (non-exhausive): the greater good, educational purpose and money :) # libnfporb Implementation of a robust no-fit polygon generation in a C++ library using an orbiting approach. __Please note:__ The paper this implementation is based it on has several bad assumptions that required me to "improvise". That means the code doesn't reflect the paper anymore and is running way slower than expected. At the moment I'm working on implementing a new approach based on this paper (using minkowski sums): https://eprints.soton.ac.uk/36850/1/CORMSIS-05-05.pdf ## Description The no-fit polygon optimization makes it possible to check for overlap (or non-overlapping touch) of two polygons with only 1 point in polygon check (by providing the set of non-overlapping placements). This library implements the orbiting approach to generate the no-fit polygon: Given two polygons A and B, A is the stationary one and B the orbiting one, B is slid as tightly as possibly around the edges of polygon A. During the orbiting a chosen reference point is tracked. By tracking the movement of the reference point a third polygon can be generated: the no-fit polygon. Once the no-fit polygon has been generated it can be used to test for overlap by only checking if the reference point is inside the NFP (overlap) outside the NFP (no overlap) or exactly on the edge of the NFP (touch). ### Examples: The polygons: ![Start of NFP](/images/start.png?raw=true) Orbiting: ![State 1](/images/next0.png?raw=true) ![State 2](/images/next1.png?raw=true) ![State 3](/images/next2.png?raw=true) ![State 4](/images/next3.png?raw=true) ![State 5](/images/next4.png?raw=true) ![State 6](/images/next5.png?raw=true) ![State 7](/images/next6.png?raw=true) ![State 8](/images/next7.png?raw=true) ![State 9](/images/next8.png?raw=true) The resulting NFP is red: ![nfp](/images/nfp.png?raw=true) Polygons can have concavities, holes, interlocks or might fit perfectly: ![concavities](/images/concavities.png?raw=true) ![hole](/images/hole.png?raw=true) ![interlock](/images/interlock.png?raw=true) ![jigsaw](/images/jigsaw.png?raw=true) ## The Approach The approch of this library is highly inspired by the scientific paper [Complete and robust no-fit polygon generation for the irregular stock cutting problem](https://pdfs.semanticscholar.org/e698/0dd78306ba7d5bb349d20c6d8f2e0aa61062.pdf) and by [Svgnest](http://svgnest.com) Note that is wasn't completely possible to implement it as suggested in the paper because it had several shortcomings that prevent complete NFP generation on some of my test cases. Especially the termination criteria (reference point returns to first point of NFP) proved to be wrong (see: test-case rect). Also tracking of used edges can't be performed as suggested in the paper since there might be situations where no edge of A is traversed (see: test-case doublecon). By default the library is using floating point as coordinate type but by defining the flag "LIBNFP_USE_RATIONAL" the library can be instructed to use infinite precision. ## Build The library has two dependencies: [Boost Geometry](http://www.boost.org/doc/libs/1_65_1/libs/geometry/doc/html/index.html) and [libgmp](https://gmplib.org). You need to install those first before building. Note that building is only required for the examples. The library itself is header-only. git clone https://github.com/kallaballa/libnfp.git cd libnfp make sudo make install ## Code Example ```c++ //uncomment next line to use infinite precision (slow) //#define LIBNFP_USE_RATIONAL #include "../src/libnfp.hpp" int main(int argc, char** argv) { using namespace libnfp; polygon_t pA; polygon_t pB; //read polygons from wkt files read_wkt_polygon(argv[1], pA); read_wkt_polygon(argv[2], pB); //generate NFP of polygon A and polygon B and check the polygons for validity. //When the third parameters is false validity check is skipped for a little performance increase nfp_t nfp = generateNFP(pA, pB, true); //write a svg containing pA, pB and NFP write_svg("nfp.svg",{pA,pB},nfp); return 0; } ``` Run the example program: examples/nfp data/crossing/A.wkt data/crossing/B.wkt libnest2d-5.0.0/tools/libnfporb/libnfporb.hpp000066400000000000000000001247001422601530300212050ustar00rootroot00000000000000#ifndef NFP_HPP_ #define NFP_HPP_ #include #include #include #include #include #include #include #include #include #include #if defined(_MSC_VER) && _MSC_VER <= 1800 || __cplusplus < 201103L #define LIBNFP_NOEXCEPT #define LIBNFP_CONSTEXPR #elif __cplusplus >= 201103L #define LIBNFP_NOEXCEPT noexcept #define LIBNFP_CONSTEXPR constexpr #endif #ifdef LIBNFP_USE_RATIONAL #include #include #endif #include #include #include #include #include #include #include #include #ifdef LIBNFP_USE_RATIONAL namespace bm = boost::multiprecision; #endif namespace bg = boost::geometry; namespace trans = boost::geometry::strategy::transform; namespace libnfporb { #ifdef NFP_DEBUG #define DEBUG_VAL(x) std::cerr << x << std::endl; #define DEBUG_MSG(title, value) std::cerr << title << ":" << value << std::endl; #else #define DEBUG_VAL(x) #define DEBUG_MSG(title, value) #endif using std::string; static LIBNFP_CONSTEXPR long double NFP_EPSILON=0.00000001; class LongDouble { private: long double val_; public: LongDouble() : val_(0) { } LongDouble(const long double& val) : val_(val) { } void setVal(const long double& v) { val_ = v; } long double val() const { return val_; } LongDouble operator/(const LongDouble& other) const { return this->val_ / other.val_; } LongDouble operator*(const LongDouble& other) const { return this->val_ * other.val_; } LongDouble operator-(const LongDouble& other) const { return this->val_ - other.val_; } LongDouble operator-() const { return this->val_ * -1; } LongDouble operator+(const LongDouble& other) const { return this->val_ + other.val_; } void operator/=(const LongDouble& other) { this->val_ = this->val_ / other.val_; } void operator*=(const LongDouble& other) { this->val_ = this->val_ * other.val_; } void operator-=(const LongDouble& other) { this->val_ = this->val_ - other.val_; } void operator+=(const LongDouble& other) { this->val_ = this->val_ + other.val_; } bool operator==(const int& other) const { return this->operator ==(static_cast(other)); } bool operator==(const LongDouble& other) const { return this->operator ==(other.val()); } bool operator==(const long double& other) const { return this->val() == other; } bool operator!=(const int& other) const { return !this->operator ==(other); } bool operator!=(const LongDouble& other) const { return !this->operator ==(other); } bool operator!=(const long double& other) const { return !this->operator ==(other); } bool operator<(const int& other) const { return this->operator <(static_cast(other)); } bool operator<(const LongDouble& other) const { return this->operator <(other.val()); } bool operator<(const long double& other) const { return this->val() < other; } bool operator>(const int& other) const { return this->operator >(static_cast(other)); } bool operator>(const LongDouble& other) const { return this->operator >(other.val()); } bool operator>(const long double& other) const { return this->val() > other; } bool operator>=(const int& other) const { return this->operator >=(static_cast(other)); } bool operator>=(const LongDouble& other) const { return this->operator >=(other.val()); } bool operator>=(const long double& other) const { return this->val() >= other; } bool operator<=(const int& other) const { return this->operator <=(static_cast(other)); } bool operator<=(const LongDouble& other) const { return this->operator <=(other.val()); } bool operator<=(const long double& other) const { return this->val() <= other; } }; } namespace std { template<> struct numeric_limits { static const LIBNFP_CONSTEXPR bool is_specialized = true; static const LIBNFP_CONSTEXPR long double min() LIBNFP_NOEXCEPT { return std::numeric_limits::min(); } static LIBNFP_CONSTEXPR long double max() LIBNFP_NOEXCEPT { return std::numeric_limits::max(); } #if __cplusplus >= 201103L static LIBNFP_CONSTEXPR long double lowest() LIBNFP_NOEXCEPT { return -std::numeric_limits::lowest(); } #endif static const LIBNFP_CONSTEXPR int digits = std::numeric_limits::digits; static const LIBNFP_CONSTEXPR int digits10 = std::numeric_limits::digits10; #if __cplusplus >= 201103L static const LIBNFP_CONSTEXPR int max_digits10 = std::numeric_limits::max_digits10; #endif static const LIBNFP_CONSTEXPR bool is_signed = true; static const LIBNFP_CONSTEXPR bool is_integer = false; static const LIBNFP_CONSTEXPR bool is_exact = false; static const LIBNFP_CONSTEXPR int radix = std::numeric_limits::radix; static const LIBNFP_CONSTEXPR long double epsilon() LIBNFP_NOEXCEPT { return libnfporb::NFP_EPSILON; } static const LIBNFP_CONSTEXPR long double round_error() LIBNFP_NOEXCEPT { return 0.5L; } static const LIBNFP_CONSTEXPR int min_exponent = std::numeric_limits::min_exponent; static const LIBNFP_CONSTEXPR int min_exponent10 = std::numeric_limits::min_exponent10; static const LIBNFP_CONSTEXPR int max_exponent = std::numeric_limits::max_exponent; static const LIBNFP_CONSTEXPR int max_exponent10 = std::numeric_limits::max_exponent10; static const LIBNFP_CONSTEXPR bool has_infinity = std::numeric_limits::has_infinity; static const LIBNFP_CONSTEXPR bool has_quiet_NaN = std::numeric_limits::has_quiet_NaN; static const LIBNFP_CONSTEXPR bool has_signaling_NaN = has_quiet_NaN; static const LIBNFP_CONSTEXPR float_denorm_style has_denorm = std::numeric_limits::has_denorm; static const LIBNFP_CONSTEXPR bool has_denorm_loss = std::numeric_limits::has_denorm_loss; static const LIBNFP_CONSTEXPR long double infinity() LIBNFP_NOEXCEPT { return std::numeric_limits::infinity(); } static const LIBNFP_CONSTEXPR long double quiet_NaN() LIBNFP_NOEXCEPT { return std::numeric_limits::quiet_NaN(); } static const LIBNFP_CONSTEXPR long double signaling_NaN() LIBNFP_NOEXCEPT { return std::numeric_limits::signaling_NaN(); } static const LIBNFP_CONSTEXPR long double denorm_min() LIBNFP_NOEXCEPT { return std::numeric_limits::denorm_min(); } static const LIBNFP_CONSTEXPR bool is_iec559 = has_infinity && has_quiet_NaN && has_denorm == denorm_present; static const LIBNFP_CONSTEXPR bool is_bounded = true; static const LIBNFP_CONSTEXPR bool is_modulo = false; static const LIBNFP_CONSTEXPR bool traps = std::numeric_limits::traps; static const LIBNFP_CONSTEXPR bool tinyness_before = std::numeric_limits::tinyness_before; static const LIBNFP_CONSTEXPR float_round_style round_style = round_to_nearest; }; } namespace boost { namespace numeric { template<> struct raw_converter> { typedef boost::numeric::conversion_traits::result_type result_type ; typedef boost::numeric::conversion_traits::argument_type argument_type ; static result_type low_level_convert ( argument_type s ) { return s.val() ; } } ; } } namespace libnfporb { #ifndef LIBNFP_USE_RATIONAL typedef LongDouble coord_t; #else typedef bm::number rational_t; typedef rational_t coord_t; #endif bool equals(const LongDouble& lhs, const LongDouble& rhs); #ifdef LIBNFP_USE_RATIONAL bool equals(const rational_t& lhs, const rational_t& rhs); #endif bool equals(const long double& lhs, const long double& rhs); const coord_t MAX_COORD = 999999999999999999.0; const coord_t MIN_COORD = std::numeric_limits::min(); class point_t { public: point_t() : x_(0), y_(0) { } point_t(coord_t x, coord_t y) : x_(x), y_(y) { } bool marked_ = false; coord_t x_; coord_t y_; point_t operator-(const point_t& other) const { point_t result = *this; bg::subtract_point(result, other); return result; } point_t operator+(const point_t& other) const { point_t result = *this; bg::add_point(result, other); return result; } bool operator==(const point_t& other) const { return bg::equals(this, other); } bool operator!=(const point_t& other) const { return !this->operator ==(other); } bool operator<(const point_t& other) const { return boost::geometry::math::smaller(this->x_, other.x_) || (equals(this->x_, other.x_) && boost::geometry::math::smaller(this->y_, other.y_)); } }; inline long double toLongDouble(const LongDouble& c) { return c.val(); } #ifdef LIBNFP_USE_RATIONAL inline long double toLongDouble(const rational_t& c) { return bm::numerator(c).convert_to() / bm::denominator(c).convert_to(); } #endif std::ostream& operator<<(std::ostream& os, const coord_t& p) { os << toLongDouble(p); return os; } std::istream& operator>>(std::istream& is, LongDouble& c) { long double val; is >> val; c.setVal(val); return is; } std::ostream& operator<<(std::ostream& os, const point_t& p) { os << "{" << toLongDouble(p.x_) << "," << toLongDouble(p.y_) << "}"; return os; } const point_t INVALID_POINT = {MAX_COORD, MAX_COORD}; typedef bg::model::segment segment_t; } #ifdef LIBNFP_USE_RATIONAL inline long double acos(const libnfporb::rational_t& r) { return acos(libnfporb::toLongDouble(r)); } #endif inline long double acos(const libnfporb::LongDouble& ld) { return acos(libnfporb::toLongDouble(ld)); } #ifdef LIBNFP_USE_RATIONAL inline long double sqrt(const libnfporb::rational_t& r) { return sqrt(libnfporb::toLongDouble(r)); } #endif inline long double sqrt(const libnfporb::LongDouble& ld) { return sqrt(libnfporb::toLongDouble(ld)); } BOOST_GEOMETRY_REGISTER_POINT_2D(libnfporb::point_t, libnfporb::coord_t, cs::cartesian, x_, y_) namespace boost { namespace geometry { namespace math { namespace detail { template <> struct square_root { typedef libnfporb::LongDouble return_type; static inline libnfporb::LongDouble apply(libnfporb::LongDouble const& a) { return std::sqrt(a.val()); } }; #ifdef LIBNFP_USE_RATIONAL template <> struct square_root { typedef libnfporb::rational_t return_type; static inline libnfporb::rational_t apply(libnfporb::rational_t const& a) { return std::sqrt(libnfporb::toLongDouble(a)); } }; #endif template<> struct abs { static libnfporb::LongDouble apply(libnfporb::LongDouble const& value) { libnfporb::LongDouble const zero = libnfporb::LongDouble(); return value.val() < zero.val() ? -value.val() : value.val(); } }; template <> struct equals { template static inline bool apply(libnfporb::LongDouble const& lhs, libnfporb::LongDouble const& rhs, Policy const& policy) { if(lhs.val() == rhs.val()) return true; return bg::math::detail::abs::apply(lhs.val() - rhs.val()) <= policy.apply(lhs.val(), rhs.val()) * libnfporb::NFP_EPSILON; } }; template <> struct smaller { static inline bool apply(libnfporb::LongDouble const& lhs, libnfporb::LongDouble const& rhs) { if(lhs.val() == rhs.val() || bg::math::detail::abs::apply(lhs.val() - rhs.val()) <= libnfporb::NFP_EPSILON * std::max(lhs.val(), rhs.val())) return false; return lhs < rhs; } }; } } } } namespace libnfporb { inline bool smaller(const LongDouble& lhs, const LongDouble& rhs) { return boost::geometry::math::detail::smaller::apply(lhs, rhs); } inline bool larger(const LongDouble& lhs, const LongDouble& rhs) { return smaller(rhs, lhs); } bool equals(const LongDouble& lhs, const LongDouble& rhs) { if(lhs.val() == rhs.val()) return true; return bg::math::detail::abs::apply(lhs.val() - rhs.val()) <= libnfporb::NFP_EPSILON * std::max(lhs.val(), rhs.val()); } #ifdef LIBNFP_USE_RATIONAL inline bool smaller(const rational_t& lhs, const rational_t& rhs) { return lhs < rhs; } inline bool larger(const rational_t& lhs, const rational_t& rhs) { return smaller(rhs, lhs); } bool equals(const rational_t& lhs, const rational_t& rhs) { return lhs == rhs; } #endif inline bool smaller(const long double& lhs, const long double& rhs) { return lhs < rhs; } inline bool larger(const long double& lhs, const long double& rhs) { return smaller(rhs, lhs); } bool equals(const long double& lhs, const long double& rhs) { return lhs == rhs; } typedef bg::model::polygon polygon_t; typedef std::vector nfp_t; typedef bg::model::linestring linestring_t; typedef polygon_t::ring_type::size_type psize_t; typedef bg::model::d2::point_xy pointf_t; typedef bg::model::segment segmentf_t; typedef bg::model::polygon polygonf_t; polygonf_t::ring_type convert(const polygon_t::ring_type& r) { polygonf_t::ring_type rf; for(const auto& pt : r) { rf.push_back(pointf_t(toLongDouble(pt.x_), toLongDouble(pt.y_))); } return rf; } polygonf_t convert(polygon_t p) { polygonf_t pf; pf.outer() = convert(p.outer()); for(const auto& r : p.inners()) { pf.inners().push_back(convert(r)); } return pf; } polygon_t nfpRingsToNfpPoly(const nfp_t& nfp) { polygon_t nfppoly; for (const auto& pt : nfp.front()) { nfppoly.outer().push_back(pt); } for (size_t i = 1; i < nfp.size(); ++i) { nfppoly.inners().push_back({}); for (const auto& pt : nfp[i]) { nfppoly.inners().back().push_back(pt); } } return nfppoly; } void write_svg(std::string const& filename,const std::vector& segments) { std::ofstream svg(filename.c_str()); boost::geometry::svg_mapper mapper(svg, 100, 100, "width=\"200mm\" height=\"200mm\" viewBox=\"-250 -250 500 500\""); for(const auto& seg : segments) { segmentf_t segf({toLongDouble(seg.first.x_), toLongDouble(seg.first.y_)}, {toLongDouble(seg.second.x_), toLongDouble(seg.second.y_)}); mapper.add(segf); mapper.map(segf, "fill-opacity:0.5;fill:rgb(153,204,0);stroke:rgb(153,204,0);stroke-width:2"); } } void write_svg(std::string const& filename, const polygon_t& p, const polygon_t::ring_type& ring) { std::ofstream svg(filename.c_str()); boost::geometry::svg_mapper mapper(svg, 100, 100, "width=\"200mm\" height=\"200mm\" viewBox=\"-250 -250 500 500\""); auto pf = convert(p); auto rf = convert(ring); mapper.add(pf); mapper.map(pf, "fill-opacity:0.5;fill:rgb(153,204,0);stroke:rgb(153,204,0);stroke-width:2"); mapper.add(rf); mapper.map(rf, "fill-opacity:0.5;fill:rgb(153,204,0);stroke:rgb(153,204,0);stroke-width:2"); } void write_svg(std::string const& filename, std::vector const& polygons) { std::ofstream svg(filename.c_str()); boost::geometry::svg_mapper mapper(svg, 100, 100, "width=\"200mm\" height=\"200mm\" viewBox=\"-250 -250 500 500\""); for (auto p : polygons) { auto pf = convert(p); mapper.add(pf); mapper.map(pf, "fill-opacity:0.5;fill:rgb(153,204,0);stroke:rgb(153,204,0);stroke-width:2"); } } void write_svg(std::string const& filename, std::vector const& polygons, const nfp_t& nfp) { polygon_t nfppoly; for (const auto& pt : nfp.front()) { nfppoly.outer().push_back(pt); } for (size_t i = 1; i < nfp.size(); ++i) { nfppoly.inners().push_back({}); for (const auto& pt : nfp[i]) { nfppoly.inners().back().push_back(pt); } } std::ofstream svg(filename.c_str()); boost::geometry::svg_mapper mapper(svg, 100, 100, "width=\"200mm\" height=\"200mm\" viewBox=\"-250 -250 500 500\""); for (auto p : polygons) { auto pf = convert(p); mapper.add(pf); mapper.map(pf, "fill-opacity:0.5;fill:rgb(153,204,0);stroke:rgb(153,204,0);stroke-width:2"); } bg::correct(nfppoly); auto nfpf = convert(nfppoly); mapper.add(nfpf); mapper.map(nfpf, "fill-opacity:0.5;fill:rgb(204,153,0);stroke:rgb(204,153,0);stroke-width:2"); for(auto& r: nfpf.inners()) { if(r.size() == 1) { mapper.add(r.front()); mapper.map(r.front(), "fill-opacity:0.5;fill:rgb(204,153,0);stroke:rgb(204,153,0);stroke-width:2"); } else if(r.size() == 2) { segmentf_t seg(r.front(), *(r.begin()+1)); mapper.add(seg); mapper.map(seg, "fill-opacity:0.5;fill:rgb(204,153,0);stroke:rgb(204,153,0);stroke-width:2"); } } } std::ostream& operator<<(std::ostream& os, const segment_t& seg) { os << "{" << seg.first << "," << seg.second << "}"; return os; } bool operator<(const segment_t& lhs, const segment_t& rhs) { return lhs.first < rhs.first || ((lhs.first == rhs.first) && (lhs.second < rhs.second)); } bool operator==(const segment_t& lhs, const segment_t& rhs) { return (lhs.first == rhs.first && lhs.second == rhs.second) || (lhs.first == rhs.second && lhs.second == rhs.first); } bool operator!=(const segment_t& lhs, const segment_t& rhs) { return !operator==(lhs,rhs); } enum Alignment { LEFT, RIGHT, ON }; point_t normalize(const point_t& pt) { point_t norm = pt; coord_t len = bg::length(segment_t{{0,0},pt}); if(len == 0.0L) return {0,0}; norm.x_ /= len; norm.y_ /= len; return norm; } Alignment get_alignment(const segment_t& seg, const point_t& pt){ coord_t res = ((seg.second.x_ - seg.first.x_)*(pt.y_ - seg.first.y_) - (seg.second.y_ - seg.first.y_)*(pt.x_ - seg.first.x_)); if(equals(res, 0)) { return ON; } else if(larger(res,0)) { return LEFT; } else { return RIGHT; } } long double get_inner_angle(const point_t& joint, const point_t& end1, const point_t& end2) { coord_t dx21 = end1.x_-joint.x_; coord_t dx31 = end2.x_-joint.x_; coord_t dy21 = end1.y_-joint.y_; coord_t dy31 = end2.y_-joint.y_; coord_t m12 = sqrt((dx21*dx21 + dy21*dy21)); coord_t m13 = sqrt((dx31*dx31 + dy31*dy31)); if(m12 == 0.0L || m13 == 0.0L) return 0; return acos( (dx21*dx31 + dy21*dy31) / (m12 * m13) ); } struct TouchingPoint { enum Type { VERTEX, A_ON_B, B_ON_A }; Type type_; psize_t A_; psize_t B_; }; struct TranslationVector { point_t vector_; segment_t edge_; bool fromA_; string name_; bool operator<(const TranslationVector& other) const { return this->vector_ < other.vector_ || ((this->vector_ == other.vector_) && (this->edge_ < other.edge_)); } }; std::ostream& operator<<(std::ostream& os, const TranslationVector& tv) { os << "{" << tv.edge_ << " -> " << tv.vector_ << "} = " << tv.name_; return os; } void read_wkt_polygon(const string& filename, polygon_t& p) { std::ifstream t(filename); std::string str; t.seekg(0, std::ios::end); str.reserve(t.tellg()); t.seekg(0, std::ios::beg); str.assign((std::istreambuf_iterator(t)), std::istreambuf_iterator()); str.pop_back(); bg::read_wkt(str, p); bg::correct(p); } std::vector find_minimum_y(const polygon_t& p) { std::vector result; coord_t min = MAX_COORD; auto& po = p.outer(); for(psize_t i = 0; i < p.outer().size() - 1; ++i) { if(smaller(po[i].y_, min)) { result.clear(); min = po[i].y_; result.push_back(i); } else if (equals(po[i].y_, min)) { result.push_back(i); } } return result; } std::vector find_maximum_y(const polygon_t& p) { std::vector result; coord_t max = MIN_COORD; auto& po = p.outer(); for(psize_t i = 0; i < p.outer().size() - 1; ++i) { if(larger(po[i].y_, max)) { result.clear(); max = po[i].y_; result.push_back(i); } else if (equals(po[i].y_, max)) { result.push_back(i); } } return result; } psize_t find_point(const polygon_t::ring_type& ring, const point_t& pt) { for(psize_t i = 0; i < ring.size(); ++i) { if(ring[i] == pt) return i; } return std::numeric_limits::max(); } std::vector findTouchingPoints(const polygon_t::ring_type& ringA, const polygon_t::ring_type& ringB) { std::vector touchers; for(psize_t i = 0; i < ringA.size() - 1; i++) { psize_t nextI = i+1; for(psize_t j = 0; j < ringB.size() - 1; j++) { psize_t nextJ = j+1; if(ringA[i] == ringB[j]) { touchers.push_back({TouchingPoint::VERTEX, i, j}); } else if (ringA[nextI] != ringB[j] && bg::intersects(segment_t(ringA[i],ringA[nextI]), ringB[j])) { touchers.push_back({TouchingPoint::B_ON_A, nextI, j}); } else if (ringB[nextJ] != ringA[i] && bg::intersects(segment_t(ringB[j],ringB[nextJ]), ringA[i])) { touchers.push_back({TouchingPoint::A_ON_B, i, nextJ}); } } } return touchers; } //TODO deduplicate code TranslationVector trimVector(const polygon_t::ring_type& rA, const polygon_t::ring_type& rB, const TranslationVector& tv) { coord_t shortest = bg::length(tv.edge_); TranslationVector trimmed = tv; for(const auto& ptA : rA) { point_t translated; //for polygon A we invert the translation trans::translate_transformer translate(-tv.vector_.x_, -tv.vector_.y_); boost::geometry::transform(ptA, translated, translate); linestring_t projection; segment_t segproj(ptA, translated); projection.push_back(ptA); projection.push_back(translated); std::vector intersections; bg::intersection(rB, projection, intersections); if(bg::touches(projection, rB) && intersections.size() < 2) { continue; } //find shortest intersection coord_t len; segment_t segi; for(const auto& pti : intersections) { segi = segment_t(ptA,pti); len = bg::length(segi); if(smaller(len, shortest)) { trimmed.vector_ = ptA - pti; trimmed.edge_ = segi; shortest = len; } } } for(const auto& ptB : rB) { point_t translated; trans::translate_transformer translate(tv.vector_.x_, tv.vector_.y_); boost::geometry::transform(ptB, translated, translate); linestring_t projection; segment_t segproj(ptB, translated); projection.push_back(ptB); projection.push_back(translated); std::vector intersections; bg::intersection(rA, projection, intersections); if(bg::touches(projection, rA) && intersections.size() < 2) { continue; } //find shortest intersection coord_t len; segment_t segi; for(const auto& pti : intersections) { segi = segment_t(ptB,pti); len = bg::length(segi); if(smaller(len, shortest)) { trimmed.vector_ = pti - ptB; trimmed.edge_ = segi; shortest = len; } } } return trimmed; } std::vector findFeasibleTranslationVectors(polygon_t::ring_type& ringA, polygon_t::ring_type& ringB, const std::vector& touchers) { //use a set to automatically filter duplicate vectors std::vector potentialVectors; std::vector> touchEdges; for (psize_t i = 0; i < touchers.size(); i++) { point_t& vertexA = ringA[touchers[i].A_]; vertexA.marked_ = true; // adjacent A vertices auto prevAindex = static_cast(touchers[i].A_ - 1); auto nextAindex = static_cast(touchers[i].A_ + 1); prevAindex = (prevAindex < 0) ? static_cast(ringA.size() - 2) : prevAindex; // loop nextAindex = (static_cast(nextAindex) >= ringA.size()) ? 1 : nextAindex; // loop point_t& prevA = ringA[prevAindex]; point_t& nextA = ringA[nextAindex]; // adjacent B vertices point_t& vertexB = ringB[touchers[i].B_]; auto prevBindex = static_cast(touchers[i].B_ - 1); auto nextBindex = static_cast(touchers[i].B_ + 1); prevBindex = (prevBindex < 0) ? static_cast(ringB.size() - 2) : prevBindex; // loop nextBindex = (static_cast(nextBindex) >= ringB.size()) ? 1 : nextBindex; // loop point_t& prevB = ringB[prevBindex]; point_t& nextB = ringB[nextBindex]; if (touchers[i].type_ == TouchingPoint::VERTEX) { segment_t a1 = { vertexA, nextA }; segment_t a2 = { vertexA, prevA }; segment_t b1 = { vertexB, nextB }; segment_t b2 = { vertexB, prevB }; //swap the segment elements so that always the first point is the touching point //also make the second segment always a segment of ringB touchEdges.push_back({a1, b1}); touchEdges.push_back({a1, b2}); touchEdges.push_back({a2, b1}); touchEdges.push_back({a2, b2}); #ifdef NFP_DEBUG write_svg("touchersV" + std::to_string(i) + ".svg", {a1,a2,b1,b2}); #endif //TODO test parallel edges for floating point stability Alignment al; //a1 and b1 meet at start vertex al = get_alignment(a1, b1.second); if(al == LEFT) { potentialVectors.push_back({b1.first - b1.second, b1, false, "vertex1"}); } else if(al == RIGHT) { potentialVectors.push_back({a1.second - a1.first, a1, true, "vertex2"}); } else { potentialVectors.push_back({a1.second - a1.first, a1, true, "vertex3"}); } //a1 and b2 meet at start and end al = get_alignment(a1, b2.second); if(al == LEFT) { //no feasible translation } else if(al == RIGHT) { potentialVectors.push_back({a1.second - a1.first, a1, true, "vertex4"}); } else { potentialVectors.push_back({a1.second - a1.first, a1, true, "vertex5"}); } //a2 and b1 meet at end and start al = get_alignment(a2, b1.second); if(al == LEFT) { //no feasible translation } else if(al == RIGHT) { potentialVectors.push_back({b1.first - b1.second, b1, false, "vertex6"}); } else { potentialVectors.push_back({b1.first - b1.second, b1, false, "vertex7"}); } } else if (touchers[i].type_ == TouchingPoint::B_ON_A) { segment_t a1 = {vertexB, vertexA}; segment_t a2 = {vertexB, prevA}; segment_t b1 = {vertexB, prevB}; segment_t b2 = {vertexB, nextB}; touchEdges.push_back({a1, b1}); touchEdges.push_back({a1, b2}); touchEdges.push_back({a2, b1}); touchEdges.push_back({a2, b2}); #ifdef NFP_DEBUG write_svg("touchersB" + std::to_string(i) + ".svg", {a1,a2,b1,b2}); #endif potentialVectors.push_back({vertexA - vertexB, {vertexB, vertexA}, true, "bona"}); } else if (touchers[i].type_ == TouchingPoint::A_ON_B) { //TODO testme segment_t a1 = {vertexA, prevA}; segment_t a2 = {vertexA, nextA}; segment_t b1 = {vertexA, vertexB}; segment_t b2 = {vertexA, prevB}; #ifdef NFP_DEBUG write_svg("touchersA" + std::to_string(i) + ".svg", {a1,a2,b1,b2}); #endif touchEdges.push_back({a1, b1}); touchEdges.push_back({a2, b1}); touchEdges.push_back({a1, b2}); touchEdges.push_back({a2, b2}); potentialVectors.push_back({vertexA - vertexB, {vertexA, vertexB}, false, "aonb"}); } } //discard immediately intersecting translations std::vector vectors; for(const auto& v : potentialVectors) { bool discarded = false; for(const auto& sp : touchEdges) { point_t normEdge = normalize(v.edge_.second - v.edge_.first); point_t normFirst = normalize(sp.first.second - sp.first.first); point_t normSecond = normalize(sp.second.second - sp.second.first); Alignment a1 = get_alignment({{0,0},normEdge}, normFirst); Alignment a2 = get_alignment({{0,0},normEdge}, normSecond); if(a1 == a2 && a1 != ON) { long double df = get_inner_angle({0,0},normEdge, normFirst); long double ds = get_inner_angle({0,0},normEdge, normSecond); point_t normIn = normalize(v.edge_.second - v.edge_.first); if (equals(df, ds)) { TranslationVector trimmed = trimVector(ringA,ringB, v); polygon_t::ring_type translated; trans::translate_transformer translate(trimmed.vector_.x_, trimmed.vector_.y_); boost::geometry::transform(ringB, translated, translate); if (!(bg::intersects(translated, ringA) && !bg::overlaps(translated, ringA) && !bg::covered_by(translated, ringA) && !bg::covered_by(ringA, translated))) { discarded = true; break; } } else { if (normIn == normalize(v.vector_)) { if (larger(ds, df)) { discarded = true; break; } } else { if (smaller(ds, df)) { discarded = true; break; } } } } } if(!discarded) vectors.push_back(v); } return vectors; } bool find(const std::vector& h, const TranslationVector& tv) { for(const auto& htv : h) { if(htv.vector_ == tv.vector_) return true; } return false; } TranslationVector getLongest(const std::vector& tvs) { coord_t len; coord_t maxLen = MIN_COORD; TranslationVector longest; longest.vector_ = INVALID_POINT; for(auto& tv : tvs) { len = bg::length(segment_t{{0,0},tv.vector_}); if(larger(len, maxLen)) { maxLen = len; longest = tv; } } return longest; } TranslationVector selectNextTranslationVector(const polygon_t& pA, const polygon_t::ring_type& rA, const polygon_t::ring_type& rB, const std::vector& tvs, const std::vector& history) { if(!history.empty()) { TranslationVector last = history.back(); std::vector historyCopy = history; if(historyCopy.size() >= 2) { historyCopy.erase(historyCopy.end() - 1); historyCopy.erase(historyCopy.end() - 1); if(historyCopy.size() > 4) { historyCopy.erase(historyCopy.begin(), historyCopy.end() - 4); } } else { historyCopy.clear(); } DEBUG_MSG("last", last); psize_t laterI = std::numeric_limits::max(); point_t previous = rA[0]; point_t next; if(last.fromA_) { for (psize_t i = 1; i < rA.size() + 1; ++i) { if (i >= rA.size()) next = rA[i % rA.size()]; else next = rA[i]; segment_t candidate( previous, next ); if(candidate == last.edge_) { laterI = i; break; } previous = next; } if (laterI == std::numeric_limits::max()) { point_t later; if (last.vector_ == (last.edge_.second - last.edge_.first)) { later = last.edge_.second; } else { later = last.edge_.first; } laterI = find_point(rA, later); } } else { point_t later; if (last.vector_ == (last.edge_.second - last.edge_.first)) { later = last.edge_.second; } else { later = last.edge_.first; } laterI = find_point(rA, later); } if (laterI == std::numeric_limits::max()) { throw std::runtime_error( "Internal error: Can't find later point of last edge"); } std::vector viableEdges; previous = rA[laterI]; for(psize_t i = laterI + 1; i < rA.size() + laterI + 1; ++i) { if(i >= rA.size()) next = rA[i % rA.size()]; else next = rA[i]; viableEdges.push_back({previous, next}); previous = next; } // auto rng = std::default_random_engine {}; // std::shuffle(std::begin(viableEdges), std::end(viableEdges), rng); //search with consulting the history to prevent oscillation std::vector viableTrans; for(const auto& ve: viableEdges) { for(const auto& tv : tvs) { if((tv.fromA_ && (normalize(tv.vector_) == normalize(ve.second - ve.first))) && (tv.edge_ != last.edge_ || tv.vector_.x_ != -last.vector_.x_ || tv.vector_.y_ != -last.vector_.y_) && !find(historyCopy, tv)) { viableTrans.push_back(tv); } } for (const auto& tv : tvs) { if (!tv.fromA_) { point_t later; if (tv.vector_ == (tv.edge_.second - tv.edge_.first) && (tv.edge_ != last.edge_ || tv.vector_.x_ != -last.vector_.x_ || tv.vector_.y_ != -last.vector_.y_) && !find(historyCopy, tv)) { later = tv.edge_.second; } else if (tv.vector_ == (tv.edge_.first - tv.edge_.second)) { later = tv.edge_.first; } else continue; if (later == ve.first || later == ve.second) { viableTrans.push_back(tv); } } } } if(!viableTrans.empty()) return getLongest(viableTrans); //search again without the history for(const auto& ve: viableEdges) { for(const auto& tv : tvs) { if((tv.fromA_ && (normalize(tv.vector_) == normalize(ve.second - ve.first))) && (tv.edge_ != last.edge_ || tv.vector_.x_ != -last.vector_.x_ || tv.vector_.y_ != -last.vector_.y_)) { viableTrans.push_back(tv); } } for (const auto& tv : tvs) { if (!tv.fromA_) { point_t later; if (tv.vector_ == (tv.edge_.second - tv.edge_.first) && (tv.edge_ != last.edge_ || tv.vector_.x_ != -last.vector_.x_ || tv.vector_.y_ != -last.vector_.y_)) { later = tv.edge_.second; } else if (tv.vector_ == (tv.edge_.first - tv.edge_.second)) { later = tv.edge_.first; } else continue; if (later == ve.first || later == ve.second) { viableTrans.push_back(tv); } } } } if(!viableTrans.empty()) return getLongest(viableTrans); /* //search again without the history and without checking last edge for(const auto& ve: viableEdges) { for(const auto& tv : tvs) { if((tv.fromA_ && (normalize(tv.vector_) == normalize(ve.second - ve.first)))) { return tv; } } for (const auto& tv : tvs) { if (!tv.fromA_) { point_t later; if (tv.vector_ == (tv.edge_.second - tv.edge_.first)) { later = tv.edge_.second; } else if (tv.vector_ == (tv.edge_.first - tv.edge_.second)) { later = tv.edge_.first; } else continue; if (later == ve.first || later == ve.second) { return tv; } } } }*/ if(tvs.size() == 1) return *tvs.begin(); TranslationVector tv; tv.vector_ = INVALID_POINT; return tv; } else { return getLongest(tvs); } } bool inNfp(const point_t& pt, const nfp_t& nfp) { for(const auto& r : nfp) { if(bg::touches(pt, r)) return true; } return false; } enum SearchStartResult { FIT, FOUND, NOT_FOUND }; SearchStartResult searchStartTranslation(polygon_t::ring_type& rA, const polygon_t::ring_type& rB, const nfp_t& nfp,const bool& inside, point_t& result) { for(psize_t i = 0; i < rA.size() - 1; i++) { psize_t index; if (i >= rA.size()) index = i % rA.size() + 1; else index = i; auto& ptA = rA[index]; if(ptA.marked_) continue; ptA.marked_ = true; for(const auto& ptB: rB) { point_t testTranslation = ptA - ptB; polygon_t::ring_type translated; boost::geometry::transform(rB, translated, trans::translate_transformer(testTranslation.x_, testTranslation.y_)); //check if the translated rB is identical to rA bool identical = false; for(const auto& ptT: translated) { identical = false; for(const auto& ptA: rA) { if(ptT == ptA) { identical = true; break; } } if(!identical) break; } if(identical) { result = testTranslation; return FIT; } bool bInside = false; for(const auto& ptT: translated) { if(bg::within(ptT, rA)) { bInside = true; break; } else if(!bg::touches(ptT, rA)) { bInside = false; break; } } if(((bInside && inside) || (!bInside && !inside)) && (!bg::overlaps(translated, rA) && !bg::covered_by(translated, rA) && !bg::covered_by(rA, translated)) && !inNfp(translated.front(), nfp)){ result = testTranslation; return FOUND; } point_t nextPtA = rA[index + 1]; TranslationVector slideVector; slideVector.vector_ = nextPtA - ptA; slideVector.edge_ = {ptA, nextPtA}; slideVector.fromA_ = true; TranslationVector trimmed = trimVector(rA, translated, slideVector); polygon_t::ring_type translated2; trans::translate_transformer trans(trimmed.vector_.x_, trimmed.vector_.y_); boost::geometry::transform(translated, translated2, trans); //check if the translated rB is identical to rA identical = false; for(const auto& ptT: translated) { identical = false; for(const auto& ptA: rA) { if(ptT == ptA) { identical = true; break; } } if(!identical) break; } if(identical) { result = trimmed.vector_ + testTranslation; return FIT; } bInside = false; for(const auto& ptT: translated2) { if(bg::within(ptT, rA)) { bInside = true; break; } else if(!bg::touches(ptT, rA)) { bInside = false; break; } } if(((bInside && inside) || (!bInside && !inside)) && (!bg::overlaps(translated2, rA) && !bg::covered_by(translated2, rA) && !bg::covered_by(rA, translated2)) && !inNfp(translated2.front(), nfp)){ result = trimmed.vector_ + testTranslation; return FOUND; } } } return NOT_FOUND; } enum SlideResult { LOOP, NO_LOOP, NO_TRANSLATION }; SlideResult slide(polygon_t& pA, polygon_t::ring_type& rA, polygon_t::ring_type& rB, nfp_t& nfp, const point_t& transB, bool inside) { polygon_t::ring_type rifsB; boost::geometry::transform(rB, rifsB, trans::translate_transformer(transB.x_, transB.y_)); rB = std::move(rifsB); #ifdef NFP_DEBUG write_svg("ifs.svg", pA, rB); #endif bool startAvailable = true; psize_t cnt = 0; point_t referenceStart = rB.front(); std::vector history; //generate the nfp for the ring while(startAvailable) { DEBUG_VAL(cnt); //use first point of rB as reference nfp.back().push_back(rB.front()); if(cnt == 15) std::cerr << ""; std::vector touchers = findTouchingPoints(rA, rB); #ifdef NFP_DEBUG DEBUG_MSG("touchers", touchers.size()); for(auto t : touchers) { DEBUG_VAL(t.type_); } #endif if(touchers.empty()) { throw std::runtime_error("Internal error: No touching points found"); } std::vector transVectors = findFeasibleTranslationVectors(rA, rB, touchers); #ifdef NFP_DEBUG DEBUG_MSG("collected vectors", transVectors.size()); for(auto pt : transVectors) { DEBUG_VAL(pt); } #endif if(transVectors.empty()) { return NO_LOOP; } TranslationVector next = selectNextTranslationVector(pA, rA, rB, transVectors, history); if(next.vector_ == INVALID_POINT) return NO_TRANSLATION; DEBUG_MSG("next", next); TranslationVector trimmed = trimVector(rA, rB, next); DEBUG_MSG("trimmed", trimmed); history.push_back(next); polygon_t::ring_type nextRB; boost::geometry::transform(rB, nextRB, trans::translate_transformer(trimmed.vector_.x_, trimmed.vector_.y_)); rB = std::move(nextRB); #ifdef NFP_DEBUG write_svg("next" + std::to_string(cnt) + ".svg", pA,rB); #endif ++cnt; if(referenceStart == rB.front() || (inside && bg::touches(rB.front(), nfp.front()))) { startAvailable = false; } } return LOOP; } void removeCoLinear(polygon_t::ring_type& r) { assert(r.size() > 2); psize_t nextI; psize_t prevI = 0; segment_t segment(r[r.size() - 2], r[0]); polygon_t::ring_type newR; for (psize_t i = 1; i < r.size() + 1; ++i) { if (i >= r.size()) nextI = i % r.size() + 1; else nextI = i; if (get_alignment(segment, r[nextI]) != ON) { newR.push_back(r[prevI]); } segment = {segment.second, r[nextI]}; prevI = nextI; } r = newR; } void removeCoLinear(polygon_t& p) { removeCoLinear(p.outer()); for (auto& r : p.inners()) removeCoLinear(r); } nfp_t generateNFP(polygon_t& pA, polygon_t& pB, const bool checkValidity = true) { removeCoLinear(pA); removeCoLinear(pB); if(checkValidity) { std::string reason; if(!bg::is_valid(pA, reason)) throw std::runtime_error("Polygon A is invalid: " + reason); if(!bg::is_valid(pB, reason)) throw std::runtime_error("Polygon B is invalid: " + reason); } nfp_t nfp; #ifdef NFP_DEBUG write_svg("start.svg", {pA, pB}); #endif DEBUG_VAL(bg::wkt(pA)) DEBUG_VAL(bg::wkt(pB)); //prevent double vertex connections at start because we might come back the same way we go which would end the nfp prematurely std::vector ptyaminI = find_minimum_y(pA); std::vector ptybmaxI = find_maximum_y(pB); point_t pAstart; point_t pBstart; if(ptyaminI.size() > 1 || ptybmaxI.size() > 1) { //find right-most of A and left-most of B to prevent double connection at start coord_t maxX = MIN_COORD; psize_t iRightMost = 0; for(psize_t& ia : ptyaminI) { const point_t& candidateA = pA.outer()[ia]; if(larger(candidateA.x_, maxX)) { maxX = candidateA.x_; iRightMost = ia; } } coord_t minX = MAX_COORD; psize_t iLeftMost = 0; for(psize_t& ib : ptybmaxI) { const point_t& candidateB = pB.outer()[ib]; if(smaller(candidateB.x_, minX)) { minX = candidateB.x_; iLeftMost = ib; } } pAstart = pA.outer()[iRightMost]; pBstart = pB.outer()[iLeftMost]; } else { pAstart = pA.outer()[ptyaminI.front()]; pBstart = pB.outer()[ptybmaxI.front()]; } nfp.push_back({}); point_t transB = {pAstart - pBstart}; if(slide(pA, pA.outer(), pB.outer(), nfp, transB, false) != LOOP) { throw std::runtime_error("Unable to complete outer nfp loop"); } DEBUG_VAL("##### outer #####"); point_t startTrans; while(true) { SearchStartResult res = searchStartTranslation(pA.outer(), pB.outer(), nfp, false, startTrans); if(res == FOUND) { nfp.push_back({}); DEBUG_VAL("##### interlock start #####") polygon_t::ring_type rifsB; boost::geometry::transform(pB.outer(), rifsB, trans::translate_transformer(startTrans.x_, startTrans.y_)); if(inNfp(rifsB.front(), nfp)) { continue; } SlideResult sres = slide(pA, pA.outer(), pB.outer(), nfp, startTrans, true); if(sres != LOOP) { if(sres == NO_TRANSLATION) { //no initial slide found -> jiggsaw if(!inNfp(pB.outer().front(),nfp)) { nfp.push_back({}); nfp.back().push_back(pB.outer().front()); } } } DEBUG_VAL("##### interlock end #####"); } else if(res == FIT) { point_t reference = pB.outer().front(); point_t translated; trans::translate_transformer translate(startTrans.x_, startTrans.y_); boost::geometry::transform(reference, translated, translate); if(!inNfp(translated,nfp)) { nfp.push_back({}); nfp.back().push_back(translated); } break; } else break; } for(auto& rA : pA.inners()) { while(true) { SearchStartResult res = searchStartTranslation(rA, pB.outer(), nfp, true, startTrans); if(res == FOUND) { nfp.push_back({}); DEBUG_VAL("##### hole start #####"); slide(pA, rA, pB.outer(), nfp, startTrans, true); DEBUG_VAL("##### hole end #####"); } else if(res == FIT) { point_t reference = pB.outer().front(); point_t translated; trans::translate_transformer translate(startTrans.x_, startTrans.y_); boost::geometry::transform(reference, translated, translate); if(!inNfp(translated,nfp)) { nfp.push_back({}); nfp.back().push_back(translated); } break; } else break; } } #ifdef NFP_DEBUG write_svg("nfp.svg", {pA,pB}, nfp); #endif return nfp; } } #endif libnest2d-5.0.0/tools/nfp_svgnest.hpp000066400000000000000000001063601422601530300176110ustar00rootroot00000000000000#ifndef NFP_SVGNEST_HPP #define NFP_SVGNEST_HPP #include #include #include namespace libnest2d { namespace __svgnest { using std::sqrt; using std::min; using std::max; using std::abs; using std::isnan; //template struct _Scale { // static const BP2D_CONSTEXPR long long Value = 1000000; //}; template struct _alg { using Contour = TContour; using Point = TPoint; using iCoord = TCoord; using Coord = double; using Shapes = nfp::Shapes; static const Coord TOL; #define dNAN std::nan("") struct Vector { Coord x = 0.0, y = 0.0; bool marked = false; Vector() = default; Vector(Coord X, Coord Y): x(X), y(Y) {} Vector(const Point& p): x(Coord(getX(p))), y(Coord(getY(p))) {} operator Point() const { return {iCoord(x), iCoord(y)}; } Vector& operator=(const Point& p) { x = getX(p), y = getY(p); return *this; } bool operator!=(const Vector& v) const { return v.x != x || v.y != y; } Vector(std::initializer_list il): x(*il.begin()), y(*std::next(il.begin())) {} }; static inline Coord x(const Point& p) { return Coord(getX(p)); } static inline Coord y(const Point& p) { return Coord(getY(p)); } static inline Coord x(const Vector& p) { return p.x; } static inline Coord y(const Vector& p) { return p.y; } class Cntr { std::vector v_; public: Cntr(const Contour& c) { v_.reserve(c.size()); std::transform(c.begin(), c.end(), std::back_inserter(v_), [](const Point& p) { return Vector(double(x(p)) / 1e3, double(y(p)) / 1e3); }); std::reverse(v_.begin(), v_.end()); v_.pop_back(); } Cntr() = default; Coord offsetx = 0; Coord offsety = 0; size_t size() const { return v_.size(); } bool empty() const { return v_.empty(); } typename std::vector::const_iterator cbegin() const { return v_.cbegin(); } typename std::vector::const_iterator cend() const { return v_.cend(); } typename std::vector::iterator begin() { return v_.begin(); } typename std::vector::iterator end() { return v_.end(); } Vector& operator[](size_t idx) { return v_[idx]; } const Vector& operator[](size_t idx) const { return v_[idx]; } template void emplace_back(Args&&...args) { v_.emplace_back(std::forward(args)...); } template void push(Args&&...args) { v_.emplace_back(std::forward(args)...); } void clear() { v_.clear(); } operator Contour() const { Contour cnt; cnt.reserve(v_.size() + 1); std::transform(v_.begin(), v_.end(), std::back_inserter(cnt), [](const Vector& vertex) { return Point(iCoord(vertex.x) * 1000, iCoord(vertex.y) * 1000); }); auto bb = shapelike::boundingBox(cnt); struct P { iCoord x_, y_; iCoord x() const { return x_; } iCoord y() const { return y_; } }; P center = {getX(bb.center()), getY(bb.center()) }; std::sort(cnt.begin(), cnt.end(), [center](const Point& pa, const Point& pb) { P a, b; a = { getX(pa), getY(pa) }; b = { getX(pb), getY(pb) }; // Computes the quadrant for a and b (0-3): // ^ // 1 | 0 // ---+--> // 2 | 3 const int dax = ((a.x() - center.x()) > 0) ? 1 : 0; const int day = ((a.y() - center.y()) > 0) ? 1 : 0; const int qa = (1 - dax) + (1 - day) + ((dax & (1 - day)) << 1); /* The previous computes the following: const int qa = ( (a.x() > center.x()) ? ((a.y() > center.y()) ? 0 : 3) : ((a.y() > center.y()) ? 1 : 2)); */ const int dbx = ((b.x() - center.x()) > 0) ? 1 : 0; const int dby = ((b.y() - center.y()) > 0) ? 1 : 0; const int qb = (1 - dbx) + (1 - dby) + ((dbx & (1 - dby)) << 1); if (qa == qb) { return (b.x() - center.x()) * (a.y() - center.y()) > (b.y() - center.y()) * (a.x() - center.x()); } else { return qa > qb; } return false; }); auto closer = cnt.front(); cnt.emplace_back(closer); return cnt; } }; inline static bool _almostEqual(Coord a, Coord b, Coord tolerance = TOL) { return std::abs(a - b) < tolerance; } // returns true if p lies on the line segment defined by AB, // but not at any endpoints may need work! static bool _onSegment(const Vector& A, const Vector& B, const Vector& p) { // vertical line if(_almostEqual(A.x, B.x) && _almostEqual(p.x, A.x)) { if(!_almostEqual(p.y, B.y) && !_almostEqual(p.y, A.y) && p.y < max(B.y, A.y) && p.y > min(B.y, A.y)){ return true; } else{ return false; } } // horizontal line if(_almostEqual(A.y, B.y) && _almostEqual(p.y, A.y)){ if(!_almostEqual(p.x, B.x) && !_almostEqual(p.x, A.x) && p.x < max(B.x, A.x) && p.x > min(B.x, A.x)){ return true; } else{ return false; } } //range check if((p.x < A.x && p.x < B.x) || (p.x > A.x && p.x > B.x) || (p.y < A.y && p.y < B.y) || (p.y > A.y && p.y > B.y)) return false; // exclude end points if((_almostEqual(p.x, A.x) && _almostEqual(p.y, A.y)) || (_almostEqual(p.x, B.x) && _almostEqual(p.y, B.y))) return false; double cross = (p.y - A.y) * (B.x - A.x) - (p.x - A.x) * (B.y - A.y); if(abs(cross) > TOL) return false; double dot = (p.x - A.x) * (B.x - A.x) + (p.y - A.y)*(B.y - A.y); if(dot < 0 || _almostEqual(dot, 0)) return false; double len2 = (B.x - A.x)*(B.x - A.x) + (B.y - A.y)*(B.y - A.y); if(dot > len2 || _almostEqual(dot, len2)) return false; return true; } // return true if point is in the polygon, false if outside, and null if exactly on a point or edge static int pointInPolygon(const Vector& point, const Cntr& polygon) { if(polygon.size() < 3){ return 0; } bool inside = false; Coord offsetx = polygon.offsetx; Coord offsety = polygon.offsety; for (size_t i = 0, j = polygon.size() - 1; i < polygon.size(); j=i++) { auto xi = polygon[i].x + offsetx; auto yi = polygon[i].y + offsety; auto xj = polygon[j].x + offsetx; auto yj = polygon[j].y + offsety; if(_almostEqual(xi, point.x) && _almostEqual(yi, point.y)){ return 0; // no result } if(_onSegment({xi, yi}, {xj, yj}, point)){ return 0; // exactly on the segment } if(_almostEqual(xi, xj) && _almostEqual(yi, yj)){ // ignore very small lines continue; } bool intersect = ((yi > point.y) != (yj > point.y)) && (point.x < (xj - xi) * (point.y - yi) / (yj - yi) + xi); if (intersect) inside = !inside; } return inside? 1 : -1; } static bool intersect(const Cntr& A, const Cntr& B){ Contour a = A, b = B; return shapelike::intersects(shapelike::create(a), shapelike::create(b)); } static Vector _normalizeVector(const Vector& v) { if(_almostEqual(v.x*v.x + v.y*v.y, Coord(1))){ return Point(v); // given vector was already a unit vector } auto len = sqrt(v.x*v.x + v.y*v.y); auto inverse = 1/len; return { Coord(v.x*inverse), Coord(v.y*inverse) }; } static double pointDistance( const Vector& p, const Vector& s1, const Vector& s2, Vector normal, bool infinite = false) { normal = _normalizeVector(normal); Vector dir = { normal.y, -normal.x }; auto pdot = p.x*dir.x + p.y*dir.y; auto s1dot = s1.x*dir.x + s1.y*dir.y; auto s2dot = s2.x*dir.x + s2.y*dir.y; auto pdotnorm = p.x*normal.x + p.y*normal.y; auto s1dotnorm = s1.x*normal.x + s1.y*normal.y; auto s2dotnorm = s2.x*normal.x + s2.y*normal.y; if(!infinite){ if (((pdots1dot || _almostEqual(pdot, s1dot)) && (pdot>s2dot || _almostEqual(pdot, s2dot)))) { // dot doesn't collide with segment, // or lies directly on the vertex return dNAN; } if ((_almostEqual(pdot, s1dot) && _almostEqual(pdot, s2dot)) && (pdotnorm>s1dotnorm && pdotnorm>s2dotnorm)) { return min(pdotnorm - s1dotnorm, pdotnorm - s2dotnorm); } if ((_almostEqual(pdot, s1dot) && _almostEqual(pdot, s2dot)) && (pdotnorm EFmax){ return dNAN; } double overlap = 0; if((ABmax > EFmax && ABmin < EFmin) || (EFmax > ABmax && EFmin < ABmin)) { overlap = 1; } else{ auto minMax = min(ABmax, EFmax); auto maxMin = max(ABmin, EFmin); auto maxMax = max(ABmax, EFmax); auto minMin = min(ABmin, EFmin); overlap = (minMax-maxMin)/(maxMax-minMin); } auto crossABE = (E.y - A.y) * (B.x - A.x) - (E.x - A.x) * (B.y - A.y); auto crossABF = (F.y - A.y) * (B.x - A.x) - (F.x - A.x) * (B.y - A.y); // lines are colinear if(_almostEqual(crossABE,0) && _almostEqual(crossABF,0)){ Vector ABnorm = {B.y-A.y, A.x-B.x}; Vector EFnorm = {F.y-E.y, E.x-F.x}; auto ABnormlength = sqrt(ABnorm.x*ABnorm.x + ABnorm.y*ABnorm.y); ABnorm.x /= ABnormlength; ABnorm.y /= ABnormlength; auto EFnormlength = sqrt(EFnorm.x*EFnorm.x + EFnorm.y*EFnorm.y); EFnorm.x /= EFnormlength; EFnorm.y /= EFnormlength; // segment normals must point in opposite directions if(abs(ABnorm.y * EFnorm.x - ABnorm.x * EFnorm.y) < TOL && ABnorm.y * EFnorm.y + ABnorm.x * EFnorm.x < 0){ // normal of AB segment must point in same direction as // given direction vector auto normdot = ABnorm.y * direction.y + ABnorm.x * direction.x; // the segments merely slide along eachother if(_almostEqual(normdot,0, TOL)){ return dNAN; } if(normdot < 0){ return 0.0; } } return dNAN; } std::vector distances; distances.reserve(10); // coincident points if(_almostEqual(dotA, dotE)){ distances.emplace_back(crossA-crossE); } else if(_almostEqual(dotA, dotF)){ distances.emplace_back(crossA-crossF); } else if(dotA > EFmin && dotA < EFmax){ auto d = pointDistance(A,E,F,reverse); if(!isnan(d) && _almostEqual(d, 0)) { // A currently touches EF, but AB is moving away from EF auto dB = pointDistance(B,E,F,reverse,true); if(dB < 0 || _almostEqual(dB*overlap,0)){ d = dNAN; } } if(!isnan(d)){ distances.emplace_back(d); } } if(_almostEqual(dotB, dotE)){ distances.emplace_back(crossB-crossE); } else if(_almostEqual(dotB, dotF)){ distances.emplace_back(crossB-crossF); } else if(dotB > EFmin && dotB < EFmax){ auto d = pointDistance(B,E,F,reverse); if(!isnan(d) && _almostEqual(d, 0)) { // crossA>crossB A currently touches EF, but AB is moving away from EF double dA = pointDistance(A,E,F,reverse,true); if(dA < 0 || _almostEqual(dA*overlap,0)){ d = dNAN; } } if(!isnan(d)){ distances.emplace_back(d); } } if(dotE > ABmin && dotE < ABmax){ auto d = pointDistance(E,A,B,direction); if(!isnan(d) && _almostEqual(d, 0)) { // crossF ABmin && dotF < ABmax){ auto d = pointDistance(F,A,B,direction); if(!isnan(d) && _almostEqual(d, 0)) { // && crossE 0 || _almostEqual(d, 0)){ distance = d; } } } } return distance; } static double polygonProjectionDistance(const Cntr& AA, const Cntr& BB, Vector direction) { Cntr A = AA; Cntr B = BB; auto Boffsetx = B.offsetx; auto Boffsety = B.offsety; auto Aoffsetx = A.offsetx; auto Aoffsety = A.offsety; // close the loop for polygons if(A[0] != A[A.size()-1]){ A.push(A[0]); } if(B[0] != B[B.size()-1]){ B.push(B[0]); } auto& edgeA = A; auto& edgeB = B; double distance = dNAN, d; // Vector p, s1, s2; for(size_t i = 0; i < edgeB.size(); i++) { // the shortest/most negative projection of B onto A double minprojection = dNAN; Vector minp; for(size_t j = 0; j < edgeA.size() - 1; j++){ Vector p = {x(edgeB[i]) + Boffsetx, y(edgeB[i]) + Boffsety }; Vector s1 = {x(edgeA[j]) + Aoffsetx, y(edgeA[j]) + Aoffsety }; Vector s2 = {x(edgeA[j+1]) + Aoffsetx, y(edgeA[j+1]) + Aoffsety }; if(abs((s2.y-s1.y) * direction.x - (s2.x-s1.x) * direction.y) < TOL) continue; // project point, ignore edge boundaries d = pointDistance(p, s1, s2, direction); if(!isnan(d) && (isnan(minprojection) || d < minprojection)) { minprojection = d; minp = p; } } if(!isnan(minprojection) && (isnan(distance) || minprojection > distance)){ distance = minprojection; } } return distance; } static std::pair searchStartPoint( const Cntr& AA, const Cntr& BB, bool inside, const std::vector& NFP = {}) { // clone arrays auto A = AA; auto B = BB; // // close the loop for polygons // if(A[0] != A[A.size()-1]){ // A.push(A[0]); // } // if(B[0] != B[B.size()-1]){ // B.push(B[0]); // } // returns true if point already exists in the given nfp auto inNfp = [](const Vector& p, const std::vector& nfp){ if(nfp.empty()){ return false; } for(size_t i=0; i < nfp.size(); i++){ for(size_t j = 0; j< nfp[i].size(); j++){ if(_almostEqual(p.x, nfp[i][j].x) && _almostEqual(p.y, nfp[i][j].y)){ return true; } } } return false; }; for(size_t i = 0; i < A.size() - 1; i++){ if(!A[i].marked) { A[i].marked = true; for(size_t j = 0; j < B.size(); j++){ B.offsetx = A[i].x - B[j].x; B.offsety = A[i].y - B[j].y; int Binside = 0; for(size_t k = 0; k < B.size(); k++){ int inpoly = pointInPolygon({B[k].x + B.offsetx, B[k].y + B.offsety}, A); if(inpoly != 0){ Binside = inpoly; break; } } if(Binside == 0){ // A and B are the same return {false, {}}; } auto startPoint = std::make_pair(true, Vector(B.offsetx, B.offsety)); if(((Binside && inside) || (!Binside && !inside)) && !intersect(A,B) && !inNfp(startPoint.second, NFP)){ return startPoint; } // slide B along vector auto vx = A[i+1].x - A[i].x; auto vy = A[i+1].y - A[i].y; double d1 = polygonProjectionDistance(A,B,{vx, vy}); double d2 = polygonProjectionDistance(B,A,{-vx, -vy}); double d = dNAN; // todo: clean this up if(isnan(d1) && isnan(d2)){ // nothin } else if(isnan(d1)){ d = d2; } else if(isnan(d2)){ d = d1; } else{ d = min(d1,d2); } // only slide until no longer negative // todo: clean this up if(!isnan(d) && !_almostEqual(d,0) && d > 0){ } else{ continue; } auto vd2 = vx*vx + vy*vy; if(d*d < vd2 && !_almostEqual(d*d, vd2)){ auto vd = sqrt(vx*vx + vy*vy); vx *= d/vd; vy *= d/vd; } B.offsetx += vx; B.offsety += vy; for(size_t k = 0; k < B.size(); k++){ int inpoly = pointInPolygon({B[k].x + B.offsetx, B[k].y + B.offsety}, A); if(inpoly != 0){ Binside = inpoly; break; } } startPoint = std::make_pair(true, Vector{B.offsetx, B.offsety}); if(((Binside && inside) || (!Binside && !inside)) && !intersect(A,B) && !inNfp(startPoint.second, NFP)){ return startPoint; } } } } return {false, Vector(0, 0)}; } static std::vector noFitPolygon(Cntr A, Cntr B, bool inside, bool searchEdges) { if(A.size() < 3 || B.size() < 3) { throw GeometryException(GeomErr::NFP); return {}; } A.offsetx = 0; A.offsety = 0; long i = 0, j = 0; auto minA = y(A[0]); long minAindex = 0; auto maxB = y(B[0]); long maxBindex = 0; for(i = 1; i < A.size(); i++){ A[i].marked = false; if(y(A[i]) < minA){ minA = y(A[i]); minAindex = i; } } for(i = 1; i < B.size(); i++){ B[i].marked = false; if(y(B[i]) > maxB){ maxB = y(B[i]); maxBindex = i; } } std::pair startpoint; if(!inside){ // shift B such that the bottom-most point of B is at the top-most // point of A. This guarantees an initial placement with no // intersections startpoint = { true, { x(A[minAindex]) - x(B[maxBindex]), y(A[minAindex]) - y(B[maxBindex]) } }; } else { // no reliable heuristic for inside startpoint = searchStartPoint(A, B, true); } std::vector NFPlist; struct Touch { int type; long A; long B; Touch(int t, long a, long b): type(t), A(a), B(b) {} }; while(startpoint.first) { B.offsetx = startpoint.second.x; B.offsety = startpoint.second.y; // maintain a list of touching points/edges std::vector touching; struct V { Coord x, y; Vector *start, *end; operator bool() { return start != nullptr && end != nullptr; } operator Vector() const { return {x, y}; } } prevvector = {0, 0, nullptr, nullptr}; Cntr NFP; NFP.emplace_back(x(B[0]) + B.offsetx, y(B[0]) + B.offsety); auto referencex = x(B[0]) + B.offsetx; auto referencey = y(B[0]) + B.offsety; auto startx = referencex; auto starty = referencey; unsigned counter = 0; // sanity check, prevent infinite loop while(counter < 10*(A.size() + B.size())){ touching.clear(); // find touching vertices/edges for(i = 0; i < A.size(); i++){ long nexti = (i == A.size() - 1) ? 0 : i + 1; for(j = 0; j < B.size(); j++){ long nextj = (j == B.size() - 1) ? 0 : j + 1; if( _almostEqual(A[i].x, B[j].x+B.offsetx) && _almostEqual(A[i].y, B[j].y+B.offsety)) { touching.emplace_back(0, i, j); } else if( _onSegment( A[i], A[nexti], { B[j].x+B.offsetx, B[j].y + B.offsety}) ) { touching.emplace_back(1, nexti, j); } else if( _onSegment( {B[j].x+B.offsetx, B[j].y + B.offsety}, {B[nextj].x+B.offsetx, B[nextj].y + B.offsety}, A[i]) ) { touching.emplace_back(2, i, nextj); } } } // generate translation vectors from touching vertices/edges std::vector vectors; for(i=0; i < touching.size(); i++){ auto& vertexA = A[touching[i].A]; vertexA.marked = true; // adjacent A vertices auto prevAindex = touching[i].A - 1; auto nextAindex = touching[i].A + 1; prevAindex = (prevAindex < 0) ? A.size() - 1 : prevAindex; // loop nextAindex = (nextAindex >= A.size()) ? 0 : nextAindex; // loop auto& prevA = A[prevAindex]; auto& nextA = A[nextAindex]; // adjacent B vertices auto& vertexB = B[touching[i].B]; auto prevBindex = touching[i].B-1; auto nextBindex = touching[i].B+1; prevBindex = (prevBindex < 0) ? B.size() - 1 : prevBindex; // loop nextBindex = (nextBindex >= B.size()) ? 0 : nextBindex; // loop auto& prevB = B[prevBindex]; auto& nextB = B[nextBindex]; if(touching[i].type == 0){ V vA1 = { prevA.x - vertexA.x, prevA.y - vertexA.y, &vertexA, &prevA }; V vA2 = { nextA.x - vertexA.x, nextA.y - vertexA.y, &vertexA, &nextA }; // B vectors need to be inverted V vB1 = { vertexB.x - prevB.x, vertexB.y - prevB.y, &prevB, &vertexB }; V vB2 = { vertexB.x - nextB.x, vertexB.y - nextB.y, &nextB, &vertexB }; vectors.emplace_back(vA1); vectors.emplace_back(vA2); vectors.emplace_back(vB1); vectors.emplace_back(vB2); } else if(touching[i].type == 1){ vectors.emplace_back(V{ vertexA.x-(vertexB.x+B.offsetx), vertexA.y-(vertexB.y+B.offsety), &prevA, &vertexA }); vectors.emplace_back(V{ prevA.x-(vertexB.x+B.offsetx), prevA.y-(vertexB.y+B.offsety), &vertexA, &prevA }); } else if(touching[i].type == 2){ vectors.emplace_back(V{ vertexA.x-(vertexB.x+B.offsetx), vertexA.y-(vertexB.y+B.offsety), &prevB, &vertexB }); vectors.emplace_back(V{ vertexA.x-(prevB.x+B.offsetx), vertexA.y-(prevB.y+B.offsety), &vertexB, &prevB }); } } // TODO: there should be a faster way to reject vectors that // will cause immediate intersection. For now just check them all V translate = {0, 0, nullptr, nullptr}; double maxd = 0; for(i = 0; i < vectors.size(); i++) { if(vectors[i].x == 0 && vectors[i].y == 0){ continue; } // if this vector points us back to where we came from, ignore it. // ie cross product = 0, dot product < 0 if(prevvector && vectors[i].y * prevvector.y + vectors[i].x * prevvector.x < 0){ // compare magnitude with unit vectors double vectorlength = sqrt(vectors[i].x*vectors[i].x+vectors[i].y*vectors[i].y); Vector unitv = {Coord(vectors[i].x/vectorlength), Coord(vectors[i].y/vectorlength)}; double prevlength = sqrt(prevvector.x*prevvector.x+prevvector.y*prevvector.y); Vector prevunit = { prevvector.x/prevlength, prevvector.y/prevlength}; // we need to scale down to unit vectors to normalize vector length. Could also just do a tan here if(abs(unitv.y * prevunit.x - unitv.x * prevunit.y) < 0.0001){ continue; } } V vi = vectors[i]; double d = polygonSlideDistance(A, B, vi, true); double vecd2 = vectors[i].x*vectors[i].x + vectors[i].y*vectors[i].y; if(isnan(d) || d*d > vecd2){ double vecd = sqrt(vectors[i].x*vectors[i].x + vectors[i].y*vectors[i].y); d = vecd; } if(!isnan(d) && d > maxd){ maxd = d; translate = vectors[i]; } } if(!translate || _almostEqual(maxd, 0)) { // didn't close the loop, something went wrong here NFP.clear(); break; } translate.start->marked = true; translate.end->marked = true; prevvector = translate; // trim double vlength2 = translate.x*translate.x + translate.y*translate.y; if(maxd*maxd < vlength2 && !_almostEqual(maxd*maxd, vlength2)){ double scale = sqrt((maxd*maxd)/vlength2); translate.x *= scale; translate.y *= scale; } referencex += translate.x; referencey += translate.y; if(_almostEqual(referencex, startx) && _almostEqual(referencey, starty)) { // we've made a full loop break; } // if A and B start on a touching horizontal line, // the end point may not be the start point bool looped = false; if(NFP.size() > 0) { for(i = 0; i < NFP.size() - 1; i++) { if(_almostEqual(referencex, NFP[i].x) && _almostEqual(referencey, NFP[i].y)){ looped = true; } } } if(looped){ // we've made a full loop break; } NFP.emplace_back(referencex, referencey); B.offsetx += translate.x; B.offsety += translate.y; counter++; } if(NFP.size() > 0){ NFPlist.emplace_back(NFP); } if(!searchEdges){ // only get outer NFP or first inner NFP break; } startpoint = searchStartPoint(A, B, inside, NFPlist); } return NFPlist; } }; template const double _alg::TOL = 1e-9; } } #endif // NFP_SVGNEST_HPP libnest2d-5.0.0/tools/nfp_svgnest_glue.hpp000066400000000000000000000042331422601530300206210ustar00rootroot00000000000000#ifndef NFP_SVGNEST_GLUE_HPP #define NFP_SVGNEST_GLUE_HPP #include "nfp_svgnest.hpp" #include namespace libnest2d { namespace __svgnest { //template<> struct _Tol { // static const BP2D_CONSTEXPR TCoord Value = 1000000; //}; } namespace nfp { using NfpR = NfpResult; template<> struct NfpImpl { NfpR operator()(const PolygonImpl& sh, const PolygonImpl& cother) { // return nfpConvexOnly(sh, cother); namespace sl = shapelike; using alg = __svgnest::_alg; auto nfp_p = alg::noFitPolygon(sl::getContour(sh), sl::getContour(cother), false, true); PolygonImpl nfp_cntr; if(!nfp_p.empty()) nfp_cntr.Contour = nfp_p.front(); return {nfp_cntr, referenceVertex(nfp_cntr)}; } }; template<> struct NfpImpl { NfpR operator()(const PolygonImpl& sh, const PolygonImpl& cother) { // return nfpConvexOnly(sh, cother); namespace sl = shapelike; using alg = __svgnest::_alg; auto nfp_p = alg::noFitPolygon(sl::getContour(sh), sl::getContour(cother), false, false); PolygonImpl nfp_cntr; if(!nfp_p.empty()) nfp_cntr.Contour = nfp_p.front(); return {nfp_cntr, referenceVertex(nfp_cntr)}; } }; template<> struct NfpImpl { NfpR operator()(const PolygonImpl& sh, const PolygonImpl& cother) { namespace sl = shapelike; using alg = __svgnest::_alg; auto nfp_p = alg::noFitPolygon(sl::getContour(sh), sl::getContour(cother), true, false); PolygonImpl nfp_cntr; nfp_cntr.Contour = nfp_p.front(); return {nfp_cntr, referenceVertex(nfp_cntr)}; } }; template<> struct MaxNfpLevel { // static const BP2D_CONSTEXPR NfpLevel value = NfpLevel::BOTH_CONCAVE; static const BP2D_CONSTEXPR NfpLevel value = NfpLevel::CONVEX_ONLY; }; }} #endif // NFP_SVGNEST_GLUE_HPP libnest2d-5.0.0/tools/printer_parts.cpp000066400000000000000000002664731422601530300201600ustar00rootroot00000000000000#include "printer_parts.hpp" const TestData PRINTER_PART_POLYGONS = { { {-5000000, 8954050}, {5000000, 8954050}, {5000000, -45949}, {4972609, -568550}, {3500000, -8954050}, {-3500000, -8954050}, {-4972609, -568550}, {-5000000, -45949}, {-5000000, 8954050}, }, { {-63750000, -8000000}, {-54750000, 46000000}, {50750000, 46000000}, {63750000, 33000000}, {63750000, -46000000}, {-54750000, -46000000}, {-63750000, -28000000}, {-63750000, -8000000}, }, { {-52750000, 41512348}, {-31250000, 45987651}, {52750000, 45987651}, {52750000, -45987651}, {-52750000, -45987651}, {-52750000, 41512348}, }, { {-3900000, 14000000}, {-2167950, 14000000}, {1721454, 7263400}, {3828529, 3613790}, {3838809, 3582149}, {3871560, 3270569}, {3900000, 3000000}, {3500000, -3000000}, {3471560, -3270565}, {3447549, -3498986}, {3292510, -3976167}, {3099999, -4512949}, {2530129, -5500000}, {807565, -8483570}, {-2377349, -14000000}, {-3900000, -14000000}, {-3900000, 14000000}, }, { {-31750000, -1000000}, {-25250000, 40500000}, {-18250000, 47500000}, {10750000, 47500000}, {16750000, 41500000}, {31750000, -37000000}, {31750000, -43857898}, {28107900, -47500000}, {18392099, -47500000}, {-20750000, -46500000}, {-31750000, -4000000}, {-31750000, -1000000}, }, { {-34625000, -14265399}, {-10924999, 24875000}, {33325000, 24875000}, {37575000, 20625000}, {37575000, 17625000}, {26575000, -24875000}, {-8924999, -24875000}, {-34625000, -24484600}, {-37575000, -19375000}, {-34625000, -14265399}, }, { {-14000000, 9000000}, {-11000000, 17000000}, {14000000, 17000000}, {14000000, -17000000}, {-11000000, -17000000}, {-14000000, -8000000}, {-14000000, 9000000}, }, { {-5300000, 2227401}, {-237800, 5150001}, {5299999, 5150001}, {5299999, 650001}, {4699999, -5149997}, {-5300000, -5149997}, {-5300000, 2227401}, }, { {-12000000, 18000000}, {12000000, 18000000}, {12000000, -18000000}, {-12000000, -18000000}, {-12000000, 18000000}, }, { {-18000000, -1000000}, {-15000000, 22000000}, {-11000000, 26000000}, {11000000, 26000000}, {15000000, 22000000}, {18000000, -1000000}, {18000000, -26000000}, {-18000000, -26000000}, {-18000000, -1000000}, }, { {-77500000, 30000000}, {-72500000, 35000000}, {72500000, 35000000}, {77500000, 30000000}, {77500000, -32928901}, {75428901, -35000000}, {-75428901, -35000000}, {-77500000, -32928901}, {-77500000, 30000000}, }, { {-9945219, -3065619}, {-9781479, -2031780}, {-9510560, -1020730}, {-9135450, -43529}, {-2099999, 14110899}, {2099999, 14110899}, {9135450, -43529}, {9510560, -1020730}, {9781479, -2031780}, {9945219, -3065619}, {10000000, -4110899}, {9945219, -5156179}, {9781479, -6190019}, {9510560, -7201069}, {9135450, -8178270}, {8660249, -9110899}, {8090169, -9988750}, {7431449, -10802209}, {6691309, -11542349}, {5877850, -12201069}, {5000000, -12771149}, {4067369, -13246350}, {3090169, -13621459}, {2079119, -13892379}, {1045279, -14056119}, {0, -14110899}, {-1045279, -14056119}, {-2079119, -13892379}, {-3090169, -13621459}, {-4067369, -13246350}, {-5000000, -12771149}, {-5877850, -12201069}, {-6691309, -11542349}, {-7431449, -10802209}, {-8090169, -9988750}, {-8660249, -9110899}, {-9135450, -8178270}, {-9510560, -7201069}, {-9781479, -6190019}, {-9945219, -5156179}, {-10000000, -4110899}, {-9945219, -3065619}, }, { {-34192394, -5192389}, {-31499996, 39000000}, {-8183795, 47668998}, {-6769596, 47668998}, {-4648197, 45547698}, {34192394, 6707109}, {34192394, 5192389}, {31500003, -39000000}, {8183803, -47668998}, {6769603, -47668998}, {4648202, -45547698}, {-32474895, -8424619}, {-34192394, -6707109}, {-34192394, -5192389}, }, { {-23475500, -11910099}, {-18000000, 8217699}, {-11139699, 20100000}, {-10271400, 20899999}, {9532010, 20899999}, {11199999, 20100000}, {18500000, 8600000}, {23475500, -11910099}, {23799999, -14899999}, {23706600, -15788900}, {23668899, -16147499}, {23281299, -17340400}, {22654100, -18426700}, {21814800, -19358900}, {20799999, -20096199}, {19654100, -20606300}, {18427200, -20867099}, {17799999, -20899999}, {-17799999, -20899999}, {-18427200, -20867099}, {-19654100, -20606300}, {-20799999, -20096199}, {-21814800, -19358900}, {-22654100, -18426700}, {-23281299, -17340400}, {-23668899, -16147499}, {-23799999, -14899999}, {-23475500, -11910099}, }, { {-32000000, 10000000}, {-31934440, 10623733}, {-31740640, 11220210}, {-31427049, 11763360}, {-31007389, 12229430}, {-30500000, 12598079}, {-29927051, 12853170}, {-29313585, 12983570}, {16000000, 16000000}, {26000000, 16000000}, {31007400, 12229430}, {31427101, 11763360}, {31740600, 11220210}, {31934398, 10623733}, {32000000, 10000000}, {32000000, -13000000}, {31934398, -13623699}, {31740600, -14220199}, {31427101, -14763399}, {31007400, -15229400}, {30500000, -15598100}, {29927101, -15853200}, {29313598, -15983600}, {29000000, -16000000}, {-28000000, -16000000}, {-29313585, -15983600}, {-29927051, -15853200}, {-30500000, -15598100}, {-31007389, -15229400}, {-31427049, -14763399}, {-31740640, -14220199}, {-31934440, -13623699}, {-32000000, -13000000}, {-32000000, 10000000}, }, { {-36133789, -46431022}, {-36040100, -46171817}, {-35852722, -45653411}, {2200073, 59616485}, {12112792, 87039184}, {14274505, 93019332}, {14382049, 93291641}, {14508483, 93563430}, {14573425, 93688369}, {14654052, 93832443}, {14818634, 94096328}, {14982757, 94327621}, {15001708, 94352630}, {15202392, 94598999}, {15419342, 94833160}, {15497497, 94910552}, {15650848, 95053039}, {15894866, 95256866}, {16104309, 95412185}, {16149047, 95443206}, {16410888, 95611038}, {16677795, 95759750}, {16782348, 95812332}, {16947143, 95889144}, {17216400, 95999465}, {17483123, 96091293}, {17505554, 96098251}, {17745178, 96165542}, {18000671, 96223373}, {18245880, 96265884}, {18484039, 96295257}, {18976715, 96319580}, {31135131, 96319580}, {31697082, 96287902}, {31746368, 96282104}, {32263000, 96190719}, {32338623, 96172576}, {32821411, 96026641}, {32906188, 95995391}, {33360565, 95797012}, {33443420, 95754882}, {33869171, 95505874}, {33900756, 95485122}, {34136413, 95318618}, {34337127, 95159790}, {34377288, 95125930}, {34619628, 94905410}, {34756286, 94767364}, {34859008, 94656143}, {35090606, 94378067}, {35120849, 94338546}, {35309295, 94072113}, {35434875, 93871475}, {35510070, 93740310}, {35688232, 93385772}, {35699096, 93361679}, {35839782, 93012557}, {35905487, 92817459}, {35961578, 92625488}, {36048004, 92249023}, {36051574, 92229934}, {36108856, 91831405}, {36122985, 91667816}, {36133789, 91435317}, {36129669, 91085830}, {36127685, 91046661}, {36092742, 90669830}, {36069946, 90514739}, {36031829, 90308425}, {35948211, 89965225}, {34482635, 84756820}, {27911407, 61403976}, {-5872558, -58657440}, {-14243621, -88406509}, {-14576812, -89590599}, {-15421997, -92594200}, {-15657684, -93431732}, {-16038940, -93720520}, {-16420196, -94009307}, {-17182708, -94586875}, {-18834838, -95838272}, {-19470275, -96319580}, {-21368133, -96319580}, {-22763854, -96319534}, {-29742462, -96319274}, {-32533935, -96319168}, {-36133789, -54619018}, {-36133789, -46431022}, }, { {-26000000, 25500000}, {-6500000, 45000000}, {17499998, 45000000}, {23966310, 38533699}, {26000000, 36500000}, {26000000, -19000000}, {25950000, -24500000}, {17000000, -42214698}, {14300000, -45000000}, {-14299999, -45000000}, {-17500000, -41714698}, {-23400001, -24500000}, {-26000000, -10464000}, {-26000000, 25500000}, }, { {-26000000, 16636100}, {-25072200, 18777799}, {-16500000, 35299999}, {-15050000, 36750000}, {13550000, 36750000}, {15000000, 35299999}, {26000000, 16045200}, {26000000, -2750000}, {16500000, -34507900}, {14840600, -36167301}, {14257900, -36750000}, {-14257900, -36750000}, {-16500000, -34507900}, {-26000000, -2750000}, {-26000000, 16636100}, }, { {-18062349, 18950099}, {4644938, 20049900}, {6230361, 20049900}, {7803279, 19851200}, {9338899, 19456899}, {10812990, 18873300}, {12202310, 18109500}, {13484951, 17177600}, {14640670, 16092300}, {15651250, 14870700}, {16500749, 13532100}, {17175849, 12097599}, {17665750, 10589700}, {17962850, 9032400}, {18062349, 7450099}, {17962850, 5867799}, {15810750, -11007740}, {15683750, -11727769}, {15506849, -12437200}, {15280929, -13132559}, {15007040, -13810470}, {14686531, -14467609}, {14320949, -15100799}, {13912099, -15706950}, {13461959, -16283100}, {12972730, -16826450}, {12446790, -17334339}, {11886699, -17804309}, {11295190, -18234069}, {10675149, -18621520}, {10029590, -18964771}, {9361650, -19262149}, {8674600, -19512220}, {7971780, -19713699}, {7256609, -19865798}, {6532589, -19967498}, {5803222, -20018501}, {5437650, -20024900}, {-1062349, -20049900}, {-16562349, -20049900}, {-18062349, -18549900}, {-18062349, 18950099}, }, { {-18062349, 41299900}, {-1062349, 41299900}, {15280929, -8117440}, {15506849, -8812799}, {15683750, -9522230}, {15810750, -10242259}, {17962850, -27117799}, {18062349, -28700099}, {17962850, -30282400}, {17665750, -31839700}, {17175849, -33347599}, {16500749, -34782100}, {15651250, -36120700}, {14640670, -37342300}, {13484951, -38427600}, {12202310, -39359500}, {10812990, -40123298}, {9338899, -40706901}, {7803279, -41101200}, {6230361, -41299900}, {4644938, -41299900}, {-18062349, -40200099}, {-18062349, 41299900}, }, { {-11750000, 13057900}, {-9807860, 15000000}, {4392139, 24000000}, {11750000, 24000000}, {11750000, -24000000}, {4392139, -24000000}, {-9807860, -15000000}, {-11750000, -13057900}, {-11750000, 13057900}, }, { {-12500000, 17500000}, {12500000, 17500000}, {12500000, -17500000}, {-12500000, -17500000}, {-12500000, 17500000}, }, { {-23500000, 11500000}, {-13857859, 21000000}, {-11000000, 21000000}, {18500000, 500000}, {23500000, -4500000}, {23500000, -19500000}, {22000000, -21000000}, {-23500000, -21000000}, {-23500000, 11500000}, }, { {-13000000, 5250000}, {-4000000, 6750000}, {4000000, 6750000}, {13000000, 5250000}, {13000000, 838459}, {11376299, -1973939}, {10350899, -3750000}, {8618800, -6750000}, {-8498290, -6750000}, {-13000000, 1047180}, {-13000000, 5250000}, }, { {-25000000, 50500000}, {-21500000, 54000000}, {18286800, 54000000}, {25000000, 47286800}, {25000000, -47286800}, {18286800, -54000000}, {-21500000, -54000000}, {-25000000, -50500000}, {-25000000, 50500000}, }, { {-19000000, 46000000}, {-16799999, 46000000}, {14000000, 34000000}, {19000000, 29000000}, {19000000, -29000000}, {14000000, -34000000}, {-16799999, -46000000}, {-19000000, -46000000}, {-19000000, 46000000}, }, { {-7956170, 836226}, {-7825180, 1663290}, {-7767529, 1914530}, {-7608449, 2472140}, {-7308360, 3253890}, {-7083650, 3717780}, {-6928199, 4000000}, {-6472139, 4702280}, {-5988090, 5304979}, {-5945159, 5353040}, {-5353040, 5945159}, {-4702280, 6472139}, {-4544519, 6583869}, {-4000000, 6928199}, {-3253890, 7308360}, {-2836839, 7480130}, {-2472140, 7608449}, {-1663290, 7825180}, {-964293, 7941669}, {-836226, 7956170}, {0, 8000000}, {836226, 7956170}, {964293, 7941669}, {1663290, 7825180}, {2472140, 7608449}, {2836839, 7480130}, {3253890, 7308360}, {4000000, 6928199}, {4544519, 6583869}, {4702280, 6472139}, {5353040, 5945159}, {5945159, 5353040}, {5988090, 5304979}, {6472139, 4702280}, {6928199, 4000000}, {7083650, 3717780}, {7308360, 3253890}, {7608449, 2472140}, {7767529, 1914530}, {7825180, 1663290}, {7956170, 836226}, {8000000, 0}, {7956170, -836226}, {7825180, -1663290}, {7767529, -1914530}, {7608449, -2472140}, {7308360, -3253890}, {7083650, -3717780}, {6928199, -4000000}, {6472139, -4702280}, {5988090, -5304979}, {5945159, -5353040}, {5353040, -5945159}, {4702280, -6472139}, {4544519, -6583869}, {4000000, -6928199}, {3253890, -7308360}, {2836839, -7480130}, {2472140, -7608449}, {1663290, -7825180}, {964293, -7941669}, {836226, -7956170}, {0, -8000000}, {-836226, -7956170}, {-964293, -7941669}, {-1663290, -7825180}, {-2472140, -7608449}, {-2836839, -7480130}, {-3253890, -7308360}, {-4000000, -6928199}, {-4544519, -6583869}, {-4702280, -6472139}, {-5353040, -5945159}, {-5945159, -5353040}, {-5988090, -5304979}, {-6472139, -4702280}, {-6928199, -4000000}, {-7083650, -3717780}, {-7308360, -3253890}, {-7608449, -2472140}, {-7767529, -1914530}, {-7825180, -1663290}, {-7956170, -836226}, {-8000000, 0}, {-7956170, 836226}, }, }; const TestData STEGOSAUR_POLYGONS = { { {113210205, 107034095}, {113561798, 109153793}, {113750099, 109914001}, {114396499, 111040199}, {114599197, 111321998}, {115570404, 112657096}, {116920097, 114166595}, {117630599, 114609390}, {119703704, 115583900}, {120559494, 115811996}, {121045410, 115754493}, {122698097, 115526496}, {123373001, 115370193}, {123482406, 115315689}, {125664199, 114129798}, {125920303, 113968193}, {128551208, 111866195}, {129075592, 111443199}, {135044692, 106572608}, {135254898, 106347694}, {135415100, 106102897}, {136121704, 103779891}, {136325103, 103086303}, {136690093, 101284896}, {136798309, 97568496}, {136798309, 97470397}, {136787399, 97375297}, {136753295, 97272102}, {136687988, 97158699}, {136539794, 96946899}, {135526702, 95550994}, {135388488, 95382293}, {135272491, 95279098}, {135214904, 95250595}, {135122894, 95218002}, {134966705, 95165191}, {131753997, 94380798}, {131226806, 94331001}, {129603393, 94193893}, {129224197, 94188003}, {127874107, 94215103}, {126812797, 94690200}, {126558197, 94813896}, {118361801, 99824195}, {116550796, 101078796}, {116189704, 101380493}, {114634002, 103027999}, {114118103, 103820297}, {113399200, 105568000}, {113201705, 106093597}, {113210205, 107034095}, }, { {77917999, 130563003}, {77926300, 131300903}, {77990196, 132392700}, {78144195, 133328002}, {78170593, 133427093}, {78235900, 133657592}, {78799598, 135466705}, {78933296, 135832397}, {79112899, 136247604}, {79336303, 136670898}, {79585197, 137080596}, {79726303, 137309005}, {79820297, 137431900}, {79942199, 137549407}, {90329193, 145990203}, {90460197, 146094390}, {90606399, 146184509}, {90715194, 146230010}, {90919601, 146267211}, {142335296, 153077697}, {143460296, 153153594}, {143976593, 153182189}, {145403991, 153148605}, {145562301, 153131195}, {145705993, 153102905}, {145938796, 153053192}, {146134094, 153010101}, {146483184, 152920196}, {146904693, 152806396}, {147180099, 152670196}, {147357788, 152581695}, {147615295, 152423095}, {147782287, 152294708}, {149281799, 150908386}, {149405303, 150784912}, {166569305, 126952499}, {166784301, 126638099}, {166938491, 126393699}, {167030899, 126245101}, {167173004, 126015899}, {167415298, 125607200}, {167468292, 125504699}, {167553100, 125320899}, {167584594, 125250694}, {167684997, 125004394}, {167807098, 124672401}, {167938995, 124255203}, {168052307, 123694000}, {170094100, 112846900}, {170118408, 112684204}, {172079101, 88437797}, {172082000, 88294403}, {171916290, 82827606}, {171911590, 82705703}, {171874893, 82641906}, {169867004, 79529907}, {155996795, 58147998}, {155904998, 58066299}, {155864791, 58054199}, {134315704, 56830902}, {134086486, 56817901}, {98200096, 56817798}, {97838195, 56818599}, {79401695, 56865097}, {79291297, 56865501}, {79180694, 56869499}, {79058799, 56885097}, {78937301, 56965301}, {78324691, 57374599}, {77932998, 57638401}, {77917999, 57764297}, {77917999, 130563003}, }, { {75566848, 109289947}, {75592651, 109421951}, {75644248, 109534446}, {95210548, 141223846}, {95262649, 141307449}, {95487854, 141401443}, {95910850, 141511642}, {96105651, 141550338}, {106015045, 142803451}, {106142852, 142815155}, {166897460, 139500244}, {167019348, 139484741}, {168008239, 138823043}, {168137542, 138735153}, {168156250, 138616851}, {173160751, 98882049}, {174381546, 87916046}, {174412246, 87579048}, {174429443, 86988746}, {174436141, 86297348}, {174438949, 84912048}, {174262939, 80999145}, {174172546, 80477546}, {173847549, 79140846}, {173623840, 78294349}, {173120239, 76485046}, {173067138, 76300544}, {173017852, 76137542}, {172941543, 75903045}, {172892547, 75753143}, {172813537, 75533348}, {172758453, 75387046}, {172307556, 74196746}, {171926544, 73192848}, {171891448, 73100448}, {171672546, 72524147}, {171502441, 72085144}, {171414459, 71859146}, {171294250, 71552352}, {171080139, 71019744}, {171039245, 70928146}, {170970550, 70813346}, {170904235, 70704040}, {170786254, 70524353}, {168063247, 67259048}, {167989547, 67184844}, {83427947, 67184844}, {78360847, 67201248}, {78238845, 67220550}, {78151550, 67350547}, {77574554, 68220550}, {77494949, 68342651}, {77479949, 68464546}, {75648345, 106513351}, {75561050, 109165740}, {75566848, 109289947}, }, { {75619415, 108041595}, {83609863, 134885772}, {83806945, 135450820}, {83943908, 135727371}, {84799934, 137289794}, {86547897, 140033782}, {86674118, 140192962}, {86810661, 140364715}, {87045211, 140619918}, {88187042, 141853240}, {93924575, 147393783}, {94058013, 147454803}, {111640083, 153754562}, {111762550, 153787933}, {111975250, 153835311}, {112127426, 153842803}, {116797996, 154005157}, {116969688, 154010681}, {117141731, 154005935}, {117333145, 153988037}, {118007507, 153919952}, {118159675, 153902130}, {118931480, 153771942}, {120878150, 153379089}, {121172164, 153319259}, {122074508, 153034362}, {122260681, 152970367}, {122313438, 152949584}, {130755096, 149423736}, {130996063, 149316818}, {138893524, 144469665}, {138896423, 144466918}, {169883666, 97686134}, {170115036, 96518981}, {170144317, 96365257}, {174395645, 67672065}, {174396560, 67664222}, {174288452, 66839241}, {174170364, 66096923}, {174112731, 65952033}, {174021377, 65823486}, {173948608, 65743225}, {173863830, 65654769}, {170408340, 63627494}, {170004867, 63394714}, {169585632, 63194389}, {169441162, 63137046}, {168944274, 62952133}, {160605072, 60214218}, {160331573, 60126396}, {159674743, 59916877}, {150337249, 56943778}, {150267730, 56922073}, {150080139, 56864868}, {149435333, 56676422}, {149310241, 56640579}, {148055419, 56285041}, {147828796, 56230949}, {147598205, 56181800}, {147149963, 56093917}, {146834457, 56044700}, {146727966, 56028717}, {146519729, 56004882}, {146328521, 55989326}, {146170684, 55990036}, {146151321, 55990745}, {145800170, 56003616}, {145639526, 56017753}, {145599426, 56022491}, {145481338, 56039184}, {145389556, 56052757}, {145325134, 56062591}, {145176574, 56086135}, {145017272, 56113922}, {107163085, 63504539}, {101013870, 65454101}, {100921798, 65535285}, {95362182, 74174079}, {75652366, 107803443}, {75635391, 107834983}, {75628814, 107853294}, {75603431, 107933692}, {75619415, 108041595}, }, { {83617141, 120264900}, {84617370, 126416427}, {84648635, 126601341}, {84693695, 126816085}, {84762496, 127082641}, {84772140, 127117034}, {84860748, 127391693}, {84927398, 127550239}, {85072967, 127789642}, {85155151, 127908851}, {86745422, 130042907}, {86982666, 130317489}, {89975143, 133230743}, {90091384, 133338500}, {96260833, 138719818}, {96713928, 139103668}, {98139297, 140307388}, {102104766, 143511505}, {102142089, 143536468}, {102457626, 143735107}, {103386764, 144312988}, {103845001, 144579177}, {104139175, 144737136}, {104551254, 144932250}, {104690155, 144985778}, {104844238, 145010009}, {105020034, 145010375}, {128999633, 144082305}, {129096542, 144076141}, {133932327, 143370178}, {134130615, 143326751}, {134281250, 143289520}, {135247116, 142993438}, {150774948, 137828704}, {150893478, 137786178}, {151350921, 137608901}, {159797760, 134318115}, {159979827, 134244384}, {159988128, 134240997}, {160035186, 134221633}, {160054962, 134211486}, {160168762, 134132736}, {160181228, 134121047}, {160336425, 133961502}, {160689147, 133564331}, {161446258, 132710739}, {163306427, 130611648}, {164845474, 128873855}, {165270233, 128393600}, {165281478, 128380706}, {165300598, 128358673}, {165303497, 128355194}, {166411590, 122772674}, {166423767, 122708648}, {164745605, 66237312}, {164740341, 66193061}, {164721755, 66082092}, {164721160, 66078750}, {164688476, 65914146}, {164668426, 65859436}, {164563110, 65765937}, {164431152, 65715034}, {163997619, 65550788}, {163946426, 65531440}, {162998107, 65173629}, {162664978, 65049140}, {162482696, 64991668}, {162464660, 64989639}, {148029083, 66896141}, {147862396, 66932853}, {130087829, 73341102}, {129791564, 73469726}, {100590927, 90307685}, {100483535, 90373847}, {100364990, 90458930}, {96447448, 93276664}, {95179656, 94189010}, {93692718, 95260208}, {87904327, 99430885}, {87663711, 99606147}, {87576202, 99683990}, {87498199, 99801719}, {85740264, 104173728}, {85538925, 104710494}, {84786132, 107265830}, {84635955, 107801383}, {84619506, 107868064}, {84518463, 108287200}, {84456848, 108613471}, {84419158, 108826194}, {84375244, 109093818}, {84329818, 109435180}, {84249862, 110179664}, {84218429, 110572166}, {83630020, 117995208}, {83595535, 118787673}, {83576217, 119290679}, {83617141, 120264900}, }, { {91735549, 117640846}, {91748252, 117958145}, {91823547, 118515449}, {92088752, 119477249}, {97995346, 140538452}, {98031051, 140660446}, {98154449, 141060241}, {98179855, 141133758}, {98217056, 141232849}, {98217147, 141233047}, {98269256, 141337051}, {98298950, 141387954}, {98337753, 141445755}, {99455047, 142984451}, {99656250, 143247344}, {102567855, 146783752}, {102685150, 146906845}, {102828948, 147031250}, {102972457, 147120452}, {103676147, 147539642}, {103758956, 147586151}, {103956756, 147682144}, {104479949, 147931457}, {104744453, 148044143}, {104994750, 148123443}, {105375648, 148158645}, {109266250, 148178253}, {109447753, 148169052}, {109693649, 148129150}, {113729949, 147337448}, {113884552, 147303054}, {115155349, 146956146}, {117637145, 146174346}, {154694046, 134048049}, {156979949, 133128555}, {157076843, 133059356}, {157125045, 133001449}, {157561340, 132300750}, {157865753, 131795959}, {157923156, 131667358}, {158007049, 131297653}, {158112747, 130777053}, {158116653, 130640853}, {158268951, 119981643}, {158260040, 119824752}, {158229949, 119563751}, {149914047, 73458648}, {149877548, 73331748}, {144460754, 66413558}, {144230545, 66153152}, {144128051, 66075057}, {143974853, 65973152}, {142812744, 65353149}, {141810943, 64837249}, {141683349, 64805152}, {141505157, 64784652}, {108214355, 61896251}, {107826354, 61866352}, {107072151, 61821750}, {106938850, 61873550}, {106584251, 62055152}, {106419952, 62147548}, {100459152, 65546951}, {100343849, 65615150}, {100198852, 65716949}, {99825149, 65979751}, {94619247, 70330352}, {94492355, 70480850}, {94445846, 70547355}, {94425354, 70588752}, {94379753, 70687652}, {94110252, 71443450}, {94095252, 71569053}, {91737251, 117308746}, {91731048, 117430946}, {91735549, 117640846}, }, { {108231399, 111763748}, {108335403, 111927955}, {108865203, 112754745}, {109206703, 113283851}, {127117500, 125545951}, {127212097, 125560951}, {127358497, 125563652}, {131348007, 125551147}, {131412002, 125550849}, {131509506, 125535446}, {131579391, 125431343}, {132041000, 124735656}, {132104690, 124637847}, {144108505, 100950546}, {144120605, 100853042}, {144123291, 100764648}, {144122695, 100475143}, {144086898, 85637748}, {144083602, 85549346}, {144071105, 85451843}, {144007003, 85354545}, {143679595, 84864547}, {143468597, 84551048}, {143367889, 84539146}, {109847702, 84436347}, {109684700, 84458953}, {105946502, 89406143}, {105915901, 91160446}, {105880905, 93187744}, {105876701, 93441345}, {108231399, 111763748}, }, { {102614700, 117684249}, {102675102, 118074157}, {102888999, 118743148}, {103199707, 119517555}, {103446800, 120099655}, {103488204, 120193450}, {104063903, 121373947}, {104535499, 122192245}, {104595802, 122295249}, {104663002, 122402854}, {104945701, 122854858}, {105740501, 124038848}, {106809700, 125479354}, {107564399, 126380050}, {108116203, 126975646}, {123724700, 142516540}, {124938400, 143705444}, {127919601, 146599243}, {128150894, 146821456}, {128251602, 146917251}, {128383605, 147041839}, {128527709, 147176147}, {128685699, 147321456}, {128861007, 147481246}, {132825103, 151046661}, {133005493, 151205657}, {133389007, 151488143}, {133896499, 151858062}, {134172302, 151991546}, {134375000, 152063140}, {135316101, 152300949}, {136056304, 152220947}, {136242706, 152186843}, {136622207, 152016448}, {136805404, 151908355}, {147099594, 145766845}, {147246704, 144900756}, {147387603, 144048461}, {144353698, 99345855}, {144333801, 99232254}, {144244598, 98812850}, {144228698, 98757858}, {144174606, 98616455}, {133010101, 72396743}, {132018905, 70280853}, {130667404, 67536949}, {129167297, 64854446}, {128569198, 64098350}, {124458503, 59135948}, {124260597, 58946949}, {123908706, 58658851}, {123460098, 58327850}, {122674499, 57840648}, {122041801, 57712150}, {121613403, 57699047}, {121359901, 57749351}, {121123199, 57826450}, {120953498, 57882247}, {120431701, 58198547}, {120099205, 58599349}, {119892303, 58903049}, {102835296, 115179351}, {102686599, 115817245}, {102612396, 116540557}, {102614700, 117684249}, }, { {98163757, 71203430}, {98212463, 73314544}, {98326538, 74432693}, {98402908, 75169799}, {98524154, 76328353}, {99088806, 79911361}, {99304885, 80947769}, {100106689, 84244186}, {100358123, 85080337}, {101715545, 89252807}, {101969528, 89987213}, {107989440, 106391418}, {126299575, 140277343}, {127061813, 141486663}, {127405746, 141872253}, {127846908, 142318450}, {130818496, 145301574}, {134366424, 148100921}, {135308380, 148798828}, {135745666, 149117523}, {136033020, 149251800}, {136500579, 149387725}, {136662719, 149418395}, {136973922, 149474822}, {137184890, 149484375}, {137623748, 149434356}, {137830810, 149355072}, {138681732, 148971343}, {139374465, 148463409}, {139589187, 148264312}, {139809707, 148010711}, {139985610, 147685028}, {140196029, 147284973}, {140355834, 146978668}, {142079666, 142575622}, {146702194, 129469726}, {151285888, 113275238}, {151543731, 112046264}, {151701629, 110884704}, {151837020, 108986206}, {151837097, 107724029}, {151760101, 106529205}, {151581970, 105441925}, {151577301, 105413757}, {151495269, 105014709}, {151393142, 104551513}, {151058502, 103296112}, {150705520, 102477264}, {150137725, 101686370}, {149427032, 100938537}, {102979965, 60772064}, {101930953, 60515609}, {101276748, 60634414}, {100717803, 60918136}, {100125732, 61584625}, {99618148, 62413436}, {99457214, 62709442}, {99368347, 62914794}, {99166992, 63728332}, {98313827, 69634780}, {98176910, 70615707}, {98162902, 70798233}, {98163757, 71203430}, }, { {79090698, 116426399}, {80959800, 137087692}, {81030303, 137762298}, {81190704, 138903503}, {81253700, 139084197}, {81479301, 139544998}, {81952003, 140118896}, {82319900, 140523895}, {82967803, 140993896}, {83022903, 141032104}, {83777900, 141493606}, {84722099, 141849899}, {84944396, 141887207}, {86144699, 141915893}, {87643997, 141938095}, {88277503, 141887695}, {88582099, 141840606}, {89395401, 141712203}, {90531204, 141528396}, {91014801, 141438400}, {92097595, 141190093}, {123348297, 132876998}, {123399505, 132860000}, {123452804, 132841506}, {123515502, 132818908}, {123543800, 132806198}, {124299598, 132437393}, {124975502, 132042098}, {125047500, 131992202}, {125119506, 131930603}, {166848800, 86317703}, {168976409, 83524902}, {169359603, 82932701}, {169852600, 81917800}, {170686904, 79771202}, {170829406, 79245597}, {170885498, 78796295}, {170909301, 78531898}, {170899703, 78238700}, {170842803, 77553199}, {170701293, 76723495}, {170302307, 75753898}, {169924301, 75067398}, {169359802, 74578796}, {168148605, 73757499}, {163261596, 71124702}, {162986007, 70977798}, {162248703, 70599098}, {158193405, 68923995}, {157514297, 68667495}, {156892700, 68495201}, {156607299, 68432998}, {154301895, 68061904}, {93440299, 68061904}, {88732002, 68255996}, {88627304, 68298500}, {88111396, 68541900}, {86393898, 69555404}, {86138298, 69706695}, {85871704, 69913200}, {85387199, 70393402}, {79854499, 76783203}, {79209701, 77649398}, {79108505, 78072502}, {79090698, 78472198}, {79090698, 116426399}, }, { {90956314, 84639938}, {91073814, 85141891}, {91185752, 85505371}, {109815368, 137196487}, {110342590, 138349899}, {110388549, 138447540}, {110652862, 138971343}, {110918045, 139341140}, {114380859, 143159042}, {114446723, 143220352}, {114652198, 143392166}, {114712196, 143437301}, {114782165, 143476028}, {114873054, 143514923}, {115217086, 143660934}, {115306060, 143695526}, {115344009, 143707580}, {115444541, 143737747}, {115589378, 143779937}, {115751358, 143823989}, {115802780, 143825820}, {116872810, 143753616}, {116927055, 143744644}, {154690734, 133504180}, {155009704, 133371856}, {155029907, 133360061}, {155089141, 133323181}, {155342315, 133163360}, {155602294, 132941406}, {155669158, 132880294}, {155821624, 132737884}, {155898986, 132656890}, {155934936, 132608932}, {155968627, 132562713}, {156062896, 132431808}, {156111694, 132363174}, {156148147, 132297180}, {158738342, 127281066}, {159026672, 126378631}, {159073699, 125806335}, {159048522, 125299743}, {159040313, 125192901}, {158898300, 123934677}, {149829376, 70241508}, {149763031, 69910629}, {149684692, 69628723}, {149557800, 69206214}, {149366485, 68864326}, {149137390, 68578514}, {148637466, 68048767}, {147027725, 66632934}, {146228607, 66257507}, {146061309, 66184646}, {146017929, 66174186}, {145236465, 66269500}, {144802490, 66345039}, {144673995, 66376220}, {93732284, 79649864}, {93345336, 79785865}, {93208084, 79840286}, {92814521, 79997779}, {92591087, 80098968}, {92567016, 80110511}, {92032684, 80860725}, {91988853, 80930152}, {91471725, 82210029}, {91142349, 83076683}, {90969284, 83653182}, {90929664, 84043212}, {90926315, 84325256}, {90956314, 84639938}, }, { {114758499, 88719909}, {114771591, 88860549}, {115515533, 94195907}, {115559539, 94383651}, {119882980, 109502059}, {120660522, 111909683}, {126147735, 124949630}, {127127212, 127107215}, {129976379, 132117279}, {130754470, 133257080}, {130820968, 133340835}, {130889312, 133423858}, {131094787, 133652832}, {131257629, 133828247}, {131678619, 134164276}, {131791107, 134248901}, {131969482, 134335189}, {132054107, 134373718}, {132927368, 134701141}, {133077072, 134749313}, {133196075, 134785705}, {133345230, 134804351}, {133498809, 134809051}, {133611541, 134797607}, {134621170, 134565322}, {134741165, 134527511}, {134892089, 134465240}, {135071212, 134353820}, {135252029, 134185821}, {135384979, 134003631}, {135615585, 133576675}, {135793029, 132859008}, {135890228, 131382904}, {135880828, 131261657}, {135837570, 130787963}, {135380661, 127428909}, {132830596, 109495368}, {132815826, 109411666}, {132765869, 109199302}, {132724380, 109068161}, {127490066, 93353515}, {125330810, 87852828}, {125248336, 87647026}, {125002182, 87088424}, {124894592, 86872482}, {121007278, 80019584}, {120962829, 79941261}, {120886489, 79833923}, {120154983, 78949615}, {119366561, 78111709}, {119014755, 77776794}, {116728790, 75636238}, {116660522, 75593933}, {116428192, 75458541}, {116355255, 75416870}, {116264663, 75372528}, {115952728, 75233367}, {115865554, 75205482}, {115756835, 75190956}, {115564163, 75197830}, {115481170, 75202087}, {115417144, 75230400}, {115226959, 75337806}, {115203842, 75351448}, {114722015, 75746932}, {114672103, 75795661}, {114594619, 75891891}, {114565811, 75973831}, {114478256, 76240814}, {114178039, 77252197}, {114137664, 77769668}, {114109771, 78154464}, {114758499, 88719909}, }, { {108135070, 109828002}, {108200347, 110091529}, {108319419, 110298500}, {108439025, 110488388}, {108663574, 110766731}, {108812957, 110935768}, {109321914, 111398925}, {109368087, 111430320}, {109421295, 111466331}, {110058998, 111849746}, {127160308, 120588981}, {127350692, 120683456}, {128052749, 120997207}, {128326919, 121113449}, {131669586, 122213058}, {131754745, 122240592}, {131854583, 122264770}, {132662048, 122449813}, {132782669, 122449897}, {132909118, 122443687}, {133013442, 122436058}, {140561035, 121609939}, {140786346, 121583320}, {140876144, 121570228}, {140962356, 121547996}, {141052612, 121517837}, {141231292, 121442184}, {141309371, 121390007}, {141370132, 121327003}, {141456008, 121219932}, {141591598, 121045005}, {141905761, 120634796}, {141894607, 120305725}, {141881881, 120110855}, {141840881, 119885009}, {141685043, 119238922}, {141617416, 118962882}, {141570434, 118858856}, {131617462, 100598548}, {131542846, 100487213}, {131229385, 100089019}, {131091476, 99928108}, {119824127, 90297180}, {119636337, 90142387}, {119507492, 90037765}, {119436744, 89983657}, {119423942, 89974159}, {119207366, 89822471}, {119117149, 89767097}, {119039489, 89726867}, {116322929, 88522857}, {114817031, 87882110}, {114683975, 87826751}, {114306411, 87728507}, {113876434, 87646003}, {113792106, 87629974}, {113658988, 87615974}, {113574333, 87609275}, {112813575, 87550102}, {112578567, 87560157}, {112439880, 87571647}, {112306922, 87599395}, {112225082, 87622535}, {112132568, 87667175}, {112103477, 87682830}, {110795242, 88511634}, {110373565, 88847793}, {110286537, 88934989}, {109730873, 89531501}, {109648735, 89628883}, {109552581, 89768859}, {109514228, 89838470}, {109501640, 89877586}, {109480964, 89941864}, {109461761, 90032417}, {109457778, 90055458}, {108105194, 109452575}, {108094238, 109620979}, {108135070, 109828002}, }, { {108764694, 108910400}, {108965499, 112306495}, {109598602, 120388298}, {110573898, 128289596}, {110597801, 128427795}, {113786201, 137983795}, {113840301, 138134704}, {113937202, 138326904}, {114046005, 138520401}, {114150802, 138696792}, {114164703, 138717895}, {114381896, 139021194}, {114701004, 139425292}, {114997398, 139747497}, {115065597, 139805191}, {115134498, 139850891}, {115167098, 139871704}, {115473396, 139992797}, {115537498, 139995101}, {116762596, 139832000}, {116897499, 139808593}, {118401802, 139225585}, {118437500, 139209594}, {118488204, 139182189}, {118740097, 139033996}, {118815795, 138967285}, {134401000, 116395492}, {134451507, 116309997}, {135488098, 113593597}, {137738006, 106775695}, {140936492, 97033889}, {140960006, 96948997}, {141026504, 96660995}, {141067291, 96467094}, {141124893, 95771896}, {141511795, 90171600}, {141499801, 90026000}, {141479598, 89907798}, {141276794, 88844596}, {141243804, 88707397}, {140778305, 87031593}, {140733306, 86871696}, {140697204, 86789993}, {140619796, 86708190}, {140398391, 86487396}, {125798797, 72806198}, {125415802, 72454498}, {123150398, 70566093}, {123038803, 70503997}, {122681198, 70305397}, {121919204, 70104797}, {121533699, 70008094}, {121273696, 70004898}, {121130599, 70020797}, {121045097, 70033294}, {120847099, 70082298}, {120481895, 70278999}, {120367004, 70379692}, {120272796, 70475097}, {119862098, 71004791}, {119745101, 71167297}, {119447799, 71726997}, {119396499, 71825798}, {119348701, 71944496}, {109508796, 98298797}, {109368598, 98700897}, {109298400, 98926391}, {108506301, 102750991}, {108488197, 102879898}, {108764694, 108910400}, }, { {106666252, 87231246}, {106673248, 87358055}, {107734146, 101975646}, {107762649, 102357955}, {108702445, 111208351}, {108749450, 111345153}, {108848350, 111542648}, {110270645, 114264358}, {110389648, 114445144}, {138794845, 143461151}, {139048355, 143648956}, {139376144, 143885345}, {139594451, 144022644}, {139754043, 144110046}, {139923950, 144185852}, {140058242, 144234451}, {140185653, 144259552}, {140427551, 144292648}, {141130950, 144281448}, {141157653, 144278152}, {141214355, 144266555}, {141347457, 144223449}, {141625350, 144098953}, {141755142, 144040145}, {141878143, 143971557}, {142011444, 143858154}, {142076843, 143796356}, {142160644, 143691055}, {142224456, 143560852}, {142925842, 142090850}, {142935653, 142065353}, {142995956, 141899154}, {143042556, 141719757}, {143102951, 141436157}, {143129257, 141230453}, {143316055, 139447250}, {143342544, 133704650}, {143307556, 130890960}, {142461257, 124025558}, {141916046, 120671051}, {141890457, 120526153}, {140002349, 113455749}, {139909149, 113144149}, {139853454, 112974456}, {137303756, 105228057}, {134700546, 98161254}, {134617950, 97961547}, {133823547, 96118057}, {133688751, 95837356}, {133481353, 95448059}, {133205444, 94948150}, {131178955, 91529853}, {131144744, 91482055}, {113942047, 67481246}, {113837051, 67360549}, {113048950, 66601745}, {112305549, 66002746}, {112030853, 65790351}, {111970649, 65767547}, {111912445, 65755249}, {111854248, 65743453}, {111657447, 65716354}, {111576950, 65707351}, {111509750, 65708549}, {111443550, 65718551}, {111397247, 65737449}, {111338546, 65764648}, {111129547, 65863349}, {111112449, 65871551}, {110995254, 65927856}, {110968849, 65946151}, {110941444, 65966751}, {110836448, 66057853}, {110490447, 66445449}, {110404144, 66576751}, {106802055, 73202148}, {106741950, 73384948}, {106715454, 73469650}, {106678054, 73627151}, {106657455, 75433448}, {106666252, 87231246}, }, { {101852752, 106261352}, {101868949, 106406051}, {102347549, 108974250}, {112286750, 152027954}, {112305648, 152106536}, {112325752, 152175857}, {112391448, 152290863}, {113558250, 154187454}, {113592048, 154226745}, {113694351, 154313156}, {113736549, 154335647}, {113818145, 154367462}, {114284454, 154490951}, {114415847, 154504547}, {114520751, 154489151}, {114571350, 154478057}, {114594551, 154472854}, {114630546, 154463958}, {114715148, 154429443}, {146873657, 136143051}, {146941741, 136074249}, {147190155, 135763549}, {147262649, 135654937}, {147309951, 135557159}, {147702255, 133903945}, {147934143, 131616348}, {147967041, 131273864}, {148185852, 127892250}, {148195648, 127669754}, {148179656, 126409851}, {148119552, 126182151}, {147874053, 125334152}, {147818954, 125150352}, {146958557, 122656646}, {139070251, 101025955}, {139002655, 100879051}, {119028450, 63067649}, {118846649, 62740753}, {115676048, 57814651}, {115550453, 57629852}, {115330352, 57319751}, {115094749, 56998352}, {114978347, 56847454}, {114853050, 56740550}, {114695053, 56609550}, {114582252, 56528148}, {114210449, 56375953}, {113636245, 56214950}, {113470352, 56171649}, {109580749, 55503551}, {109491645, 55495452}, {109238754, 55511550}, {109080352, 55534049}, {108027748, 55687351}, {107839950, 55732349}, {107614456, 55834953}, {107488143, 55925952}, {107302551, 56062553}, {107218353, 56145751}, {107199447, 56167251}, {107052749, 56354850}, {106978652, 56476348}, {106869644, 56710754}, {104541351, 62448753}, {104454551, 62672554}, {104441253, 62707351}, {104231750, 63366348}, {104222648, 63419952}, {104155746, 63922649}, {104127349, 64147552}, {104110847, 64299957}, {102235450, 92366752}, {101804351, 102877655}, {101852752, 106261352}, }, { {106808700, 120885696}, {106818695, 120923103}, {106873901, 121057098}, {115123603, 133614700}, {115128799, 133619598}, {115182197, 133661804}, {115330101, 133740707}, {115455398, 133799407}, {115595001, 133836807}, {115651000, 133851806}, {116413604, 134055206}, {116654495, 134097900}, {116887603, 134075210}, {117071098, 134040405}, {117458801, 133904891}, {118057998, 133572601}, {118546997, 133261001}, {118578498, 133239395}, {118818603, 133011596}, {121109695, 130501495}, {122661598, 128760101}, {142458190, 102765197}, {142789001, 102099601}, {143105010, 101386505}, {143154800, 101239700}, {143193908, 100825500}, {143160507, 100282501}, {143133499, 100083602}, {143092697, 99880500}, {143050689, 99766700}, {142657501, 98974502}, {142580307, 98855201}, {122267196, 76269897}, {122036399, 76105003}, {121832000, 76028305}, {121688796, 75983108}, {121591598, 75955001}, {121119697, 75902099}, {120789596, 75953498}, {120487495, 76041900}, {120042701, 76365798}, {119886695, 76507301}, {119774200, 76635299}, {119739097, 76686904}, {119685195, 76798202}, {119456199, 77320098}, {106877601, 119561401}, {106854797, 119645103}, {106849098, 119668807}, {106847099, 119699005}, {106840400, 119801406}, {106807800, 120719299}, {106806098, 120862808}, {106808700, 120885696}, }, { {99663352, 105328948}, {99690048, 105797050}, {99714050, 105921447}, {99867248, 106439949}, {100111557, 107256546}, {104924850, 120873649}, {105106155, 121284049}, {105519149, 122184753}, {105586051, 122292655}, {105665054, 122400154}, {106064147, 122838455}, {106755355, 123453453}, {106929054, 123577651}, {107230346, 123771949}, {107760650, 123930648}, {108875854, 124205154}, {108978752, 124228050}, {131962051, 123738754}, {135636047, 123513954}, {135837249, 123500747}, {136357345, 123442749}, {136577346, 123394454}, {136686645, 123367752}, {137399353, 123185050}, {137733947, 123063156}, {137895355, 122997154}, {138275650, 122829154}, {138394256, 122767753}, {138516845, 122670150}, {139987045, 121111251}, {149171646, 108517349}, {149274353, 108372848}, {149314758, 108314247}, {149428848, 108140846}, {149648651, 107650550}, {149779541, 107290252}, {149833343, 107115249}, {149891357, 106920051}, {150246353, 105630249}, {150285842, 105423454}, {150320953, 105233749}, {150336639, 104981552}, {150298049, 104374053}, {150287948, 104271850}, {150026153, 103481147}, {149945449, 103301651}, {149888946, 103213455}, {149800949, 103103851}, {149781143, 103079650}, {149714141, 103005447}, {149589950, 102914146}, {149206054, 102698951}, {128843856, 91378150}, {128641754, 91283050}, {119699851, 87248046}, {117503555, 86311950}, {117145851, 86178054}, {116323654, 85925048}, {115982551, 85834045}, {115853050, 85819252}, {115222549, 85771949}, {107169357, 85771949}, {107122650, 85776451}, {106637145, 85831550}, {105095046, 86423950}, {104507850, 86703750}, {104384155, 86763153}, {104332351, 86790145}, {104198257, 86882644}, {103913757, 87109451}, {103592346, 87388450}, {103272651, 87666748}, {103198051, 87779052}, {101698654, 90600952}, {101523551, 90958450}, {101360054, 91347450}, {101295349, 91542144}, {99774551, 98278152}, {99746749, 98417755}, {99704055, 98675453}, {99663352, 99022949}, {99663352, 105328948}, }, { {95036499, 101778106}, {95479103, 102521301}, {95587295, 102700103}, {98306503, 106984901}, {98573303, 107377700}, {100622406, 110221702}, {101252304, 111089599}, {104669502, 115750198}, {121838500, 131804107}, {122000503, 131943695}, {122176803, 132023406}, {122474105, 132025390}, {122703804, 132023101}, {123278808, 131878112}, {124072998, 131509109}, {124466506, 131102508}, {152779296, 101350906}, {153016510, 101090606}, {153269699, 100809097}, {153731994, 100214096}, {153927902, 99939796}, {154641098, 98858100}, {154864303, 98517601}, {155056594, 97816604}, {155083511, 97645599}, {155084899, 97462097}, {154682601, 94386100}, {154376007, 92992599}, {154198593, 92432403}, {153830505, 91861701}, {153686904, 91678695}, {151907104, 90314605}, {151368896, 89957603}, {146983306, 87632202}, {139082397, 84273605}, {128947692, 80411399}, {121179000, 78631301}, {120264701, 78458198}, {119279510, 78304603}, {116913101, 77994102}, {116151504, 77974601}, {115435104, 78171401}, {113544105, 78709106}, {113231002, 78879898}, {112726303, 79163604}, {112310501, 79411102}, {96169998, 97040802}, {95196304, 98364402}, {95167800, 98409599}, {95083503, 98570701}, {94986999, 99022201}, {94915100, 100413299}, {95036499, 101778106}, }, { {82601348, 96004745}, {83443847, 128861953}, {84173248, 136147354}, {104268249, 141388839}, {104373649, 141395355}, {105686950, 141389541}, {149002243, 140435653}, {159095748, 133388244}, {159488143, 133112655}, {159661849, 132894653}, {163034149, 128290847}, {164801849, 124684249}, {167405746, 72553245}, {167330444, 71960746}, {167255050, 71791847}, {167147155, 71572044}, {166999557, 71341545}, {166723937, 70961448}, {166238250, 70611541}, {165782348, 70359649}, {165649444, 70286849}, {165332946, 70122344}, {165164154, 70062248}, {164879150, 69967544}, {164744949, 69928947}, {164691452, 69915245}, {164669448, 69910247}, {159249938, 68738952}, {158528259, 68704742}, {147564254, 68604644}, {116196655, 68982742}, {115364944, 69005050}, {115193145, 69013549}, {101701248, 70984146}, {93918449, 72233047}, {93789749, 72285247}, {93777046, 72292648}, {93586044, 72444046}, {93366348, 72662345}, {93301147, 72745452}, {93260345, 72816345}, {83523948, 92593849}, {83430145, 92810241}, {82815048, 94665542}, {82755554, 94858551}, {82722953, 95014350}, {82594253, 95682350}, {82601348, 96004745}, }, { {110371345, 125796493}, {110411544, 126159599}, {110445251, 126362899}, {111201950, 127863800}, {112030052, 129270492}, {112367050, 129799301}, {113088348, 130525604}, {113418144, 130853698}, {117363449, 134705505}, {118131149, 135444793}, {118307449, 135607299}, {119102546, 136297195}, {119385047, 136531906}, {120080848, 137094390}, {120794845, 137645401}, {121150344, 137896392}, {121528945, 138162506}, {121644546, 138242095}, {122142349, 138506408}, {127540847, 141363006}, {127933448, 141516204}, {128728256, 141766799}, {129877151, 141989898}, {130626052, 142113891}, {130912246, 142135192}, {131246841, 142109100}, {131496047, 142027404}, {131596252, 141957794}, {131696350, 141873504}, {131741043, 141803405}, {138788452, 128037704}, {139628646, 125946197}, {138319351, 112395401}, {130035354, 78066703}, {124174049, 69908798}, {123970649, 69676895}, {123874252, 69571899}, {123246643, 68961303}, {123193954, 68924400}, {121952049, 68110000}, {121787345, 68021896}, {121661544, 67970306}, {121313446, 67877502}, {121010650, 67864799}, {120995346, 67869705}, {120583747, 68122207}, {120509750, 68170600}, {120485847, 68189102}, {112160148, 77252403}, {111128646, 78690704}, {110969650, 78939407}, {110512550, 79663406}, {110397247, 79958206}, {110371345, 80038299}, {110371345, 125796493}, }, { {112163948, 137752700}, {112171150, 137837997}, {112203048, 137955993}, {112240150, 138008209}, {112343246, 138111099}, {112556243, 138223205}, {112937149, 138307998}, {113318748, 138331909}, {126076446, 138428298}, {126165245, 138428695}, {126312446, 138417907}, {134075546, 136054504}, {134322753, 135949401}, {134649948, 135791198}, {135234954, 135493408}, {135290145, 135464691}, {135326248, 135443695}, {135920043, 135032592}, {135993850, 134975799}, {136244247, 134761199}, {136649444, 134378692}, {137067153, 133964294}, {137188156, 133839096}, {137298049, 133704498}, {137318954, 133677795}, {137413543, 133522201}, {137687347, 133043792}, {137816055, 132660705}, {137836044, 131747695}, {137807144, 131318603}, {136279342, 119078704}, {136249053, 118945800}, {127306152, 81348602}, {127114852, 81065505}, {127034248, 80951400}, {126971649, 80893707}, {125093551, 79178001}, {124935745, 79036003}, {115573745, 71767601}, {115411148, 71701805}, {115191947, 71621002}, {115017051, 71571304}, {114870147, 71572898}, {113869552, 71653900}, {112863349, 72976104}, {112756347, 73223899}, {112498947, 73832206}, {112429351, 73998504}, {112366050, 74168098}, {112273246, 74487098}, {112239250, 74605400}, {112195549, 74899902}, {112163948, 75280700}, {112163948, 137752700}, }, { {78562347, 141451843}, {79335624, 142828186}, {79610343, 143188140}, {79845077, 143445724}, {81379173, 145126678}, {81826751, 145577178}, {82519126, 146209472}, {83964973, 147280502}, {85471343, 148377868}, {86115539, 148760803}, {88839988, 150281188}, {89021247, 150382217}, {90775917, 151320526}, {91711380, 151767288}, {92757591, 152134277}, {93241058, 152201766}, {113402145, 153091995}, {122065994, 146802825}, {164111053, 91685104}, {164812759, 90470565}, {165640182, 89037384}, {171027435, 66211853}, {171450805, 64406951}, {171463150, 64349624}, {171469787, 64317184}, {171475585, 64282028}, {171479812, 64253036}, {171483596, 64210433}, {171484405, 64153488}, {171483001, 64140785}, {171481719, 64132751}, {171478668, 64115478}, {171472702, 64092437}, {171462768, 64075408}, {171448089, 64061347}, {171060333, 63854789}, {169640502, 63197738}, {169342147, 63086711}, {166413101, 62215766}, {151881774, 58826736}, {146010574, 57613151}, {141776962, 56908004}, {140982940, 57030628}, {139246154, 57540817}, {139209609, 57566974}, {127545310, 66015594}, {127476654, 66104812}, {105799087, 98784980}, {85531921, 129338897}, {79319717, 138704513}, {78548156, 140188079}, {78530448, 140530456}, {78515594, 141299987}, {78562347, 141451843}, }, { {77755004, 128712387}, {78073547, 130552612}, {78433593, 132017822}, {79752693, 136839645}, {80479461, 138929260}, {80903221, 140119674}, {81789848, 141978454}, {82447387, 143105575}, {83288436, 144264328}, {84593582, 145846542}, {84971939, 146242813}, {86905578, 147321304}, {87874191, 147594131}, {89249092, 147245132}, {89541542, 147169052}, {98759140, 144071609}, {98894233, 144024261}, {113607818, 137992843}, {128324356, 131649307}, {139610076, 126210189}, {146999572, 122112884}, {147119415, 122036041}, {148717330, 120934616}, {149114776, 120652725}, {171640289, 92086624}, {171677917, 92036224}, {171721191, 91973869}, {171851608, 91721557}, {171927795, 91507644}, {172398696, 89846351}, {172436752, 89559959}, {169361663, 64753852}, {169349029, 64687164}, {169115127, 63616458}, {168965728, 63218254}, {168911788, 63121219}, {168901611, 63106807}, {168896896, 63100486}, {168890686, 63092460}, {168876586, 63081058}, {168855529, 63067909}, {168808746, 63046024}, {167251068, 62405864}, {164291717, 63716899}, {152661651, 69910156}, {142312393, 75421356}, {78778053, 111143295}, {77887222, 113905914}, {77591979, 124378433}, {77563247, 126586669}, {77755004, 128712387}, }, { {105954101, 131182754}, {105959197, 131275848}, {105972801, 131473556}, {105981498, 131571044}, {106077903, 132298553}, {106134094, 132715255}, {106155700, 132832351}, {106180099, 132942657}, {106326797, 133590347}, {106375099, 133719345}, {106417602, 133829345}, {106471000, 133930343}, {106707901, 134308654}, {106728401, 134340545}, {106778198, 134417556}, {106832397, 134491851}, {106891296, 134562957}, {106981300, 134667358}, {107044204, 134736557}, {107111000, 134802658}, {107180999, 134865661}, {107291099, 134961349}, {107362998, 135020355}, {107485397, 135112854}, {107558998, 135166946}, {107690399, 135256256}, {107765098, 135305252}, {107903594, 135390548}, {108183898, 135561843}, {108459503, 135727951}, {108532501, 135771850}, {108796096, 135920059}, {108944099, 135972549}, {109102401, 136010757}, {109660598, 136071044}, {109971595, 136100250}, {110209594, 136116851}, {110752799, 136122344}, {111059906, 136105758}, {111152900, 136100357}, {111237197, 136091354}, {111316101, 136075057}, {111402000, 136050949}, {111475296, 136026657}, {143546600, 123535949}, {143899002, 122454353}, {143917404, 122394348}, {143929199, 122354652}, {143944793, 122295753}, {143956207, 122250953}, {143969497, 122192253}, {143980102, 122143249}, {143991302, 122083053}, {144000396, 122031753}, {144009796, 121970954}, {144017303, 121917655}, {144025405, 121850250}, {144030609, 121801452}, {144036804, 121727455}, {144040008, 121683456}, {144043502, 121600952}, {144044708, 121565048}, {144045700, 121470352}, {144045898, 121446952}, {144041503, 121108657}, {144037506, 121023452}, {143733795, 118731750}, {140461395, 95238647}, {140461105, 95236755}, {140433807, 95115249}, {140392608, 95011650}, {134840805, 84668952}, {134824996, 84642456}, {134781494, 84572952}, {134716796, 84480850}, {127473899, 74425453}, {127467002, 74417152}, {127431701, 74381652}, {127402603, 74357147}, {127375503, 74334457}, {127294906, 74276649}, {127181900, 74207649}, {127177597, 74205451}, {127123901, 74178451}, {127078903, 74155853}, {127028999, 74133148}, {126870803, 74070953}, {126442901, 73917648}, {126432403, 73914955}, {126326004, 73889846}, {126262405, 73880645}, {126128097, 73878456}, {125998199, 73877655}, {108701095, 74516647}, {108644599, 74519348}, {108495201, 74528953}, {108311302, 74556457}, {108252799, 74569458}, {108079002, 74612152}, {107981399, 74638954}, {107921295, 74657951}, {107862197, 74685951}, {107601303, 74828948}, {107546997, 74863449}, {107192794, 75098846}, {107131202, 75151153}, {106260002, 76066146}, {106195098, 76221145}, {106168502, 76328453}, {106144699, 76437454}, {106124496, 76538452}, {106103698, 76649650}, {106084197, 76761650}, {106066299, 76874450}, {106049903, 76987457}, {106034797, 77101150}, {106020904, 77214950}, {106008201, 77328948}, {105996902, 77443145}, {105986099, 77565849}, {105977005, 77679649}, {105969299, 77793151}, {105963096, 77906349}, {105958297, 78019149}, {105955299, 78131454}, {105954101, 78242950}, {105954101, 131182754}, }, { {91355499, 77889205}, {114834197, 120804504}, {114840301, 120815200}, {124701507, 132324798}, {124798805, 132436706}, {124901504, 132548309}, {125126602, 132788909}, {125235000, 132901901}, {125337707, 133005401}, {125546302, 133184707}, {125751602, 133358703}, {126133300, 133673004}, {126263900, 133775604}, {126367401, 133855499}, {126471908, 133935104}, {126596008, 134027496}, {127119308, 134397094}, {127135101, 134408203}, {127433609, 134614303}, {127554107, 134695709}, {128155395, 135070907}, {128274505, 135141799}, {129132003, 135573211}, {129438003, 135713195}, {129556106, 135767196}, {131512695, 136648498}, {132294509, 136966598}, {132798400, 137158798}, {133203796, 137294494}, {133377410, 137350799}, {133522399, 137396606}, {133804397, 137480697}, {134017807, 137542205}, {134288696, 137618408}, {134564208, 137680099}, {134844696, 137740097}, {135202606, 137807098}, {135489105, 137849807}, {135626800, 137864898}, {135766906, 137878692}, {135972808, 137895797}, {136110107, 137905502}, {136235000, 137913101}, {136485809, 137907196}, {139194305, 136979202}, {140318298, 136536209}, {140380004, 136505004}, {140668197, 136340499}, {140724304, 136298904}, {140808197, 136228210}, {140861801, 136180603}, {140917404, 136129104}, {140979202, 136045104}, {141022903, 135984207}, {147591094, 126486999}, {147661315, 126356101}, {147706100, 126261901}, {147749099, 126166000}, {147817108, 126007507}, {147859100, 125908599}, {153693206, 111901100}, {153731109, 111807800}, {153760894, 111698806}, {158641998, 92419303}, {158644500, 92263702}, {158539703, 92013504}, {158499603, 91918899}, {158335510, 91626800}, {158264007, 91516304}, {158216308, 91449203}, {158178314, 91397506}, {158094299, 91283203}, {157396408, 90368202}, {157285491, 90224700}, {157169906, 90079200}, {157050003, 89931304}, {156290603, 89006805}, {156221099, 88922897}, {156087707, 88771003}, {155947906, 88620498}, {155348602, 88004203}, {155113204, 87772796}, {154947296, 87609703}, {154776306, 87448204}, {154588806, 87284301}, {153886306, 86716400}, {153682403, 86560501}, {152966705, 86032402}, {152687805, 85828704}, {152484313, 85683204}, {152278808, 85539001}, {150878204, 84561401}, {150683013, 84426498}, {150599395, 84372703}, {150395599, 84243202}, {149988906, 83989395}, {149782897, 83864501}, {149568908, 83739799}, {148872100, 83365303}, {148625396, 83242202}, {128079010, 73079605}, {127980506, 73031005}, {126701103, 72407104}, {126501701, 72312202}, {126431503, 72280601}, {126311706, 72230606}, {126260101, 72210899}, {126191902, 72187599}, {126140106, 72170303}, {126088203, 72155303}, {126036102, 72142700}, {125965904, 72126899}, {125913009, 72116600}, {125859603, 72108505}, {125788101, 72100296}, {125733505, 72094398}, {125678100, 72090400}, {125621398, 72088302}, {125548805, 72087303}, {125490707, 72086898}, {125430908, 72088203}, {125369804, 72091094}, {125306900, 72095306}, {125233505, 72100997}, {125168609, 72106506}, {125102203, 72113601}, {125034103, 72122207}, {124964309, 72132095}, {124890701, 72143707}, {124819305, 72155105}, {91355499, 77889099}, {91355499, 77889205}, }, { {84531845, 127391708}, {84916946, 130417510}, {86133247, 131166900}, {86338447, 131292892}, {86748847, 131544799}, {102193946, 136599502}, {103090942, 136796798}, {103247146, 136822509}, {104083549, 136911499}, {106119346, 137109802}, {106265853, 137122207}, {106480247, 137139205}, {110257850, 137133605}, {116917747, 136131408}, {117054946, 136106704}, {119043945, 135244293}, {119249046, 135154708}, {136220947, 126833007}, {165896347, 91517105}, {166032546, 91314697}, {166055435, 91204902}, {166056152, 91176803}, {166047256, 91100006}, {166039733, 91063705}, {165814849, 90080802}, {165736450, 89837707}, {165677246, 89732101}, {165676956, 89731803}, {165560241, 89629302}, {154419952, 82608505}, {153822143, 82239700}, {137942749, 74046104}, {137095245, 73845504}, {135751342, 73537704}, {134225952, 73208602}, {132484344, 72860801}, {124730346, 73902000}, {120736549, 74464401}, {100401245, 78685401}, {90574645, 90625701}, {90475944, 90748809}, {90430747, 90808700}, {90321548, 90958305}, {90254852, 91077903}, {90165641, 91244003}, {90134941, 91302398}, {84474647, 103745697}, {84328048, 104137901}, {84288543, 104327606}, {84038047, 106164604}, {84013351, 106368698}, {83943847, 110643203}, {84531845, 127391708}, }, }; const TestDataEx PRINTER_PART_POLYGONS_EX = { { { {533726562, 142141690}, {532359712, 143386134}, {530141290, 142155145}, {528649729, 160091460}, {533659500, 157607547}, {538669739, 160091454}, {537178168, 142155145}, {534959534, 143386102}, {533726562, 142141690}, }, { }, }, { { {118305840, 11603332}, {118311095, 26616786}, {113311095, 26611146}, {109311095, 29604752}, {109300760, 44608489}, {109311095, 49631801}, {113300790, 52636806}, {118311095, 52636806}, {118308782, 103636810}, {223830940, 103636981}, {236845321, 90642174}, {236832882, 11630488}, {232825251, 11616786}, {210149075, 11616786}, {211308596, 13625149}, {209315325, 17080886}, {205326885, 17080886}, {203334352, 13629720}, {204493136, 11616786}, {118305840, 11603332}, }, { }, }, { { {365619370, 111280336}, {365609100, 198818091}, {387109100, 198804367}, {387109100, 203279701}, {471129120, 203279688}, {471128689, 111283937}, {365619370, 111280336}, }, { }, }, { { {479997525, 19177632}, {477473010, 21975778}, {475272613, 21969219}, {475267479, 32995796}, {477026388, 32995796}, {483041428, 22582411}, {482560272, 20318630}, {479997525, 19177632}, }, { }, }, { { {476809080, 4972372}, {475267479, 4975778}, {475272613, 16002357}, {481018177, 18281994}, {482638044, 15466085}, {476809080, 4972372}, }, { }, }, { { {424866064, 10276075}, {415113411, 10277960}, {411723180, 13685293}, {410473354, 18784347}, {382490868, 18784008}, {380996185, 17286945}, {380996185, 11278161}, {375976165, 11284347}, {375976165, 56389754}, {375169018, 57784347}, {371996185, 57784347}, {371996185, 53779177}, {364976165, 53784347}, {364969637, 56791976}, {369214608, 61054367}, {371474507, 61054367}, {371473155, 98298160}, {378476349, 105317193}, {407491306, 105307497}, {413509785, 99284903}, {413496185, 48304367}, {419496173, 48315719}, {422501887, 45292801}, {422500504, 39363184}, {420425079, 37284347}, {419476165, 43284347}, {413496185, 43284347}, {413497261, 30797428}, {418986175, 25308513}, {424005230, 25315076}, {428496185, 20815924}, {428512720, 13948847}, {424866064, 10276075}, }, { }, }, { { {723893066, 37354349}, {717673034, 37370791}, {717673034, 44872138}, {715673034, 44867768}, {715673034, 46055353}, {699219526, 40066777}, {697880758, 37748547}, {691985477, 37748293}, {689014018, 42869257}, {691985477, 48016003}, {697575093, 48003007}, {715671494, 54589493}, {715656800, 87142158}, {759954611, 87142158}, {764193054, 82897328}, {764193054, 79872138}, {757173034, 79866968}, {757173034, 83872138}, {754419422, 83869509}, {753193054, 81739327}, {753193054, 37360571}, {723893066, 37354349}, }, { }, }, { { {85607478, 4227596}, {61739211, 4230337}, {61739211, 13231393}, {58725066, 13231405}, {58721589, 27731406}, {58738375, 30262521}, {61739211, 30251413}, {61736212, 38251411}, {70759231, 38254724}, {70905600, 33317391}, {73749222, 31251468}, {76592843, 33317393}, {76739211, 38254516}, {86765007, 38251411}, {86759599, 4231393}, {85607478, 4227596}, }, { }, }, { { {534839721, 53437770}, {534839721, 60849059}, {539898273, 63773857}, {545461140, 63757881}, {544859741, 53447836}, {541839721, 53437862}, {541710836, 56353878}, {540193984, 57229659}, {538859741, 53437862}, {534839721, 53437770}, }, { }, }, { { {756086230, 136598477}, {732054387, 136605752}, {732052489, 172629505}, {756091994, 172627853}, {756086230, 136598477}, }, { }, }, { { {100337034, 79731391}, {70296833, 79731391}, {70311095, 92263567}, {74329808, 96264260}, {96344976, 96257215}, {100344419, 92232243}, {100337034, 79731391}, }, { }, }, { { {102331115, 44216643}, {67311095, 44217252}, {67311095, 69250964}, {74329808, 76264260}, {96334594, 76251411}, {103335261, 69241401}, {103345839, 44231404}, {102331115, 44216643}, }, { }, }, { { {93849749, 109613798}, {91771666, 111698636}, {91772404, 174626800}, {96782902, 179645338}, {241790509, 179645349}, {246800716, 174626800}, {246802574, 111699755}, {243934250, 109616385}, {93849749, 109613798}, }, { }, }, { { {15856630, 87966835}, {8414359, 91273170}, {5891847, 99010553}, {8403012, 104668172}, {13739106, 107763252}, {13739106, 116209175}, {17959116, 116219127}, {17959127, 107763252}, {23952579, 103855773}, {25806388, 96944174}, {22553953, 90543787}, {15856630, 87966835}, }, { }, }, { { {503922805, 110421794}, {491110107, 123244292}, {479598157, 123244304}, {479601067, 149264312}, {494260327, 149265241}, {502929782, 157948320}, {506490250, 155806171}, {502950518, 155094962}, {507193172, 150852294}, {504364680, 148023895}, {535816833, 116571757}, {538656617, 119411542}, {542887886, 115157558}, {543594970, 118693080}, {545330008, 116966050}, {540309189, 110425901}, {503922805, 110421794}, }, { }, }, { { {519310433, 62560296}, {515749982, 64702434}, {519289696, 65413661}, {515047062, 69656303}, {517875553, 72484703}, {486423431, 103936848}, {483595031, 101108448}, {479352325, 105351055}, {478645233, 101815525}, {476917724, 103520870}, {481923478, 110077233}, {518337308, 110084297}, {531130127, 97264312}, {542630127, 97281049}, {542639167, 71244292}, {527979906, 71243363}, {519310433, 62560296}, }, { }, }, { { {528658425, 14775300}, {525975568, 24475413}, {522556814, 29181341}, {517517474, 32090757}, {511736147, 32698600}, {506200465, 30901018}, {501879743, 27011092}, {497782491, 14775300}, {492372374, 15588397}, {489384268, 20795320}, {491253082, 28537271}, {495185363, 34469052}, {495178475, 43927542}, {502032399, 55796416}, {524402581, 55807400}, {531706434, 44295318}, {531205383, 34469052}, {536679415, 23789946}, {535868173, 17264403}, {532873348, 15073849}, {528658425, 14775300}, }, { }, }, { { {481122222, 166062916}, {478115710, 166824472}, {477103577, 169063247}, {477106058, 192070670}, {478623652, 194687013}, {525109130, 195083267}, {525117792, 198086965}, {535129140, 198091624}, {535129150, 195083267}, {539038502, 194940807}, {540865280, 193308821}, {541132038, 169100183}, {539614599, 166459484}, {481122222, 166062916}, }, { }, }, { { {23771404, 13005453}, {24774973, 19182457}, {31971050, 18727127}, {32556286, 58337520}, {25390683, 58337566}, {25063762, 54707065}, {20168811, 54707252}, {20171550, 62917175}, {70810377, 202895528}, {74314421, 205588631}, {88674817, 205515176}, {91837376, 203083756}, {92280287, 199307207}, {40674807, 15904975}, {36849630, 13006690}, {23771404, 13005453}, }, { }, }, { { {336421201, 2986256}, {331176570, 6498191}, {327552287, 5825511}, {324913825, 2988891}, {316226154, 2989990}, {313040282, 6275291}, {313040282, 23489990}, {307126391, 23490002}, {307140289, 25510010}, {313040282, 25510010}, {313040282, 28989990}, {307126391, 28990002}, {307140289, 31015515}, {313040282, 31010010}, {313040282, 35989990}, {304534809, 37529785}, {304524991, 73488855}, {308554680, 77518546}, {324040282, 77510010}, {324040295, 93025333}, {334574441, 93010010}, {334574441, 90989990}, {332560302, 90989990}, {332560302, 85010010}, {334560302, 85010010}, {334561237, 82010010}, {338540282, 82010010}, {339540282, 83760010}, {338540293, 93020012}, {348060655, 93014679}, {356564448, 84500000}, {356560555, 28989990}, {347334198, 29039989}, {347334198, 25510010}, {356510304, 25521084}, {356510315, 23478922}, {347560302, 23489990}, {347560302, 5775291}, {344874443, 2989990}, {336421201, 2986256}, }, { }, }, { { {465152221, 31684687}, {457606880, 31688302}, {452659362, 35508617}, {449044605, 34734089}, {446478972, 31692751}, {437784814, 31692957}, {435521210, 33956565}, {435532195, 65697616}, {426028494, 65691361}, {426025938, 85049712}, {435532195, 95717636}, {435524445, 103754026}, {436995898, 105225463}, {447552204, 105226323}, {447552215, 103197497}, {444552215, 103197616}, {444552215, 99217636}, {452032195, 99217636}, {452032195, 105221758}, {465588513, 105225463}, {467059965, 103754026}, {467052215, 95717636}, {478053039, 84511285}, {478056214, 65697616}, {468552215, 65697616}, {468563959, 33957323}, {465152221, 31684687}, }, { }, }, { { {764927063, 92658416}, {762115426, 94171595}, {762122741, 131696443}, {786415417, 132779578}, {793690904, 129904572}, {797383202, 124822853}, {798269157, 120142660}, {796710161, 114090278}, {793387498, 110215980}, {796094093, 103892242}, {794107594, 96994001}, {787445494, 92840355}, {764927063, 92658416}, }, { }, }, { { {27496331, 123147467}, {3202195, 124246400}, {3203433, 205768600}, {20223453, 205775606}, {20223644, 163243606}, {31297341, 162189074}, {36789517, 155659691}, {36967183, 150566416}, {34468182, 145711036}, {38465496, 140400171}, {38952460, 132613091}, {34771593, 126022444}, {27496331, 123147467}, }, { }, }, { { {797556553, 39197820}, {791313598, 39199767}, {789506233, 39864015}, {789522521, 48199767}, {775974570, 48195721}, {774022521, 50129235}, {774008720, 76258022}, {775974570, 78223833}, {789522521, 78219787}, {789522521, 86576919}, {797556547, 87221747}, {797556553, 39197820}, }, { }, }, { { {676593113, 129820144}, {676565322, 164844636}, {701599609, 164858650}, {701599609, 129823260}, {676593113, 129820144}, }, { }, }, { { {727646871, 93121321}, {709122741, 93122138}, {709122741, 125656310}, {718769809, 135145243}, {721622937, 135156111}, {724152429, 132626619}, {723734126, 112688301}, {725837154, 107378546}, {728976138, 104430846}, {735847924, 102664848}, {741289364, 104430846}, {745202882, 108599767}, {746590596, 114642158}, {751137173, 114644887}, {756151199, 109641674}, {756149037, 94634278}, {754642761, 93122138}, {727646871, 93121321}, }, { }, }, { { {135915724, 185598906}, {131396265, 193419009}, {131399444, 197643260}, {140399444, 197636810}, {140399444, 199138818}, {157419464, 197643916}, {157422805, 193210743}, {153046747, 185604789}, {149044579, 185614655}, {147324399, 189850396}, {144168954, 191108901}, {141187892, 189479768}, {139917659, 185615382}, {135915724, 185598906}, }, { }, }, { { {312619110, 154485844}, {309601817, 157488332}, {309599764, 203494810}, {313109244, 207010010}, {352900849, 207019221}, {359629120, 200302405}, {359638705, 159501827}, {354621096, 154487830}, {312619110, 154485844}, }, { }, }, { { {313120315, 98984639}, {309609100, 102486971}, {309596977, 148492024}, {312591195, 151510010}, {354608772, 151524494}, {359629120, 146515788}, {359638123, 105715491}, {352907860, 98987790}, {313120315, 98984639}, }, { }, }, { { {657746643, 86246732}, {651722477, 92270881}, {651720052, 131280884}, {653947196, 131280884}, {659746643, 125487816}, {659746643, 119273826}, {663742413, 112352691}, {671726623, 112352691}, {675733721, 119283349}, {684745297, 119298573}, {689758503, 114263168}, {689752066, 91272158}, {684746643, 86260871}, {657746643, 86246732}, }, { }, }, { { {653940791, 39260871}, {651720052, 39260871}, {651726623, 78280611}, {657746631, 84295035}, {684746643, 84280891}, {689752066, 79269604}, {689746643, 56247942}, {684745283, 51243184}, {675733721, 51258413}, {671726623, 58189071}, {663742413, 58189071}, {659746643, 51267936}, {659746643, 45053950}, {653940791, 39260871}, }, { }, }, { { {442365208, 3053303}, {436408500, 5694021}, {434342552, 11072741}, {436986326, 17009033}, {442365367, 19073360}, {448299202, 16431441}, {450365150, 11052721}, {448299202, 5694021}, {442365208, 3053303}, }, { }, }, }; libnest2d-5.0.0/tools/printer_parts.hpp000066400000000000000000000005671422601530300201530ustar00rootroot00000000000000#ifndef PRINTER_PARTS_H #define PRINTER_PARTS_H #include #include using TestData = std::vector; using TestDataEx = std::vector; extern const TestData PRINTER_PART_POLYGONS; extern const TestData STEGOSAUR_POLYGONS; extern const TestDataEx PRINTER_PART_POLYGONS_EX; #endif // PRINTER_PARTS_H libnest2d-5.0.0/tools/svgtools.hpp000066400000000000000000000073301422601530300171320ustar00rootroot00000000000000#ifndef SVGTOOLS_HPP #define SVGTOOLS_HPP #include #include #include #include namespace libnest2d { namespace svg { template class SVGWriter { using Item = _Item; using Coord = TCoord>; using Box = _Box>; using PackGroup = _PackGroup; public: enum OrigoLocation { TOPLEFT, BOTTOMLEFT }; struct Config { OrigoLocation origo_location; Coord mm_in_coord_units; double width, height; Config(): origo_location(BOTTOMLEFT), mm_in_coord_units(1000000), width(500), height(500) {} }; private: Config conf_; std::vector svg_layers_; bool finished_ = false; public: SVGWriter(const Config& conf = Config()): conf_(conf) {} void setSize(const Box& box) { conf_.height = static_cast(box.height()) / conf_.mm_in_coord_units; conf_.width = static_cast(box.width()) / conf_.mm_in_coord_units; } void writeItem(const Item& item) { if(svg_layers_.empty()) addLayer(); auto tsh = item.transformedShape(); if(conf_.origo_location == BOTTOMLEFT) { auto d = static_cast( std::round(conf_.height*conf_.mm_in_coord_units) ); auto& contour = shapelike::contour(tsh); for(auto& v : contour) setY(v, -getY(v) + d); auto& holes = shapelike::holes(tsh); for(auto& h : holes) for(auto& v : h) setY(v, -getY(v) + d); } currentLayer() += shapelike::serialize(tsh, 1.0/conf_.mm_in_coord_units) + "\n"; } void writePackGroup(const PackGroup& result) { for(auto r : result) { addLayer(); for(Item& sh : r) { writeItem(sh); } finishLayer(); } } template void writeItems(ItemIt from, ItemIt to) { auto it = from; PackGroup pg; while(it != to) { if(it->binId() == BIN_ID_UNSET) continue; while(pg.size() <= size_t(it->binId())) pg.emplace_back(); pg[it->binId()].emplace_back(*it); ++it; } writePackGroup(pg); } void addLayer() { svg_layers_.emplace_back(header()); finished_ = false; } void finishLayer() { currentLayer() += "\n\n"; finished_ = true; } void save(const std::string& filepath) { size_t lyrc = svg_layers_.size() > 1? 1 : 0; size_t last = svg_layers_.size() > 1? svg_layers_.size() : 0; for(auto& lyr : svg_layers_) { std::fstream out(filepath + (lyrc > 0? std::to_string(lyrc) : "") + ".svg", std::fstream::out); if(out.is_open()) out << lyr; if(lyrc == last && !finished_) out << "\n\n"; out.flush(); out.close(); lyrc++; }; } private: std::string& currentLayer() { return svg_layers_.back(); } const std::string header() const { std::string svg_header = R"raw( )raw"; return svg_header; } }; } } #endif // SVGTOOLS_HPP ��������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������