├── CMakeLists.txt
├── LICENSE
├── README.md
├── RoundCornerBox
    ├── CMakeLists.txt
    ├── RoundCornerBox.hpp
    └── main.cpp
└── cmake
    └── FindEigen3.cmake


/CMakeLists.txt:
--------------------------------------------------------------------------------
 1 | # Cmake 2.6.0 is missing a few macros that FindEigen3.cmake uses
 2 | cmake_minimum_required (VERSION 2.6.2)
 3 | 
 4 | project (RoundCornerBox)
 5 | 
 6 | set(CMAKE_INSTALL_PREFIX "${CMAKE_SOURCE_DIR}/install")
 7 | 
 8 | # Initialize the build type (Release, Debug, etc)
 9 | if (NOT CMAKE_BUILD_TYPE)
10 |   set (CMAKE_BUILD_TYPE Debug CACHE STRING
11 |     "Choose the type of build, options are: Debug Release."
12 |     FORCE)
13 | endif (NOT CMAKE_BUILD_TYPE)
14 | 
15 | add_definitions (-DCMAKE_BUILD_TYPE="${CMAKE_BUILD_TYPE}")
16 | 
17 | # Add warnings to the compiler flags
18 | set (CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -Wextra -Wno-unused -std=c++11")
19 | 
20 | if (CMAKE_BUILD_TYPE MATCHES Debug)
21 |   add_definitions (-DDEBUG -DEIGEN_DONT_ALIGN -DEIGEN_DONT_VECTORIZE)
22 | endif (CMAKE_BUILD_TYPE MATCHES Debug)
23 | 
24 | if (CMAKE_BUILD_TYPE MATCHES Release)
25 |   add_definitions (-DNDEBUG)
26 |   set (CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -msse2")
27 | endif (CMAKE_BUILD_TYPE MATCHES Release)
28 | 
29 | # Add directory with macros
30 | set (CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} ${PROJECT_SOURCE_DIR}/cmake)
31 | 
32 | # don't build in the source directory
33 | if ("${CMAKE_BINARY_DIR}" STREQUAL "${CMAKE_SOURCE_DIR}")
34 |   message (SEND_ERROR "Do not build in the source directory.")
35 |   message (FATAL_ERROR "Remove the created \"CMakeCache.txt\" file and the \"CMakeFiles\" directory, then create a build directory and call \"${CMAKE_COMMAND} <path to the sources>\".")
36 | endif ("${CMAKE_BINARY_DIR}" STREQUAL "${CMAKE_SOURCE_DIR}")
37 | 
38 | # finds all files with a given extension
39 | macro (append_files files ext)
40 |   foreach (dir ${ARGN})
41 |     file (GLOB _files "${dir}/*.${ext}")
42 |     list (APPEND ${files} ${_files})
43 |   endforeach (dir)
44 | endmacro (append_files)
45 | 
46 | # Eigen3 library is required
47 | find_package (Eigen3 REQUIRED)
48 | if (EIGEN3_FOUND)
49 |   include_directories (${EIGEN3_INCLUDE_DIR})
50 | else (EIGEN3_FOUND)
51 |   message (SEND_ERROR "Unable to locate Eigen3")
52 | endif (EIGEN3_FOUND)
53 | 
54 | include_directories (${CMAKE_CURRENT_SOURCE_DIR})
55 | add_subdirectory (RoundCornerBox)


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 | Mozilla Public License Version 2.0
  2 | ==================================
  3 | 
  4 | 1. Definitions
  5 | --------------
  6 | 
  7 | 1.1. "Contributor"
  8 |     means each individual or legal entity that creates, contributes to
  9 |     the creation of, or owns Covered Software.
 10 | 
 11 | 1.2. "Contributor Version"
 12 |     means the combination of the Contributions of others (if any) used
 13 |     by a Contributor and that particular Contributor's Contribution.
 14 | 
 15 | 1.3. "Contribution"
 16 |     means Covered Software of a particular Contributor.
 17 | 
 18 | 1.4. "Covered Software"
 19 |     means Source Code Form to which the initial Contributor has attached
 20 |     the notice in Exhibit A, the Executable Form of such Source Code
 21 |     Form, and Modifications of such Source Code Form, in each case
 22 |     including portions thereof.
 23 | 
 24 | 1.5. "Incompatible With Secondary Licenses"
 25 |     means
 26 | 
 27 |     (a) that the initial Contributor has attached the notice described
 28 |         in Exhibit B to the Covered Software; or
 29 | 
 30 |     (b) that the Covered Software was made available under the terms of
 31 |         version 1.1 or earlier of the License, but not also under the
 32 |         terms of a Secondary License.
 33 | 
 34 | 1.6. "Executable Form"
 35 |     means any form of the work other than Source Code Form.
 36 | 
 37 | 1.7. "Larger Work"
 38 |     means a work that combines Covered Software with other material, in
 39 |     a separate file or files, that is not Covered Software.
 40 | 
 41 | 1.8. "License"
 42 |     means this document.
 43 | 
 44 | 1.9. "Licensable"
 45 |     means having the right to grant, to the maximum extent possible,
 46 |     whether at the time of the initial grant or subsequently, any and
 47 |     all of the rights conveyed by this License.
 48 | 
 49 | 1.10. "Modifications"
 50 |     means any of the following:
 51 | 
 52 |     (a) any file in Source Code Form that results from an addition to,
 53 |         deletion from, or modification of the contents of Covered
 54 |         Software; or
 55 | 
 56 |     (b) any new file in Source Code Form that contains any Covered
 57 |         Software.
 58 | 
 59 | 1.11. "Patent Claims" of a Contributor
 60 |     means any patent claim(s), including without limitation, method,
 61 |     process, and apparatus claims, in any patent Licensable by such
 62 |     Contributor that would be infringed, but for the grant of the
 63 |     License, by the making, using, selling, offering for sale, having
 64 |     made, import, or transfer of either its Contributions or its
 65 |     Contributor Version.
 66 | 
 67 | 1.12. "Secondary License"
 68 |     means either the GNU General Public License, Version 2.0, the GNU
 69 |     Lesser General Public License, Version 2.1, the GNU Affero General
 70 |     Public License, Version 3.0, or any later versions of those
 71 |     licenses.
 72 | 
 73 | 1.13. "Source Code Form"
 74 |     means the form of the work preferred for making modifications.
 75 | 
 76 | 1.14. "You" (or "Your")
 77 |     means an individual or a legal entity exercising rights under this
 78 |     License. For legal entities, "You" includes any entity that
 79 |     controls, is controlled by, or is under common control with You. For
 80 |     purposes of this definition, "control" means (a) the power, direct
 81 |     or indirect, to cause the direction or management of such entity,
 82 |     whether by contract or otherwise, or (b) ownership of more than
 83 |     fifty percent (50%) of the outstanding shares or beneficial
 84 |     ownership of such entity.
 85 | 
 86 | 2. License Grants and Conditions
 87 | --------------------------------
 88 | 
 89 | 2.1. Grants
 90 | 
 91 | Each Contributor hereby grants You a world-wide, royalty-free,
 92 | non-exclusive license:
 93 | 
 94 | (a) under intellectual property rights (other than patent or trademark)
 95 |     Licensable by such Contributor to use, reproduce, make available,
 96 |     modify, display, perform, distribute, and otherwise exploit its
 97 |     Contributions, either on an unmodified basis, with Modifications, or
 98 |     as part of a Larger Work; and
 99 | 
100 | (b) under Patent Claims of such Contributor to make, use, sell, offer
101 |     for sale, have made, import, and otherwise transfer either its
102 |     Contributions or its Contributor Version.
103 | 
104 | 2.2. Effective Date
105 | 
106 | The licenses granted in Section 2.1 with respect to any Contribution
107 | become effective for each Contribution on the date the Contributor first
108 | distributes such Contribution.
109 | 
110 | 2.3. Limitations on Grant Scope
111 | 
112 | The licenses granted in this Section 2 are the only rights granted under
113 | this License. No additional rights or licenses will be implied from the
114 | distribution or licensing of Covered Software under this License.
115 | Notwithstanding Section 2.1(b) above, no patent license is granted by a
116 | Contributor:
117 | 
118 | (a) for any code that a Contributor has removed from Covered Software;
119 |     or
120 | 
121 | (b) for infringements caused by: (i) Your and any other third party's
122 |     modifications of Covered Software, or (ii) the combination of its
123 |     Contributions with other software (except as part of its Contributor
124 |     Version); or
125 | 
126 | (c) under Patent Claims infringed by Covered Software in the absence of
127 |     its Contributions.
128 | 
129 | This License does not grant any rights in the trademarks, service marks,
130 | or logos of any Contributor (except as may be necessary to comply with
131 | the notice requirements in Section 3.4).
132 | 
133 | 2.4. Subsequent Licenses
134 | 
135 | No Contributor makes additional grants as a result of Your choice to
136 | distribute the Covered Software under a subsequent version of this
137 | License (see Section 10.2) or under the terms of a Secondary License (if
138 | permitted under the terms of Section 3.3).
139 | 
140 | 2.5. Representation
141 | 
142 | Each Contributor represents that the Contributor believes its
143 | Contributions are its original creation(s) or it has sufficient rights
144 | to grant the rights to its Contributions conveyed by this License.
145 | 
146 | 2.6. Fair Use
147 | 
148 | This License is not intended to limit any rights You have under
149 | applicable copyright doctrines of fair use, fair dealing, or other
150 | equivalents.
151 | 
152 | 2.7. Conditions
153 | 
154 | Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
155 | in Section 2.1.
156 | 
157 | 3. Responsibilities
158 | -------------------
159 | 
160 | 3.1. Distribution of Source Form
161 | 
162 | All distribution of Covered Software in Source Code Form, including any
163 | Modifications that You create or to which You contribute, must be under
164 | the terms of this License. You must inform recipients that the Source
165 | Code Form of the Covered Software is governed by the terms of this
166 | License, and how they can obtain a copy of this License. You may not
167 | attempt to alter or restrict the recipients' rights in the Source Code
168 | Form.
169 | 
170 | 3.2. Distribution of Executable Form
171 | 
172 | If You distribute Covered Software in Executable Form then:
173 | 
174 | (a) such Covered Software must also be made available in Source Code
175 |     Form, as described in Section 3.1, and You must inform recipients of
176 |     the Executable Form how they can obtain a copy of such Source Code
177 |     Form by reasonable means in a timely manner, at a charge no more
178 |     than the cost of distribution to the recipient; and
179 | 
180 | (b) You may distribute such Executable Form under the terms of this
181 |     License, or sublicense it under different terms, provided that the
182 |     license for the Executable Form does not attempt to limit or alter
183 |     the recipients' rights in the Source Code Form under this License.
184 | 
185 | 3.3. Distribution of a Larger Work
186 | 
187 | You may create and distribute a Larger Work under terms of Your choice,
188 | provided that You also comply with the requirements of this License for
189 | the Covered Software. If the Larger Work is a combination of Covered
190 | Software with a work governed by one or more Secondary Licenses, and the
191 | Covered Software is not Incompatible With Secondary Licenses, this
192 | License permits You to additionally distribute such Covered Software
193 | under the terms of such Secondary License(s), so that the recipient of
194 | the Larger Work may, at their option, further distribute the Covered
195 | Software under the terms of either this License or such Secondary
196 | License(s).
197 | 
198 | 3.4. Notices
199 | 
200 | You may not remove or alter the substance of any license notices
201 | (including copyright notices, patent notices, disclaimers of warranty,
202 | or limitations of liability) contained within the Source Code Form of
203 | the Covered Software, except that You may alter any license notices to
204 | the extent required to remedy known factual inaccuracies.
205 | 
206 | 3.5. Application of Additional Terms
207 | 
208 | You may choose to offer, and to charge a fee for, warranty, support,
209 | indemnity or liability obligations to one or more recipients of Covered
210 | Software. However, You may do so only on Your own behalf, and not on
211 | behalf of any Contributor. You must make it absolutely clear that any
212 | such warranty, support, indemnity, or liability obligation is offered by
213 | You alone, and You hereby agree to indemnify every Contributor for any
214 | liability incurred by such Contributor as a result of warranty, support,
215 | indemnity or liability terms You offer. You may include additional
216 | disclaimers of warranty and limitations of liability specific to any
217 | jurisdiction.
218 | 
219 | 4. Inability to Comply Due to Statute or Regulation
220 | ---------------------------------------------------
221 | 
222 | If it is impossible for You to comply with any of the terms of this
223 | License with respect to some or all of the Covered Software due to
224 | statute, judicial order, or regulation then You must: (a) comply with
225 | the terms of this License to the maximum extent possible; and (b)
226 | describe the limitations and the code they affect. Such description must
227 | be placed in a text file included with all distributions of the Covered
228 | Software under this License. Except to the extent prohibited by statute
229 | or regulation, such description must be sufficiently detailed for a
230 | recipient of ordinary skill to be able to understand it.
231 | 
232 | 5. Termination
233 | --------------
234 | 
235 | 5.1. The rights granted under this License will terminate automatically
236 | if You fail to comply with any of its terms. However, if You become
237 | compliant, then the rights granted under this License from a particular
238 | Contributor are reinstated (a) provisionally, unless and until such
239 | Contributor explicitly and finally terminates Your grants, and (b) on an
240 | ongoing basis, if such Contributor fails to notify You of the
241 | non-compliance by some reasonable means prior to 60 days after You have
242 | come back into compliance. Moreover, Your grants from a particular
243 | Contributor are reinstated on an ongoing basis if such Contributor
244 | notifies You of the non-compliance by some reasonable means, this is the
245 | first time You have received notice of non-compliance with this License
246 | from such Contributor, and You become compliant prior to 30 days after
247 | Your receipt of the notice.
248 | 
249 | 5.2. If You initiate litigation against any entity by asserting a patent
250 | infringement claim (excluding declaratory judgment actions,
251 | counter-claims, and cross-claims) alleging that a Contributor Version
252 | directly or indirectly infringes any patent, then the rights granted to
253 | You by any and all Contributors for the Covered Software under Section
254 | 2.1 of this License shall terminate.
255 | 
256 | 5.3. In the event of termination under Sections 5.1 or 5.2 above, all
257 | end user license agreements (excluding distributors and resellers) which
258 | have been validly granted by You or Your distributors under this License
259 | prior to termination shall survive termination.
260 | 
261 | ************************************************************************
262 | *                                                                      *
263 | *  6. Disclaimer of Warranty                                           *
264 | *  -------------------------                                           *
265 | *                                                                      *
266 | *  Covered Software is provided under this License on an "as is"       *
267 | *  basis, without warranty of any kind, either expressed, implied, or  *
268 | *  statutory, including, without limitation, warranties that the       *
269 | *  Covered Software is free of defects, merchantable, fit for a        *
270 | *  particular purpose or non-infringing. The entire risk as to the     *
271 | *  quality and performance of the Covered Software is with You.        *
272 | *  Should any Covered Software prove defective in any respect, You     *
273 | *  (not any Contributor) assume the cost of any necessary servicing,   *
274 | *  repair, or correction. This disclaimer of warranty constitutes an   *
275 | *  essential part of this License. No use of any Covered Software is   *
276 | *  authorized under this License except under this disclaimer.         *
277 | *                                                                      *
278 | ************************************************************************
279 | 
280 | ************************************************************************
281 | *                                                                      *
282 | *  7. Limitation of Liability                                          *
283 | *  --------------------------                                          *
284 | *                                                                      *
285 | *  Under no circumstances and under no legal theory, whether tort      *
286 | *  (including negligence), contract, or otherwise, shall any           *
287 | *  Contributor, or anyone who distributes Covered Software as          *
288 | *  permitted above, be liable to You for any direct, indirect,         *
289 | *  special, incidental, or consequential damages of any character      *
290 | *  including, without limitation, damages for lost profits, loss of    *
291 | *  goodwill, work stoppage, computer failure or malfunction, or any    *
292 | *  and all other commercial damages or losses, even if such party      *
293 | *  shall have been informed of the possibility of such damages. This   *
294 | *  limitation of liability shall not apply to liability for death or   *
295 | *  personal injury resulting from such party's negligence to the       *
296 | *  extent applicable law prohibits such limitation. Some               *
297 | *  jurisdictions do not allow the exclusion or limitation of           *
298 | *  incidental or consequential damages, so this exclusion and          *
299 | *  limitation may not apply to You.                                    *
300 | *                                                                      *
301 | ************************************************************************
302 | 
303 | 8. Litigation
304 | -------------
305 | 
306 | Any litigation relating to this License may be brought only in the
307 | courts of a jurisdiction where the defendant maintains its principal
308 | place of business and such litigation shall be governed by laws of that
309 | jurisdiction, without reference to its conflict-of-law provisions.
310 | Nothing in this Section shall prevent a party's ability to bring
311 | cross-claims or counter-claims.
312 | 
313 | 9. Miscellaneous
314 | ----------------
315 | 
316 | This License represents the complete agreement concerning the subject
317 | matter hereof. If any provision of this License is held to be
318 | unenforceable, such provision shall be reformed only to the extent
319 | necessary to make it enforceable. Any law or regulation which provides
320 | that the language of a contract shall be construed against the drafter
321 | shall not be used to construe this License against a Contributor.
322 | 
323 | 10. Versions of the License
324 | ---------------------------
325 | 
326 | 10.1. New Versions
327 | 
328 | Mozilla Foundation is the license steward. Except as provided in Section
329 | 10.3, no one other than the license steward has the right to modify or
330 | publish new versions of this License. Each version will be given a
331 | distinguishing version number.
332 | 
333 | 10.2. Effect of New Versions
334 | 
335 | You may distribute the Covered Software under the terms of the version
336 | of the License under which You originally received the Covered Software,
337 | or under the terms of any subsequent version published by the license
338 | steward.
339 | 
340 | 10.3. Modified Versions
341 | 
342 | If you create software not governed by this License, and you want to
343 | create a new license for such software, you may create and use a
344 | modified version of this License if you rename the license and remove
345 | any references to the name of the license steward (except to note that
346 | such modified license differs from this License).
347 | 
348 | 10.4. Distributing Source Code Form that is Incompatible With Secondary
349 | Licenses
350 | 
351 | If You choose to distribute Source Code Form that is Incompatible With
352 | Secondary Licenses under the terms of this version of the License, the
353 | notice described in Exhibit B of this License must be attached.
354 | 
355 | Exhibit A - Source Code Form License Notice
356 | -------------------------------------------
357 | 
358 |   This Source Code Form is subject to the terms of the Mozilla Public
359 |   License, v. 2.0. If a copy of the MPL was not distributed with this
360 |   file, You can obtain one at http://mozilla.org/MPL/2.0/.
361 | 
362 | If it is not possible or desirable to put the notice in a particular
363 | file, then You may include the notice in a location (such as a LICENSE
364 | file in a relevant directory) where a recipient would be likely to look
365 | for such a notice.
366 | 
367 | You may add additional accurate notices of copyright ownership.
368 | 
369 | Exhibit B - "Incompatible With Secondary Licenses" Notice
370 | ---------------------------------------------------------
371 | 
372 |   This Source Code Form is "Incompatible With Secondary Licenses", as
373 |   defined by the Mozilla Public License, v. 2.0.
374 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # Rounded Corner Box
 2 | A Single C++ Header Generating 3D Triangulated Rounded-Corner Boxes
 3 | 
 4 | This is an Eigen-based, header-only library for generating a 3D triangulated mesh of rounded-corner box centered at zero point. The input parameters to the class are number of subdivision, size of box, radius of the rounded corner. The output are the vertices, normal vectors and indices of the rounded-corner box.
 5 | 
 6 | ![alt tag](http://www.columbia.edu/~yf2320/cornerbox.png)
 7 | 
 8 | Dependency:
 9 | Eigen (http://eigen.tuxfamily.org/)
10 | 
11 | Usage:
12 | Include RoundCornerBox.hpp inside your code. See main.cpp for an example. 
13 | 
14 | To compile the example:
15 | mkdir build && cd build && cmake .. && make
16 | 
17 | To run the example:
18 | cd RoundCornerBox && ./RoundCornerBox 4 1.0 0.5 0.2 0.1 cornerbox.obj


--------------------------------------------------------------------------------
/RoundCornerBox/CMakeLists.txt:
--------------------------------------------------------------------------------
1 | append_files (Headers "hpp" .)
2 | append_files (Sources "cpp" .)
3 | 
4 | add_executable (RoundCornerBox ${Headers} ${Sources})
5 | 
6 | INSTALL_TARGETS(/bin RoundCornerBox)
7 | 


--------------------------------------------------------------------------------
/RoundCornerBox/RoundCornerBox.hpp:
--------------------------------------------------------------------------------
  1 | // This file is part of RoundCornerBox, a single c++ header for the creation of
  2 | // round-corner boxes.
  3 | //
  4 | // Copyright (C) 2016 Raymond Fei <fyun@acm.org>
  5 | //
  6 | // This Source Code Form is subject to the terms of the Mozilla Public License
  7 | // v. 2.0. If a copy of the MPL was not distributed with this file, You can
  8 | // obtain one at http://mozilla.org/MPL/2.0/.
  9 | 
 10 | #ifndef RoundCornerBox_hpp
 11 | #define RoundCornerBox_hpp
 12 | 
 13 | #include <Eigen/Core>
 14 | #include <vector>
 15 | #include <string>
 16 | #include <fstream>
 17 | 
 18 | using namespace Eigen;
 19 | 
 20 | class RoundCornerBox
 21 | {
 22 | protected:
 23 |   std::vector<int> m_index_to_verts;
 24 |   double m_radius;
 25 |   int m_N_edge;
 26 |   inline void AddVertex(int i, int j, int k, const Vector3d& pos, const Vector3d& base_pos)
 27 |   {
 28 |     int pidx = k * m_N_edge * m_N_edge + j * m_N_edge + i;
 29 |     if(m_index_to_verts[pidx] < 0) {
 30 |       int next_idx = (int) vertices.size();
 31 |       m_index_to_verts[pidx] = next_idx;
 32 |       
 33 |       Vector3d dir = pos - base_pos;
 34 |       if(dir.norm() > 0.0) {
 35 |         dir.normalize();
 36 |         vertices.push_back(base_pos + dir * m_radius);
 37 |         normals.push_back(dir);
 38 |       } else {
 39 |         vertices.push_back(pos);
 40 |         normals.push_back(pos.normalized());
 41 |       }
 42 |     }
 43 |   }
 44 |   inline int translateIndices(int i, int j, int k)
 45 |   {
 46 |     int pidx = k * m_N_edge * m_N_edge + j * m_N_edge + i;
 47 |     return m_index_to_verts[pidx];
 48 |   }
 49 |   inline void AddFace(int i, int j, int k, bool inversed)
 50 |   {
 51 |     if(inversed)
 52 |     {
 53 |       indices.push_back(Vector3i(i, k, j));
 54 |     } else {
 55 |       indices.push_back(Vector3i(i, j, k));
 56 |     }
 57 |   }
 58 |   
 59 | public:
 60 |   std::vector<Vector3d> vertices;
 61 |   std::vector<Vector3d> normals;
 62 |   std::vector<Vector3i> indices;
 63 |   
 64 |   inline void Create(int N, const Vector3d& b, const double& radius)
 65 |   {
 66 |     int N_edge = 2 * (N + 1);
 67 |     m_N_edge = N_edge;
 68 |     m_index_to_verts.resize(N_edge * N_edge * N_edge, -1);
 69 |     m_radius = radius;
 70 |     double dx = radius / (double) N;
 71 |     
 72 |     const double sign[2] = {-1.0, 1.0};
 73 |     const int ks[2] = {0, N * 2 + 1};
 74 |     
 75 |     // xy-planes
 76 |     for(int kidx = 0; kidx < 2; ++kidx) {
 77 |       const int k = ks[kidx];
 78 |       Vector3d origin = Vector3d(-b(0) - radius, -b(1) - radius, (b(2) + radius) * sign[kidx]);
 79 |       for(int j = 0; j <= N; ++j) for(int i = 0; i <= N; ++i)
 80 |       {
 81 |         Vector3d pos = origin + Vector3d(dx * i, dx * j, 0.0);
 82 |         AddVertex(i, j, k, pos, Vector3d(-b(0), -b(1), b(2) * sign[kidx]));
 83 |         
 84 |         pos = origin + Vector3d(dx * i + 2.0 * b(0) + radius, dx * j, 0.0);
 85 |         AddVertex(i + N + 1, j, k, pos, Vector3d(b(0), -b(1), b(2) * sign[kidx]));
 86 |         
 87 |         pos = origin + Vector3d(dx * i + 2.0 * b(0) + radius, dx * j + 2.0 * b(1) + radius, 0.0);
 88 |         AddVertex(i + N + 1, j + N + 1, k, pos, Vector3d(b(0), b(1), b(2) * sign[kidx]));
 89 |         
 90 |         pos = origin + Vector3d(dx * i, dx * j + 2.0 * b(1) + radius, 0.0);
 91 |         AddVertex(i, j + N + 1, k, pos, Vector3d(-b(0), b(1), b(2) * sign[kidx]));
 92 |       }
 93 |       // corners
 94 |       for(int j = 0; j < N; ++j) for(int i = 0; i < N; ++i)
 95 |       {
 96 |         AddFace(translateIndices(i, j, k),
 97 |                 translateIndices(i + 1, j + 1, k),
 98 |                 translateIndices(i, j + 1, k), kidx == 0);
 99 |         AddFace(translateIndices(i, j, k),
100 |                 translateIndices(i + 1, j, k),
101 |                 translateIndices(i + 1, j + 1, k), kidx == 0);
102 |         
103 |         AddFace(translateIndices(i, j + N + 1, k),
104 |                 translateIndices(i + 1, j + N + 2, k),
105 |                 translateIndices(i, j + N + 2, k), kidx == 0);
106 |         AddFace(translateIndices(i, j + N + 1, k),
107 |                 translateIndices(i + 1, j + N + 1, k),
108 |                 translateIndices(i + 1, j + N + 2, k), kidx == 0);
109 |         
110 |         AddFace(translateIndices(i + N + 1, j + N + 1, k),
111 |                 translateIndices(i + N + 2, j + N + 2, k),
112 |                 translateIndices(i + N + 1, j + N + 2, k), kidx == 0);
113 |         AddFace(translateIndices(i + N + 1, j + N + 1, k),
114 |                 translateIndices(i + N + 2, j + N + 1, k),
115 |                 translateIndices(i + N + 2, j + N + 2, k), kidx == 0);
116 |         
117 |         AddFace(translateIndices(i + N + 1, j, k),
118 |                 translateIndices(i + N + 2, j + 1, k),
119 |                 translateIndices(i + N + 1, j + 1, k), kidx == 0);
120 |         AddFace(translateIndices(i + N + 1, j, k),
121 |                 translateIndices(i + N + 2, j, k),
122 |                 translateIndices(i + N + 2, j + 1, k), kidx == 0);
123 |       }
124 |       // sides
125 |       for(int i = 0; i < N; ++i)
126 |       {
127 |         AddFace(translateIndices(i, N, k),
128 |                 translateIndices(i + 1, N + 1, k),
129 |                 translateIndices(i, N + 1, k), kidx == 0);
130 |         AddFace(translateIndices(i, N, k),
131 |                 translateIndices(i + 1, N, k),
132 |                 translateIndices(i + 1, N + 1, k), kidx == 0);
133 |         
134 |         AddFace(translateIndices(N, i, k),
135 |                 translateIndices(N + 1, i + 1, k),
136 |                 translateIndices(N, i + 1, k), kidx == 0);
137 |         AddFace(translateIndices(N, i, k),
138 |                 translateIndices(N + 1, i, k),
139 |                 translateIndices(N + 1, i + 1, k), kidx == 0);
140 |         
141 |         AddFace(translateIndices(i + N + 1, N, k),
142 |                 translateIndices(i + N + 2, N + 1, k),
143 |                 translateIndices(i + N + 1, N + 1, k), kidx == 0);
144 |         AddFace(translateIndices(i + N + 1, N, k),
145 |                 translateIndices(i + N + 2, N, k),
146 |                 translateIndices(i + N + 2, N + 1, k), kidx == 0);
147 |         
148 |         AddFace(translateIndices(N, i + N + 1, k),
149 |                 translateIndices(N + 1, i + N + 2, k),
150 |                 translateIndices(N, i + N + 2, k), kidx == 0);
151 |         AddFace(translateIndices(N, i + N + 1, k),
152 |                 translateIndices(N + 1, i + N + 1, k),
153 |                 translateIndices(N + 1, i + N + 2, k), kidx == 0);
154 |       }
155 |       // central
156 |       AddFace(translateIndices(N, N, k),
157 |               translateIndices(N + 1, N + 1, k),
158 |               translateIndices(N, N + 1, k), kidx == 0);
159 |       AddFace(translateIndices(N, N, k),
160 |               translateIndices(N + 1, N, k),
161 |               translateIndices(N + 1, N + 1, k), kidx == 0);
162 |     }
163 |     
164 |     // xz-planes
165 |     for(int kidx = 0; kidx < 2; ++kidx) {
166 |       const int k = ks[kidx];
167 |       Vector3d origin = Vector3d(-b(0) - radius, (b(1) + radius) * sign[kidx], -b(2) - radius);
168 |       for(int j = 0; j <= N; ++j) for(int i = 0; i <= N; ++i)
169 |       {
170 |         Vector3d pos = origin + Vector3d(dx * i, 0.0, dx * j);
171 |         AddVertex(i, k, j, pos, Vector3d(-b(0), b(1) * sign[kidx], -b(2)));
172 |         
173 |         pos = origin + Vector3d(dx * i + 2.0 * b(0) + radius, 0.0, dx * j);
174 |         AddVertex(i + N + 1, k, j, pos, Vector3d(b(0), b(1) * sign[kidx], -b(2)));
175 |         
176 |         pos = origin + Vector3d(dx * i + 2.0 * b(0) + radius, 0.0, dx * j + 2.0 * b(2) + radius);
177 |         AddVertex(i + N + 1, k, j + N + 1, pos, Vector3d(b(0), b(1) * sign[kidx], b(2)));
178 |         
179 |         pos = origin + Vector3d(dx * i, 0.0, dx * j + 2.0 * b(2) + radius);
180 |         AddVertex(i, k, j + N + 1, pos, Vector3d(-b(0), b(1) * sign[kidx], b(2)));
181 |       }
182 |       // corners
183 |       for(int j = 0; j < N; ++j) for(int i = 0; i < N; ++i)
184 |       {
185 |         AddFace(translateIndices(i, k, j),
186 |                 translateIndices(i + 1, k, j + 1),
187 |                 translateIndices(i, k, j + 1), kidx == 1);
188 |         AddFace(translateIndices(i, k, j),
189 |                 translateIndices(i + 1, k, j),
190 |                 translateIndices(i + 1, k, j + 1), kidx == 1);
191 |         
192 |         AddFace(translateIndices(i, k, j + N + 1),
193 |                 translateIndices(i + 1, k, j + N + 2),
194 |                 translateIndices(i, k, j + N + 2), kidx == 1);
195 |         AddFace(translateIndices(i, k, j + N + 1),
196 |                 translateIndices(i + 1, k, j + N + 1),
197 |                 translateIndices(i + 1, k, j + N + 2), kidx == 1);
198 |         
199 |         AddFace(translateIndices(i + N + 1, k, j + N + 1),
200 |                 translateIndices(i + N + 2, k, j + N + 2),
201 |                 translateIndices(i + N + 1, k, j + N + 2), kidx == 1);
202 |         AddFace(translateIndices(i + N + 1, k, j + N + 1),
203 |                 translateIndices(i + N + 2, k, j + N + 1),
204 |                 translateIndices(i + N + 2, k, j + N + 2), kidx == 1);
205 |         
206 |         AddFace(translateIndices(i + N + 1, k, j),
207 |                 translateIndices(i + N + 2, k, j + 1),
208 |                 translateIndices(i + N + 1, k, j + 1), kidx == 1);
209 |         AddFace(translateIndices(i + N + 1, k, j),
210 |                 translateIndices(i + N + 2, k, j),
211 |                 translateIndices(i + N + 2, k, j + 1), kidx == 1);
212 |       }
213 |       // sides
214 |       for(int i = 0; i < N; ++i)
215 |       {
216 |         AddFace(translateIndices(i, k, N),
217 |                 translateIndices(i + 1, k, N + 1),
218 |                 translateIndices(i, k, N + 1), kidx == 1);
219 |         AddFace(translateIndices(i, k, N),
220 |                 translateIndices(i + 1, k, N),
221 |                 translateIndices(i + 1, k, N + 1), kidx == 1);
222 |         
223 |         AddFace(translateIndices(N, k, i),
224 |                 translateIndices(N + 1, k, i + 1),
225 |                 translateIndices(N, k, i + 1), kidx == 1);
226 |         AddFace(translateIndices(N, k, i),
227 |                 translateIndices(N + 1, k, i),
228 |                 translateIndices(N + 1, k, i + 1), kidx == 1);
229 |         
230 |         AddFace(translateIndices(i + N + 1, k, N),
231 |                 translateIndices(i + N + 2, k, N + 1),
232 |                 translateIndices(i + N + 1, k, N + 1), kidx == 1);
233 |         AddFace(translateIndices(i + N + 1, k, N),
234 |                 translateIndices(i + N + 2, k, N),
235 |                 translateIndices(i + N + 2, k, N + 1), kidx == 1);
236 |         
237 |         AddFace(translateIndices(N, k, i + N + 1),
238 |                 translateIndices(N + 1, k, i + N + 2),
239 |                 translateIndices(N, k, i + N + 2), kidx == 1);
240 |         AddFace(translateIndices(N, k, i + N + 1),
241 |                 translateIndices(N + 1, k, i + N + 1),
242 |                 translateIndices(N + 1, k, i + N + 2), kidx == 1);
243 |       }
244 |       // central
245 |       AddFace(translateIndices(N, k, N),
246 |               translateIndices(N + 1, k, N + 1),
247 |               translateIndices(N, k, N + 1), kidx == 1);
248 |       AddFace(translateIndices(N, k, N),
249 |               translateIndices(N + 1, k, N),
250 |               translateIndices(N + 1, k, N + 1), kidx == 1);
251 |     }
252 |     
253 |     // yz-planes
254 |     for(int kidx = 0; kidx < 2; ++kidx) {
255 |       const int k = ks[kidx];
256 |       Vector3d origin = Vector3d((b(0) + radius) * sign[kidx], -b(1) - radius, -b(2) - radius);
257 |       for(int j = 0; j <= N; ++j) for(int i = 0; i <= N; ++i)
258 |       {
259 |         Vector3d pos = origin + Vector3d(0.0, dx * i, dx * j);
260 |         AddVertex(k, i, j, pos, Vector3d(b(0) * sign[kidx], -b(1), -b(2)));
261 |         
262 |         pos = origin + Vector3d(0.0, dx * i + 2.0 * b(1) + radius, dx * j);
263 |         AddVertex(k, i + N + 1, j, pos, Vector3d(b(0) * sign[kidx], b(1), -b(2)));
264 |         
265 |         pos = origin + Vector3d(0.0, dx * i + 2.0 * b(1) + radius, dx * j + 2.0 * b(2) + radius);
266 |         AddVertex(k, i + N + 1, j + N + 1, pos, Vector3d(b(0) * sign[kidx], b(1), b(2)));
267 |         
268 |         pos = origin + Vector3d(0.0, dx * i, dx * j + 2.0 * b(2) + radius);
269 |         AddVertex(k, i, j + N + 1, pos, Vector3d(b(0) * sign[kidx], -b(1), b(2)));
270 |       }
271 |       // corners
272 |       for(int j = 0; j < N; ++j) for(int i = 0; i < N; ++i)
273 |       {
274 |         AddFace(translateIndices(k, i, j),
275 |                 translateIndices(k, i + 1, j + 1),
276 |                 translateIndices(k, i, j + 1), kidx == 0);
277 |         AddFace(translateIndices(k, i, j),
278 |                 translateIndices(k, i + 1, j),
279 |                 translateIndices(k, i + 1, j + 1), kidx == 0);
280 |         
281 |         AddFace(translateIndices(k, i, j + N + 1),
282 |                 translateIndices(k, i + 1, j + N + 2),
283 |                 translateIndices(k, i, j + N + 2), kidx == 0);
284 |         AddFace(translateIndices(k, i, j + N + 1),
285 |                 translateIndices(k, i + 1, j + N + 1),
286 |                 translateIndices(k, i + 1, j + N + 2), kidx == 0);
287 |         
288 |         AddFace(translateIndices(k, i + N + 1, j + N + 1),
289 |                 translateIndices(k, i + N + 2, j + N + 2),
290 |                 translateIndices(k, i + N + 1, j + N + 2), kidx == 0);
291 |         AddFace(translateIndices(k, i + N + 1, j + N + 1),
292 |                 translateIndices(k, i + N + 2, j + N + 1),
293 |                 translateIndices(k, i + N + 2, j + N + 2), kidx == 0);
294 |         
295 |         AddFace(translateIndices(k, i + N + 1, j),
296 |                 translateIndices(k, i + N + 2, j + 1),
297 |                 translateIndices(k, i + N + 1, j + 1), kidx == 0);
298 |         AddFace(translateIndices(k, i + N + 1, j),
299 |                 translateIndices(k, i + N + 2, j),
300 |                 translateIndices(k, i + N + 2, j + 1), kidx == 0);
301 |       }
302 |       // sides
303 |       for(int i = 0; i < N; ++i)
304 |       {
305 |         AddFace(translateIndices(k, i, N),
306 |                 translateIndices(k, i + 1, N + 1),
307 |                 translateIndices(k, i, N + 1), kidx == 0);
308 |         AddFace(translateIndices(k, i, N),
309 |                 translateIndices(k, i + 1, N),
310 |                 translateIndices(k, i + 1, N + 1), kidx == 0);
311 |         
312 |         AddFace(translateIndices(k, N, i),
313 |                 translateIndices(k, N + 1, i + 1),
314 |                 translateIndices(k, N, i + 1), kidx == 0);
315 |         AddFace(translateIndices(k, N, i),
316 |                 translateIndices(k, N + 1, i),
317 |                 translateIndices(k, N + 1, i + 1), kidx == 0);
318 |         
319 |         AddFace(translateIndices(k, i + N + 1, N),
320 |                 translateIndices(k, i + N + 2, N + 1),
321 |                 translateIndices(k, i + N + 1, N + 1), kidx == 0);
322 |         AddFace(translateIndices(k, i + N + 1, N),
323 |                 translateIndices(k, i + N + 2, N),
324 |                 translateIndices(k, i + N + 2, N + 1), kidx == 0);
325 |         
326 |         AddFace(translateIndices(k, N, i + N + 1),
327 |                 translateIndices(k, N + 1,  i + N + 2),
328 |                 translateIndices(k, N, i + N + 2), kidx == 0);
329 |         AddFace(translateIndices(k, N, i + N + 1),
330 |                 translateIndices(k, N + 1, i + N + 1),
331 |                 translateIndices(k, N + 1, i + N + 2), kidx == 0);
332 |       }
333 |       // central
334 |       AddFace(translateIndices(k, N, N),
335 |               translateIndices(k, N + 1, N + 1),
336 |               translateIndices(k, N, N + 1), kidx == 0);
337 |       AddFace(translateIndices(k, N, N),
338 |               translateIndices(k, N + 1, N),
339 |               translateIndices(k, N + 1, N + 1), kidx == 0);
340 |     }
341 |   }
342 |   inline void WriteOBJ(const std::string& szfn) const
343 |   {
344 |     std::ofstream fout(szfn);
345 |     WriteOBJ(fout);
346 |     fout.close();
347 |   }
348 |   inline void WriteOBJ(std::ostream& str) const
349 |   {
350 |     // vertices
351 |     for(const Vector3d& v : vertices)
352 |     {
353 |       str << "v " << v.transpose() << std::endl;
354 |     }
355 |     
356 |     for(const Vector3d& n : normals)
357 |     {
358 |       str << "n " << n.transpose() << std::endl;
359 |     }
360 |     
361 |     for(const Vector3i& f : indices)
362 |     {
363 |       str << "f " << f(0)+1 << "//" << f(0)+1 << " " << f(1)+1 << "//" << f(1)+1 << " " << f(2)+1 << "//" << f(2)+1 << std::endl;
364 |     }
365 |   }
366 | };
367 | 
368 | 
369 | #endif /* CornerBox_hpp */
370 | 


--------------------------------------------------------------------------------
/RoundCornerBox/main.cpp:
--------------------------------------------------------------------------------
 1 | // This file shows the example usage of RoundCornerBox
 2 | //
 3 | // Copyright (C) 2016 Raymond Fei <fyun@acm.org>
 4 | //
 5 | // This Source Code Form is subject to the terms of the Mozilla Public License
 6 | // v. 2.0. If a copy of the MPL was not distributed with this file, You can
 7 | // obtain one at http://mozilla.org/MPL/2.0/.
 8 | 
 9 | #include "RoundCornerBox.hpp"
10 | #include <iostream>
11 | #include <sstream>
12 | 
13 | template<class T>
14 | bool extractFromString( const std::string& in_string, T& output )
15 | {
16 |   return (bool)(std::stringstream(in_string) >> output);
17 | }
18 | 
19 | int main(int argc, const char * argv[]) {
20 |   if(argc < 7) {
21 |     std::cout << "Usage: RoundCornerBox <N> <size.x> <size.y> <size.z> <radius> <filename>" << std::endl;
22 |     std::cout << "\tExample: ./RoundCornerBox 4 1.0 0.5 0.2 0.1 cornerbox.obj" << std::endl;
23 |     return 0;
24 |   }
25 |   
26 |   Vector3d s; // half-size
27 |   double r;   // round-corner radius
28 |   int N;      // half of the number of faces at one hinge
29 |   
30 |   extractFromString(std::string(argv[1]), N);
31 |   extractFromString(std::string(argv[2]), s(0));
32 |   extractFromString(std::string(argv[3]), s(1));
33 |   extractFromString(std::string(argv[4]), s(2));
34 |   extractFromString(std::string(argv[5]), r);
35 |   
36 |   RoundCornerBox cbc;
37 |   cbc.Create(N, s, r);
38 |   cbc.WriteOBJ(std::string(argv[6]));
39 |   return 0;
40 | }
41 | 


--------------------------------------------------------------------------------
/cmake/FindEigen3.cmake:
--------------------------------------------------------------------------------
 1 | # - Try to find Eigen3 lib
 2 | #
 3 | # This module supports requiring a minimum version, e.g. you can do
 4 | #   find_package(Eigen3 3.1.2)
 5 | # to require version 3.1.2 or newer of Eigen3.
 6 | #
 7 | # Once done this will define
 8 | #
 9 | #  EIGEN3_FOUND - system has eigen lib with correct version
10 | #  EIGEN3_INCLUDE_DIR - the eigen include directory
11 | #  EIGEN3_VERSION - eigen version
12 | 
13 | # Copyright (c) 2006, 2007 Montel Laurent, <montel@kde.org>
14 | # Copyright (c) 2008, 2009 Gael Guennebaud, <g.gael@free.fr>
15 | # Copyright (c) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
16 | # Redistribution and use is allowed according to the terms of the 2-clause BSD license.
17 | 
18 | if(NOT Eigen3_FIND_VERSION)
19 |   if(NOT Eigen3_FIND_VERSION_MAJOR)
20 |     set(Eigen3_FIND_VERSION_MAJOR 2)
21 |   endif(NOT Eigen3_FIND_VERSION_MAJOR)
22 |   if(NOT Eigen3_FIND_VERSION_MINOR)
23 |     set(Eigen3_FIND_VERSION_MINOR 91)
24 |   endif(NOT Eigen3_FIND_VERSION_MINOR)
25 |   if(NOT Eigen3_FIND_VERSION_PATCH)
26 |     set(Eigen3_FIND_VERSION_PATCH 0)
27 |   endif(NOT Eigen3_FIND_VERSION_PATCH)
28 | 
29 |   set(Eigen3_FIND_VERSION "${Eigen3_FIND_VERSION_MAJOR}.${Eigen3_FIND_VERSION_MINOR}.${Eigen3_FIND_VERSION_PATCH}")
30 | endif(NOT Eigen3_FIND_VERSION)
31 | 
32 | macro(_eigen3_check_version)
33 |   file(READ "${EIGEN3_INCLUDE_DIR}/Eigen/src/Core/util/Macros.h" _eigen3_version_header)
34 | 
35 |   string(REGEX MATCH "define[ \t]+EIGEN_WORLD_VERSION[ \t]+([0-9]+)" _eigen3_world_version_match "${_eigen3_version_header}")
36 |   set(EIGEN3_WORLD_VERSION "${CMAKE_MATCH_1}")
37 |   string(REGEX MATCH "define[ \t]+EIGEN_MAJOR_VERSION[ \t]+([0-9]+)" _eigen3_major_version_match "${_eigen3_version_header}")
38 |   set(EIGEN3_MAJOR_VERSION "${CMAKE_MATCH_1}")
39 |   string(REGEX MATCH "define[ \t]+EIGEN_MINOR_VERSION[ \t]+([0-9]+)" _eigen3_minor_version_match "${_eigen3_version_header}")
40 |   set(EIGEN3_MINOR_VERSION "${CMAKE_MATCH_1}")
41 | 
42 |   set(EIGEN3_VERSION ${EIGEN3_WORLD_VERSION}.${EIGEN3_MAJOR_VERSION}.${EIGEN3_MINOR_VERSION})
43 |   if(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
44 |     set(EIGEN3_VERSION_OK FALSE)
45 |   else(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
46 |     set(EIGEN3_VERSION_OK TRUE)
47 |   endif(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
48 | 
49 |   if(NOT EIGEN3_VERSION_OK)
50 | 
51 |     message(STATUS "Eigen3 version ${EIGEN3_VERSION} found in ${EIGEN3_INCLUDE_DIR}, "
52 |                    "but at least version ${Eigen3_FIND_VERSION} is required")
53 |   endif(NOT EIGEN3_VERSION_OK)
54 | endmacro(_eigen3_check_version)
55 | 
56 | if (EIGEN3_INCLUDE_DIR)
57 | 
58 |   # in cache already
59 |   _eigen3_check_version()
60 |   set(EIGEN3_FOUND ${EIGEN3_VERSION_OK})
61 | 
62 | else (EIGEN3_INCLUDE_DIR)
63 | 
64 |   find_path(EIGEN3_INCLUDE_DIR NAMES signature_of_eigen3_matrix_library
65 |       PATHS
66 |       ${CMAKE_SOURCE_DIR}/include
67 |       ${CMAKE_INSTALL_PREFIX}/include
68 |       ${KDE4_INCLUDE_DIR}
69 |       PATH_SUFFIXES eigen3 eigen
70 |     )
71 | 
72 |   if(EIGEN3_INCLUDE_DIR)
73 |     _eigen3_check_version()
74 |   endif(EIGEN3_INCLUDE_DIR)
75 | 
76 |   include(FindPackageHandleStandardArgs)
77 |   find_package_handle_standard_args(Eigen3 DEFAULT_MSG EIGEN3_INCLUDE_DIR EIGEN3_VERSION_OK)
78 | 
79 |   mark_as_advanced(EIGEN3_INCLUDE_DIR)
80 | 
81 | endif(EIGEN3_INCLUDE_DIR)
82 | 
83 | 


--------------------------------------------------------------------------------