Difference between revisions of "Qhull"

From PLplotWiki
Jump to: navigation, search
(New page: == Description == [http://www.qhull.org/ qhull] computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulati...)
(No difference)

Revision as of 12:21, 22 December 2008

Description

qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The software runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. Qhull also computes volumes, surface areas, and approximations to the convex hull.

Instructions for Mac OS X

N/A

Instructions for Linux

N/A

Instructions for Windows

  • Download qhull 2003.1 source
  • Untar qhull-2003.1-src.tgz
  • Copy plplot\cmake\external\libqhull\CMakeLists.txt to the qhull source dir
  • Cd into the qhull source dir

MinGW compiler

  • create a build directory and cd into it
mkdir build
cd build
  • configure the build with cmake
cmake -G "MinGW Makefiles" -DBUILD_SHARED_LIBS=OFF -DCMAKE_INSTALL_PREFIX=../local ..
  • make and install the library
mingw32-make
mingw32-make install

Set CMake paths

  • set environment variables (for MinGW and Visual C++)
set QHULLDIR=c:\libraries\qhull-2003.1\build
set CMAKE_INCLUDE_PATH=%QHULLDIR%\include;%CMAKE_INCLUDE_PATH%
set CMAKE_LIBRARY_PATH=%QHULLDIR%\lib;%CMAKE_LIBRARY_PATH%

CMake is now able to find the qhull library and headers.