ruby-iup 0.0.2 → 0.1.0

data/ext/iup-linux/include/im_lib.h

@@ -1,191 +1,191 @@
-/** \file
- * \brief Library Management and Main Documentation
- *
- * See Copyright Notice in this file.
- */
-
-#ifndef __IM_LIB_H
-#define __IM_LIB_H
-
-#if	defined(__cplusplus)
-extern "C" {
-#endif
-
-      
-/** \defgroup lib Library Management
- * \ingroup util 
- * \par
- * Usefull definitions for about dialogs and 
- * for comparing the compiled version with the linked version of the library.
- * \par
- * \verbatim im._AUTHOR [in Lua 5] \endverbatim
- * \verbatim im._COPYRIGHT [in Lua 5] \endverbatim
- * \verbatim im._VERSION [in Lua 5] \endverbatim
- * \verbatim im._VERSION_DATE [in Lua 5] \endverbatim
- * \verbatim im._VERSION_NUMBER [in Lua 5] \endverbatim
- * \verbatim im._DESCRIPTION [in Lua 5] \endverbatim
- * \verbatim im._NAME [in Lua 5] \endverbatim
- * \par
- * See \ref im_lib.h
- * @{
- */
-#define IM_AUTHOR "Antonio Scuri"
-#define IM_COPYRIGHT "Copyright (C) 1994-2008 Tecgraf, PUC-Rio."
-#define IM_VERSION "3.4.0"
-#define IM_VERSION_NUMBER 304000
-#define IM_VERSION_DATE "2008/10/14"
-#define IM_DESCRIPTION "Image Representation, Storage, Capture and Processing"
-#define IM_NAME "IM - An Imaging Toolkit"
-/** @} */
-
-
-/** Returns the library current version. Returns the definition IM_VERSION.
- *
- * \verbatim im.Version() -> version: string [in Lua 5] \endverbatim
- * \ingroup lib */
-const char* imVersion(void);
-
-/** Returns the library current version release date. Returns the definition IM_VERSION_DATE.
- *
- * \verbatim im.VersionDate() -> date: string [in Lua 5] \endverbatim
- * \ingroup lib */
-const char* imVersionDate(void);
-
-/** Returns the library current version number. Returns the definition IM_VERSION_NUMBER. \n
- * Can be compared in run time with IM_VERSION_NUMBER to compare compiled and linked versions of the library.
- *
- * \verbatim im.VersionNumber() -> version: number [in Lua 5] \endverbatim
- * \ingroup lib */
-int imVersionNumber(void);
-
-
-#if defined(__cplusplus)
-}
-#endif
-
-
-/*! \mainpage IM
- * <CENTER>
- * <H3> Image Representation, Storage, Capture and Processing </H3>
- * Tecgraf: Computer Graphics Technology Group, PUC-Rio, Brazil \n
- * http://www.tecgraf.puc-rio.br/im \n
- * mailto:im@tecgraf.puc-rio.br
- * </CENTER>
- *
- * \section over Overview
- * \par
- * IM is a toolkit for Digital Imaging. 
- * \par
- * It provides support for image capture, several image file formats and many image processing operations. 
- * \par
- * Image representation includes scientific data types (like IEEE floating point data) 
- * and attributes (or metadata like GeoTIFF and Exif tags).
- * Animation, video and volumes are supported as image sequences, 
- * but there is no digital audio support.
- * \par
- * The main goal of the library is to provide a simple API and abstraction
- * of images for scientific applications.
- * \par
- * The toolkit API is written in C. 
- * The core library source code is implemented in C++ and it is very portable, 
- * it can be compiled in Windows and UNIX with no modifications. 
- * New image processing operations can be implemented in C or in C++.
- * \par
- * IM is free software, can be used for public and commercial applications.
- * \par
- * This work was developed at Tecgraf/PUC-Rio 
- * by means of the partnership with PETROBRAS/CENPES.
- *
- * \section author Author
- * \par
- * Basic Software Group @ Tecgraf/PUC-Rio
- * - Antonio Scuri scuri@tecgraf.puc-rio.br
- *
- * \section copyright Copyright Notice
-\verbatim
-
-****************************************************************************
-Copyright (C) 1994-2008 Tecgraf, PUC-Rio.                                
-                                                                         
-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.                   
-****************************************************************************
-\endverbatim
- */
-
-
-/** \defgroup imagerep Image Representation
- * \par
- * See \ref im.h
- */
-
-
-/** \defgroup file Image Storage
- * \par
- * See \ref im.h
- */
-
-
-/** \defgroup format File Formats
- * \par
- * See \ref im.h
- *
- * Internal Predefined File Formats:
- * \li "BMP" - Windows Device Independent Bitmap
- * \li "PCX" - ZSoft Picture
- * \li "GIF" - Graphics Interchange Format
- * \li "TIFF" - Tagged Image File Format
- * \li "RAS" - Sun Raster File
- * \li "SGI" - Silicon Graphics Image File Format
- * \li "JPEG" - JPEG File Interchange Format
- * \li "LED" - IUP image in LED
- * \li "TGA" - Truevision Targa
- * \li "RAW" - RAW File
- * \li "PNM" - Netpbm Portable Image Map 
- * \li "ICO" - Windows Icon 
- * \li "PNG" - Portable Network Graphic Format 
- *
- * Other Supported File Formats:
- * \li "JP2" - JPEG-2000 JP2 File Format 
- * \li "AVI" - Windows Audio-Video Interleaved RIFF
- * \li "WMV" -  Windows Media Video Format
- *          
- * Some Known Compressions:
- * \li "NONE" - No Compression.
- * \li "RLE"  - Run Lenght Encoding.
- * \li "LZW"  - Lempel, Ziff and Welsh.
- * \li "JPEG" - Join Photographics Experts Group.
- * \li "DEFLATE" - LZ77 variation (ZIP)
- *          
- * \ingroup file */
-
- 
-/* Library Names Convention
- *
- *   Global Functions and Types - "im[Object][Action]"  using first capitals (imFileOpen)
- *   Local Functions and Types  -  "i[Object][Action]"  using first capitals (iTIFFGetCompIndex)
- *   Local Static Variables - same as local functions and types (iFormatCount)
- *   Local Static Tables - same as local functions and types with "Table" suffix (iTIFFCompTable)
- *   Variables and Members - no prefix, all lower case (width)
- *   Defines and Enumerations - all capitals (IM_ERR_NONE)
- *
- */
-
-
-#endif
+/** \file
+ * \brief Library Management and Main Documentation
+ *
+ * See Copyright Notice in this file.
+ */
+
+#ifndef __IM_LIB_H
+#define __IM_LIB_H
+
+#if	defined(__cplusplus)
+extern "C" {
+#endif
+
+      
+/** \defgroup lib Library Management
+ * \ingroup util 
+ * \par
+ * Usefull definitions for about dialogs and 
+ * for comparing the compiled version with the linked version of the library.
+ * \par
+ * \verbatim im._AUTHOR [in Lua 5] \endverbatim
+ * \verbatim im._COPYRIGHT [in Lua 5] \endverbatim
+ * \verbatim im._VERSION [in Lua 5] \endverbatim
+ * \verbatim im._VERSION_DATE [in Lua 5] \endverbatim
+ * \verbatim im._VERSION_NUMBER [in Lua 5] \endverbatim
+ * \verbatim im._DESCRIPTION [in Lua 5] \endverbatim
+ * \verbatim im._NAME [in Lua 5] \endverbatim
+ * \par
+ * See \ref im_lib.h
+ * @{
+ */
+#define IM_AUTHOR "Antonio Scuri"
+#define IM_COPYRIGHT "Copyright (C) 1994-2010 Tecgraf, PUC-Rio."
+#define IM_VERSION "3.6"      /* bug fixes are reported only by imVersion functions */
+#define IM_VERSION_NUMBER 306000
+#define IM_VERSION_DATE "2010/01/26"
+#define IM_DESCRIPTION "Image Representation, Storage, Capture and Processing"
+#define IM_NAME "IM - An Imaging Toolkit"
+/** @} */
+
+
+/** Returns the library current version. Returns the definition IM_VERSION plus the bug fix number.
+ *
+ * \verbatim im.Version() -> version: string [in Lua 5] \endverbatim
+ * \ingroup lib */
+const char* imVersion(void);
+
+/** Returns the library current version release date. Returns the definition IM_VERSION_DATE.
+ *
+ * \verbatim im.VersionDate() -> date: string [in Lua 5] \endverbatim
+ * \ingroup lib */
+const char* imVersionDate(void);
+
+/** Returns the library current version number. Returns the definition IM_VERSION_NUMBER plus the bug fix number. \n
+ * Can be compared in run time with IM_VERSION_NUMBER to compare compiled and linked versions of the library.
+ *
+ * \verbatim im.VersionNumber() -> version: number [in Lua 5] \endverbatim
+ * \ingroup lib */
+int imVersionNumber(void);
+
+
+#if defined(__cplusplus)
+}
+#endif
+
+
+/*! \mainpage IM
+ * <CENTER>
+ * <H3> Image Representation, Storage, Capture and Processing </H3>
+ * Tecgraf: Computer Graphics Technology Group, PUC-Rio, Brazil \n
+ * http://www.tecgraf.puc-rio.br/im \n
+ * mailto:im@tecgraf.puc-rio.br
+ * </CENTER>
+ *
+ * \section over Overview
+ * \par
+ * IM is a toolkit for Digital Imaging. 
+ * \par
+ * It provides support for image capture, several image file formats and many image processing operations. 
+ * \par
+ * Image representation includes scientific data types (like IEEE floating point data) 
+ * and attributes (or metadata like GeoTIFF and Exif tags).
+ * Animation, video and volumes are supported as image sequences, 
+ * but there is no digital audio support.
+ * \par
+ * The main goal of the library is to provide a simple API and abstraction
+ * of images for scientific applications.
+ * \par
+ * The toolkit API is written in C. 
+ * The core library source code is implemented in C++ and it is very portable, 
+ * it can be compiled in Windows and UNIX with no modifications. 
+ * New image processing operations can be implemented in C or in C++.
+ * \par
+ * IM is free software, can be used for public and commercial applications.
+ * \par
+ * This work was developed at Tecgraf/PUC-Rio 
+ * by means of the partnership with PETROBRAS/CENPES.
+ *
+ * \section author Author
+ * \par
+ * Basic Software Group @ Tecgraf/PUC-Rio
+ * - Antonio Scuri scuri@tecgraf.puc-rio.br
+ *
+ * \section copyright Copyright Notice
+\verbatim
+
+****************************************************************************
+Copyright (C) 1994-2010 Tecgraf, PUC-Rio.                                
+                                                                         
+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.                   
+****************************************************************************
+\endverbatim
+ */
+
+
+/** \defgroup imagerep Image Representation
+ * \par
+ * See \ref im.h
+ */
+
+
+/** \defgroup file Image Storage
+ * \par
+ * See \ref im.h
+ */
+
+
+/** \defgroup format File Formats
+ * \par
+ * See \ref im.h
+ *
+ * Internal Predefined File Formats:
+ * \li "BMP" - Windows Device Independent Bitmap
+ * \li "PCX" - ZSoft Picture
+ * \li "GIF" - Graphics Interchange Format
+ * \li "TIFF" - Tagged Image File Format
+ * \li "RAS" - Sun Raster File
+ * \li "SGI" - Silicon Graphics Image File Format
+ * \li "JPEG" - JPEG File Interchange Format
+ * \li "LED" - IUP image in LED
+ * \li "TGA" - Truevision Targa
+ * \li "RAW" - RAW File
+ * \li "PNM" - Netpbm Portable Image Map 
+ * \li "ICO" - Windows Icon 
+ * \li "PNG" - Portable Network Graphic Format 
+ *
+ * Other Supported File Formats:
+ * \li "JP2" - JPEG-2000 JP2 File Format 
+ * \li "AVI" - Windows Audio-Video Interleaved RIFF
+ * \li "WMV" -  Windows Media Video Format
+ *          
+ * Some Known Compressions:
+ * \li "NONE" - No Compression.
+ * \li "RLE"  - Run Lenght Encoding.
+ * \li "LZW"  - Lempel, Ziff and Welsh.
+ * \li "JPEG" - Join Photographics Experts Group.
+ * \li "DEFLATE" - LZ77 variation (ZIP)
+ *          
+ * \ingroup file */
+
+ 
+/* Library Names Convention
+ *
+ *   Global Functions and Types - "im[Object][Action]"  using first capitals (imFileOpen)
+ *   Local Functions and Types  -  "i[Object][Action]"  using first capitals (iTIFFGetCompIndex)
+ *   Local Static Variables - same as local functions and types (iFormatCount)
+ *   Local Static Tables - same as local functions and types with "Table" suffix (iTIFFCompTable)
+ *   Variables and Members - no prefix, all lower case (width)
+ *   Defines and Enumerations - all capitals (IM_ERR_NONE)
+ *
+ */
+
+
+#endif

