1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/Subdivision.h	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,124 @@
     1.4 +/*
     1.5 +Open Asset Import Library (assimp)
     1.6 +----------------------------------------------------------------------
     1.7 +
     1.8 +Copyright (c) 2006-2012, assimp team
     1.9 +All rights reserved.
    1.10 +
    1.11 +Redistribution and use of this software in source and binary forms, 
    1.12 +with or without modification, are permitted provided that the 
    1.13 +following conditions are met:
    1.14 +
    1.15 +* Redistributions of source code must retain the above
    1.16 +  copyright notice, this list of conditions and the
    1.17 +  following disclaimer.
    1.18 +
    1.19 +* Redistributions in binary form must reproduce the above
    1.20 +  copyright notice, this list of conditions and the
    1.21 +  following disclaimer in the documentation and/or other
    1.22 +  materials provided with the distribution.
    1.23 +
    1.24 +* Neither the name of the assimp team, nor the names of its
    1.25 +  contributors may be used to endorse or promote products
    1.26 +  derived from this software without specific prior
    1.27 +  written permission of the assimp team.
    1.28 +
    1.29 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 
    1.30 +"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 
    1.31 +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
    1.32 +A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
    1.33 +OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
    1.34 +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
    1.35 +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
    1.36 +DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
    1.37 +THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
    1.38 +(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
    1.39 +OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
    1.40 +
    1.41 +----------------------------------------------------------------------
    1.42 +*/
    1.43 +
    1.44 +/** @file Defines a helper class to evaluate subdivision surfaces.*/
    1.45 +#ifndef AI_SUBDISIVION_H_INC
    1.46 +#define AI_SUBDISIVION_H_INC
    1.47 +namespace Assimp	{
    1.48 +
    1.49 +// ------------------------------------------------------------------------------
    1.50 +/** Helper class to evaluate subdivision surfaces. Different algorithms
    1.51 + *  are provided for choice. */
    1.52 +// ------------------------------------------------------------------------------
    1.53 +class Subdivider
    1.54 +{
    1.55 +public:
    1.56 +
    1.57 +	/** Enumerates all supported subvidision algorithms */
    1.58 +	enum Algorithm	{
    1.59 +		CATMULL_CLARKE = 0x1
    1.60 +	};
    1.61 +
    1.62 +public:
    1.63 +
    1.64 +	virtual ~Subdivider() {
    1.65 +	}
    1.66 +
    1.67 +public:
    1.68 +
    1.69 +	// ---------------------------------------------------------------
    1.70 +	/** Create a subdivider of a specific type
    1.71 +	 *
    1.72 +	 *  @param algo Algorithm to be used for subdivision
    1.73 +	 *  @return Subdivider instance. */
    1.74 +	static Subdivider* Create (Algorithm algo);
    1.75 +
    1.76 +	// ---------------------------------------------------------------
    1.77 +	/** Subdivide a mesh using the selected algorithm
    1.78 +	 *
    1.79 +	 *  @param mesh First mesh to be subdivided. Must be in verbose
    1.80 +	 *    format.
    1.81 +	 *  @param out Receives the output mesh, allocated by me.
    1.82 +	 *  @param num Number of subdivisions to perform.
    1.83 +	 *  @param discard_input If true is passed, the input mesh is
    1.84 +	 *    deleted after the subdivision is complete. This can 
    1.85 +	 *    improve performance because it allows the optimization
    1.86 +	 *    to reuse the existing mesh for intermediate results.
    1.87 +	 *  @pre out!=mesh*/
    1.88 +	virtual void Subdivide ( aiMesh* mesh, 
    1.89 +		aiMesh*& out, unsigned int num,
    1.90 +		bool discard_input = false) = 0;
    1.91 +
    1.92 +	// ---------------------------------------------------------------
    1.93 +	/** Subdivide multiple meshes using the selected algorithm. This
    1.94 +	 *  avoids erroneous smoothing on objects consisting of multiple
    1.95 +	 *  per-material meshes. Usually, most 3d modellers smooth on a
    1.96 +	 *  per-object base, regardless the materials assigned to the
    1.97 +	 *  meshes.
    1.98 +	 *
    1.99 +	 *  @param smesh Array of meshes to be subdivided. Must be in
   1.100 +	 *    verbose format.
   1.101 +	 *  @param nmesh Number of meshes in smesh.
   1.102 +	 *  @param out Receives the output meshes. The array must be
   1.103 +	 *    sufficiently large (at least @c nmesh elements) and may not
   1.104 +	 *    overlap the input array. Output meshes map one-to-one to
   1.105 +	 *    their corresponding input meshes. The meshes are allocated 
   1.106 +	 *    by the function.
   1.107 +	 *  @param discard_input If true is passed, input meshes are
   1.108 +	 *    deleted after the subdivision is complete. This can 
   1.109 +	 *    improve performance because it allows the optimization
   1.110 +	 *    of reusing existing meshes for intermediate results.
   1.111 +	 *  @param num Number of subdivisions to perform.
   1.112 +	 *  @pre nmesh != 0, smesh and out may not overlap*/
   1.113 +	virtual void Subdivide (
   1.114 +		aiMesh** smesh, 
   1.115 +		size_t nmesh,
   1.116 +		aiMesh** out, 
   1.117 +		unsigned int num,
   1.118 +		bool discard_input = false) = 0;
   1.119 +
   1.120 +private:
   1.121 +};
   1.122 +
   1.123 +} // end namespace Assimp
   1.124 +
   1.125 +
   1.126 +#endif // !!  AI_SUBDISIVION_H_INC
   1.127 +