/* Copyright (c) 2011 Khaled Mamou (kmamou at gmail dot com) All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. The names of the contributors may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #ifndef VHACD_H #define VHACD_H #define VHACD_VERSION_MAJOR … #define VHACD_VERSION_MINOR … // Changes for version 2.3 // // m_gamma : Has been removed. This used to control the error metric to merge convex hulls. Now it uses the 'm_maxConvexHulls' value instead. // m_maxConvexHulls : This is the maximum number of convex hulls to produce from the merge operation; replaces 'm_gamma'. // // Note that decomposition depth is no longer a user provided value. It is now derived from the // maximum number of hulls requested. // // As a convenience to the user, each convex hull produced now includes the volume of the hull as well as it's center. // // This version supports a convenience method to automatically make V-HACD run asynchronously in a background thread. // To get a fully asynchronous version, call 'CreateVHACD_ASYNC' instead of 'CreateVHACD'. You get the same interface however, // now when computing convex hulls, it is no longer a blocking operation. All callback messages are still returned // in the application's thread so you don't need to worry about mutex locks or anything in that case. // To tell if the operation is complete, the application should call 'IsReady'. This will return true if // the last approximation operation is complete and will dispatch any pending messages. // If you call 'Compute' while a previous operation was still running, it will automatically cancel the last request // and begin a new one. To cancel a currently running approximation just call 'Cancel'. #include <stdint.h> namespace VHACD { class IVHACD { … }; IVHACD* CreateVHACD(void); IVHACD* CreateVHACD_ASYNC(void); } #endif // VHACD_H