data/ext/iup-linux/include/im_math.h

@@ -1,368 +1,368 @@
-/** \file
- * \brief Math Utilities
- *
- * See Copyright Notice in im_lib.h
- */
-
-#ifndef __IM_MATH_H
-#define __IM_MATH_H
-
-#include <math.h>
-#include "im_util.h"
-
-#ifdef IM_DEFMATHFLOAT
-inline float acosf(float _X) {return ((float)acos((double)_X)); }
-inline float asinf(float _X) {return ((float)asin((double)_X)); }
-inline float atanf(float _X) {return ((float)atan((double)_X)); }
-inline float atan2f(float _X, float _Y) {return ((float)atan2((double)_X, (double)_Y)); }
-inline float ceilf(float _X) {return ((float)ceil((double)_X)); }
-inline float cosf(float _X)  {return ((float)cos((double)_X)); }
-inline float coshf(float _X) {return ((float)cosh((double)_X)); }
-inline float expf(float _X) {return ((float)exp((double)_X)); }
-inline float fabsf(float _X) {return ((float)fabs((double)_X)); }
-inline float floorf(float _X) {return ((float)floor((double)_X)); }
-inline float fmodf(float _X, float _Y) {return ((float)fmod((double)_X, (double)_Y)); }
-inline float logf(float _X) {return ((float)log((double)_X)); }
-inline float log10f(float _X) {return ((float)log10((double)_X)); }
-inline float powf(float _X, float _Y) {return ((float)pow((double)_X, (double)_Y)); }
-inline float sinf(float _X) {return ((float)sin((double)_X)); }
-inline float sinhf(float _X) {return ((float)sinh((double)_X)); }
-inline float sqrtf(float _X) {return ((float)sqrt((double)_X)); }
-inline float tanf(float _X) {return ((float)tan((double)_X)); }
-inline float tanhf(float _X) {return ((float)tanh((double)_X)); }
-#endif
-
-/** \defgroup math Math Utilities
- * \par
- * When converting between continuous and discrete use: \n
- * Continuous = Discrete + 0.5         [Reconstruction/Interpolation] \n
- * Discrete = Round(Continuous - 0.5)  [Sampling/Quantization] \n
- * \par
- * Notice that must check 0-max limits when converting from Continuous to Discrete.
- * \par
- * When converting between discrete and discrete use: \n
- * integer src_size, dst_len, src_i, dst_i            \n
- * real factor = (real)(dst_size)/(real)(src_size)    \n
- * dst_i = Round(factor*(src_i + 0.5) - 0.5)
- * \par
- * See \ref im_math.h
- * \ingroup util */
-
-
-/** Round a real to the nearest integer.
- * \ingroup math */
-inline int imRound(float x) 
-{
-  return (int)(x < 0? x-0.5f: x+0.5f);
-}
-inline int imRound(double x) 
-{
-  return (int)(x < 0? x-0.5: x+0.5);
-}
-
-/** Converts between two discrete grids.
- * factor is "dst_size/src_size".
- * \ingroup math */
-inline int imResample(int x, float factor)
-{
-  float xr = factor*(x + 0.5f) - 0.5f;
-  return (int)(xr < 0? xr-0.5f: xr+0.5f);  /* Round */
-}
-
-/** Does Zero Order Decimation (Mean).
- * \ingroup math */
-template <class T, class TU>
-inline T imZeroOrderDecimation(int width, int height, T *map, float xl, float yl, float box_width, float box_height, TU Dummy)
-{
-  int x0,x1,y0,y1;
-  (void)Dummy;
-
-  x0 = (int)floor(xl - box_width/2.0 - 0.5) + 1;
-  y0 = (int)floor(yl - box_height/2.0 - 0.5) + 1;
-  x1 = (int)floor(xl + box_width/2.0 - 0.5);
-  y1 = (int)floor(yl + box_height/2.0 - 0.5);
-
-  if (x0 == x1) x1++;
-  if (y0 == y1) y1++;
-
-  x0 = x0<0? 0: x0>width-1? width-1: x0;
-  y0 = y0<0? 0: y0>height-1? height-1: y0;
-  x1 = x1<0? 0: x1>width-1? width-1: x1;
-  y1 = y1<0? 0: y1>height-1? height-1: y1;
-
-  TU Value;
-  int Count = 0;
-
-  Value = 0;
-
-  for (int y = y0; y <= y1; y++)
-  {
-    for (int x = x0; x <= x1; x++)
-    {
-      Value += map[y*width+x];
-      Count++;
-    }
-  }
-
-  if (Count == 0)
-  {
-    Value = 0;
-    return (T)Value;
-  }
-
-  return (T)(Value/(float)Count);
-}
-
-/** Does Bilinear Decimation.
- * \ingroup math */
-template <class T, class TU>
-inline T imBilinearDecimation(int width, int height, T *map, float xl, float yl, float box_width, float box_height, TU Dummy)
-{
-  int x0,x1,y0,y1;
-  (void)Dummy;
-
-  x0 = (int)floor(xl - box_width/2.0 - 0.5) + 1;
-  y0 = (int)floor(yl - box_height/2.0 - 0.5) + 1;
-  x1 = (int)floor(xl + box_width/2.0 - 0.5);
-  y1 = (int)floor(yl + box_height/2.0 - 0.5);
-
-  if (x0 == x1) x1++;
-  if (y0 == y1) y1++;
-
-  x0 = x0<0? 0: x0>width-1? width-1: x0;
-  y0 = y0<0? 0: y0>height-1? height-1: y0;
-  x1 = x1<0? 0: x1>width-1? width-1: x1;
-  y1 = y1<0? 0: y1>height-1? height-1: y1;
-
-  TU Value, LineValue;
-  float LineNorm, Norm, dxr, dyr;
-
-  Value = 0;
-  Norm = 0;
-
-  for (int y = y0; y <= y1; y++)
-  {
-    dyr = yl - (y+0.5f);
-    if (dyr < 0) dyr *= -1;
-
-    LineValue = 0;
-    LineNorm = 0;
-
-    for (int x = x0; x <= x1; x++)
-    {
-      dxr = xl - (x+0.5f);
-      if (dxr < 0) dxr *= -1;
-
-      LineValue += map[y*width+x] * dxr;
-      LineNorm += dxr;
-    }
-
-    Value += LineValue * dyr;
-    Norm += dyr * LineNorm;
-  }
-
-  if (Norm == 0)
-  {
-    Value = 0;
-    return (T)Value;
-  }
-
-  return (T)(Value/Norm);
-}
-
-/** Does Zero Order Interpolation (Nearest Neighborhood).
- * \ingroup math */
-template <class T>
-inline T imZeroOrderInterpolation(int width, int height, T *map, float xl, float yl)
-{
-  int x0 = imRound(xl-0.5f);
-  int y0 = imRound(yl-0.5f);
-  x0 = x0<0? 0: x0>width-1? width-1: x0;
-  y0 = y0<0? 0: y0>height-1? height-1: y0;
-  return map[y0*width + x0];
-}
-
-/** Does Bilinear Interpolation.
- * \ingroup math */
-template <class T>
-inline T imBilinearInterpolation(int width, int height, T *map, float xl, float yl)
-{
-  int x0, y0, x1, y1;
-  float t, u;
-
-  if (xl < 0.5)
-  {
-    x1 = x0 = 0; 
-    t = 0;
-  }
-  else if (xl > width-0.5)
-  {
-    x1 = x0 = width-1;
-    t = 0;
-  }
-  else
-  {
-    x0 = (int)(xl-0.5f);
-    x1 = x0+1;
-    t = xl - (x0+0.5f);
-  }
-
-  if (yl < 0.5)
-  {
-    y1 = y0 = 0; 
-    u = 0;
-  }
-  else if (yl > height-0.5)
-  {
-    y1 = y0 = height-1;
-    u = 0;
-  }
-  else
-  {
-    y0 = (int)(yl-0.5f);
-    y1 = y0+1;
-    u = yl - (y0+0.5f);
-  }
-
-  T fll = map[y0*width + x0];
-  T fhl = map[y0*width + x1];
-  T flh = map[y1*width + x0];
-  T fhh = map[y1*width + x1];
-
-  return (T)((fhh - flh - fhl + fll) * u * t +
-                         (fhl - fll) * t +
-                         (flh - fll) * u +
-                                fll);
-}
-
-/** Does Bicubic Interpolation.
- * \ingroup math */
-template <class T, class TU>
-inline T imBicubicInterpolation(int width, int height, T *map, float xl, float yl, TU Dummy)
-{
-  int X[4], Y[4];
-  float t, u;
-  (void)Dummy;
-
-  if (xl > width-0.5)
-  {
-    X[3] = X[2] = X[1] = width-1;
-    X[0] = X[1]-1;
-    t = 0;
-  }
-  else
-  {
-    X[1] = (int)(xl-0.5f);
-    if (X[1] < 0) X[1] = 0;
-
-    X[0] = X[1]-1;
-    X[2] = X[1]+1;
-    X[3] = X[1]+2;
-
-    if (X[0] < 0) X[0] = 0;
-    if (X[3] > width-1) X[3] = width-1;
-
-    t = xl - (X[1]+0.5f);
-  }
-
-  if (yl > height-0.5)
-  {
-    Y[3] = Y[2] = Y[1] = height-1;
-    Y[0] = Y[1]-1;
-    u = 0;
-  }
-  else
-  {
-    Y[1] = (int)(yl-0.5f);
-    if (Y[1] < 0) Y[1] = 0;
-
-    Y[0] = Y[1]-1;
-    Y[2] = Y[1]+1;
-    Y[3] = Y[1]+2;
-
-    if (Y[0] < 0) Y[0] = 0;
-    if (Y[3] > height-1) Y[3] = height-1;
-
-    u = yl - (Y[1]+0.5f);
-  }
-
-  float CX[4], CY[4];
-
-  // Optimize calculations
-  {
-    float c, c2, c3;
-
-#define C0 (-c3 + 2.0f*c2 - c)
-#define C1 ( c3 - 2.0f*c2 + 1.0f)
-#define C2 (-c3 + c2 + c)
-#define C3 ( c3 - c2)
-
-    c = t;
-    c2 = c*c; c3 = c2*c;
-    CX[0] = C0; CX[1] = C1; CX[2] = C2; CX[3] = C3;
-
-    c = u;
-    c2 = c*c; c3 = c2*c;
-    CY[0] = C0; CY[1] = C1; CY[2] = C2; CY[3] = C3;
-
-#undef C0
-#undef C1
-#undef C2
-#undef C3
-  }
-
-  TU LineValue, Value;
-  float LineNorm, Norm;
-
-  Value = 0;
-  Norm = 0;
-
-  for (int y = 0; y < 4; y++)
-  {
-    LineValue = 0;
-    LineNorm = 0;
-
-    for (int x = 0; x < 4; x++)
-    {
-      LineValue += map[Y[y]*width+X[x]] * CX[x];
-      LineNorm += CX[x];
-    }
-
-    Value += LineValue * CY[y];
-    Norm += CY[y] * LineNorm;
-  }
-
-  if (Norm == 0)
-  {
-    Value = 0;
-    return (T)Value;
-  }
-
-  Value = (Value/Norm);
-
-  int size = sizeof(T); 
-  if (size == 1)
-    return (T)(Value<=(TU)0? (TU)0: Value<=(TU)255? Value: (TU)255);
-  else
-    return (T)(Value);
-}
-
-/** Calculates minimum and maximum values.
- * \ingroup math */
-template <class T> 
-inline void imMinMax(const T *map, int count, T& min, T& max)
-{
-  min = *map++;
-  max = min;
-  for (int i = 1; i < count; i++)
-  {
-    T value = *map++;
-
-    if (value > max)
-      max = value;
-    else if (value < min)
-      min = value;
-  }
-}
-
-#endif
+/** \file
+ * \brief Math Utilities
+ *
+ * See Copyright Notice in im_lib.h
+ */
+
+#ifndef __IM_MATH_H
+#define __IM_MATH_H
+
+#include <math.h>
+#include "im_util.h"
+
+#ifdef IM_DEFMATHFLOAT
+inline float acosf(float _X) {return ((float)acos((double)_X)); }
+inline float asinf(float _X) {return ((float)asin((double)_X)); }
+inline float atanf(float _X) {return ((float)atan((double)_X)); }
+inline float atan2f(float _X, float _Y) {return ((float)atan2((double)_X, (double)_Y)); }
+inline float ceilf(float _X) {return ((float)ceil((double)_X)); }
+inline float cosf(float _X)  {return ((float)cos((double)_X)); }
+inline float coshf(float _X) {return ((float)cosh((double)_X)); }
+inline float expf(float _X) {return ((float)exp((double)_X)); }
+inline float fabsf(float _X) {return ((float)fabs((double)_X)); }
+inline float floorf(float _X) {return ((float)floor((double)_X)); }
+inline float fmodf(float _X, float _Y) {return ((float)fmod((double)_X, (double)_Y)); }
+inline float logf(float _X) {return ((float)log((double)_X)); }
+inline float log10f(float _X) {return ((float)log10((double)_X)); }
+inline float powf(float _X, float _Y) {return ((float)pow((double)_X, (double)_Y)); }
+inline float sinf(float _X) {return ((float)sin((double)_X)); }
+inline float sinhf(float _X) {return ((float)sinh((double)_X)); }
+inline float sqrtf(float _X) {return ((float)sqrt((double)_X)); }
+inline float tanf(float _X) {return ((float)tan((double)_X)); }
+inline float tanhf(float _X) {return ((float)tanh((double)_X)); }
+#endif
+
+/** \defgroup math Math Utilities
+ * \par
+ * When converting between continuous and discrete use: \n
+ * Continuous = Discrete + 0.5         [Reconstruction/Interpolation] \n
+ * Discrete = Round(Continuous - 0.5)  [Sampling/Quantization] \n
+ * \par
+ * Notice that must check 0-max limits when converting from Continuous to Discrete.
+ * \par
+ * When converting between discrete and discrete use: \n
+ * integer src_size, dst_len, src_i, dst_i            \n
+ * real factor = (real)(dst_size)/(real)(src_size)    \n
+ * dst_i = Round(factor*(src_i + 0.5) - 0.5)
+ * \par
+ * See \ref im_math.h
+ * \ingroup util */
+
+
+/** Round a real to the nearest integer.
+ * \ingroup math */
+inline int imRound(float x) 
+{
+  return (int)(x < 0? x-0.5f: x+0.5f);
+}
+inline int imRound(double x) 
+{
+  return (int)(x < 0? x-0.5: x+0.5);
+}
+
+/** Converts between two discrete grids.
+ * factor is "dst_size/src_size".
+ * \ingroup math */
+inline int imResample(int x, float factor)
+{
+  float xr = factor*(x + 0.5f) - 0.5f;
+  return (int)(xr < 0? xr-0.5f: xr+0.5f);  /* Round */
+}
+
+/** Does Zero Order Decimation (Mean).
+ * \ingroup math */
+template <class T, class TU>
+inline T imZeroOrderDecimation(int width, int height, T *map, float xl, float yl, float box_width, float box_height, TU Dummy)
+{
+  int x0,x1,y0,y1;
+  (void)Dummy;
+
+  x0 = (int)floor(xl - box_width/2.0 - 0.5) + 1;
+  y0 = (int)floor(yl - box_height/2.0 - 0.5) + 1;
+  x1 = (int)floor(xl + box_width/2.0 - 0.5);
+  y1 = (int)floor(yl + box_height/2.0 - 0.5);
+
+  if (x0 == x1) x1++;
+  if (y0 == y1) y1++;
+
+  x0 = x0<0? 0: x0>width-1? width-1: x0;
+  y0 = y0<0? 0: y0>height-1? height-1: y0;
+  x1 = x1<0? 0: x1>width-1? width-1: x1;
+  y1 = y1<0? 0: y1>height-1? height-1: y1;
+
+  TU Value;
+  int Count = 0;
+
+  Value = 0;
+
+  for (int y = y0; y <= y1; y++)
+  {
+    for (int x = x0; x <= x1; x++)
+    {
+      Value += map[y*width+x];
+      Count++;
+    }
+  }
+
+  if (Count == 0)
+  {
+    Value = 0;
+    return (T)Value;
+  }
+
+  return (T)(Value/(float)Count);
+}
+
+/** Does Bilinear Decimation.
+ * \ingroup math */
+template <class T, class TU>
+inline T imBilinearDecimation(int width, int height, T *map, float xl, float yl, float box_width, float box_height, TU Dummy)
+{
+  int x0,x1,y0,y1;
+  (void)Dummy;
+
+  x0 = (int)floor(xl - box_width/2.0 - 0.5) + 1;
+  y0 = (int)floor(yl - box_height/2.0 - 0.5) + 1;
+  x1 = (int)floor(xl + box_width/2.0 - 0.5);
+  y1 = (int)floor(yl + box_height/2.0 - 0.5);
+
+  if (x0 == x1) x1++;
+  if (y0 == y1) y1++;
+
+  x0 = x0<0? 0: x0>width-1? width-1: x0;
+  y0 = y0<0? 0: y0>height-1? height-1: y0;
+  x1 = x1<0? 0: x1>width-1? width-1: x1;
+  y1 = y1<0? 0: y1>height-1? height-1: y1;
+
+  TU Value, LineValue;
+  float LineNorm, Norm, dxr, dyr;
+
+  Value = 0;
+  Norm = 0;
+
+  for (int y = y0; y <= y1; y++)
+  {
+    dyr = yl - (y+0.5f);
+    if (dyr < 0) dyr *= -1;
+
+    LineValue = 0;
+    LineNorm = 0;
+
+    for (int x = x0; x <= x1; x++)
+    {
+      dxr = xl - (x+0.5f);
+      if (dxr < 0) dxr *= -1;
+
+      LineValue += map[y*width+x] * dxr;
+      LineNorm += dxr;
+    }
+
+    Value += LineValue * dyr;
+    Norm += dyr * LineNorm;
+  }
+
+  if (Norm == 0)
+  {
+    Value = 0;
+    return (T)Value;
+  }
+
+  return (T)(Value/Norm);
+}
+
+/** Does Zero Order Interpolation (Nearest Neighborhood).
+ * \ingroup math */
+template <class T>
+inline T imZeroOrderInterpolation(int width, int height, T *map, float xl, float yl)
+{
+  int x0 = imRound(xl-0.5f);
+  int y0 = imRound(yl-0.5f);
+  x0 = x0<0? 0: x0>width-1? width-1: x0;
+  y0 = y0<0? 0: y0>height-1? height-1: y0;
+  return map[y0*width + x0];
+}
+
+/** Does Bilinear Interpolation.
+ * \ingroup math */
+template <class T>
+inline T imBilinearInterpolation(int width, int height, T *map, float xl, float yl)
+{
+  int x0, y0, x1, y1;
+  float t, u;
+
+  if (xl < 0.5)
+  {
+    x1 = x0 = 0; 
+    t = 0;
+  }
+  else if (xl > width-0.5)
+  {
+    x1 = x0 = width-1;
+    t = 0;
+  }
+  else
+  {
+    x0 = (int)(xl-0.5f);
+    x1 = x0+1;
+    t = xl - (x0+0.5f);
+  }
+
+  if (yl < 0.5)
+  {
+    y1 = y0 = 0; 
+    u = 0;
+  }
+  else if (yl > height-0.5)
+  {
+    y1 = y0 = height-1;
+    u = 0;
+  }
+  else
+  {
+    y0 = (int)(yl-0.5f);
+    y1 = y0+1;
+    u = yl - (y0+0.5f);
+  }
+
+  T fll = map[y0*width + x0];
+  T fhl = map[y0*width + x1];
+  T flh = map[y1*width + x0];
+  T fhh = map[y1*width + x1];
+
+  return (T)((fhh - flh - fhl + fll) * u * t +
+                         (fhl - fll) * t +
+                         (flh - fll) * u +
+                                fll);
+}
+
+/** Does Bicubic Interpolation.
+ * \ingroup math */
+template <class T, class TU>
+inline T imBicubicInterpolation(int width, int height, T *map, float xl, float yl, TU Dummy)
+{
+  int X[4], Y[4];
+  float t, u;
+  (void)Dummy;
+
+  if (xl > width-0.5)
+  {
+    X[3] = X[2] = X[1] = width-1;
+    X[0] = X[1]-1;
+    t = 0;
+  }
+  else
+  {
+    X[1] = (int)(xl-0.5f);
+    if (X[1] < 0) X[1] = 0;
+
+    X[0] = X[1]-1;
+    X[2] = X[1]+1;
+    X[3] = X[1]+2;
+
+    if (X[0] < 0) X[0] = 0;
+    if (X[3] > width-1) X[3] = width-1;
+
+    t = xl - (X[1]+0.5f);
+  }
+
+  if (yl > height-0.5)
+  {
+    Y[3] = Y[2] = Y[1] = height-1;
+    Y[0] = Y[1]-1;
+    u = 0;
+  }
+  else
+  {
+    Y[1] = (int)(yl-0.5f);
+    if (Y[1] < 0) Y[1] = 0;
+
+    Y[0] = Y[1]-1;
+    Y[2] = Y[1]+1;
+    Y[3] = Y[1]+2;
+
+    if (Y[0] < 0) Y[0] = 0;
+    if (Y[3] > height-1) Y[3] = height-1;
+
+    u = yl - (Y[1]+0.5f);
+  }
+
+  float CX[4], CY[4];
+
+  // Optimize calculations
+  {
+    float c, c2, c3;
+
+#define C0 (-c3 + 2.0f*c2 - c)
+#define C1 ( c3 - 2.0f*c2 + 1.0f)
+#define C2 (-c3 + c2 + c)
+#define C3 ( c3 - c2)
+
+    c = t;
+    c2 = c*c; c3 = c2*c;
+    CX[0] = C0; CX[1] = C1; CX[2] = C2; CX[3] = C3;
+
+    c = u;
+    c2 = c*c; c3 = c2*c;
+    CY[0] = C0; CY[1] = C1; CY[2] = C2; CY[3] = C3;
+
+#undef C0
+#undef C1
+#undef C2
+#undef C3
+  }
+
+  TU LineValue, Value;
+  float LineNorm, Norm;
+
+  Value = 0;
+  Norm = 0;
+
+  for (int y = 0; y < 4; y++)
+  {
+    LineValue = 0;
+    LineNorm = 0;
+
+    for (int x = 0; x < 4; x++)
+    {
+      LineValue += map[Y[y]*width+X[x]] * CX[x];
+      LineNorm += CX[x];
+    }
+
+    Value += LineValue * CY[y];
+    Norm += CY[y] * LineNorm;
+  }
+
+  if (Norm == 0)
+  {
+    Value = 0;
+    return (T)Value;
+  }
+
+  Value = (Value/Norm);
+
+  int size = sizeof(T); 
+  if (size == 1)
+    return (T)(Value<=(TU)0? (TU)0: Value<=(TU)255? Value: (TU)255);
+  else
+    return (T)(Value);
+}
+
+/** Calculates minimum and maximum values.
+ * \ingroup math */
+template <class T> 
+inline void imMinMax(const T *map, int count, T& min, T& max)
+{
+  min = *map++;
+  max = min;
+  for (int i = 1; i < count; i++)
+  {
+    T value = *map++;
+
+    if (value > max)
+      max = value;
+    else if (value < min)
+      min = value;
+  }
+}
+
+#endif