2014-04-19 00:30:01 +02:00
|
|
|
config BR2_PACKAGE_QHULL
|
|
|
|
bool "qhull"
|
|
|
|
depends on BR2_INSTALL_LIBSTDCPP
|
2014-12-03 22:41:29 +01:00
|
|
|
depends on !BR2_STATIC_LIBS
|
2016-02-27 14:13:38 +01:00
|
|
|
depends on BR2_TOOLCHAIN_GCC_AT_LEAST_4_4 # needs gcc >= 4.4
|
2014-04-19 00:30:01 +02:00
|
|
|
help
|
|
|
|
Qhull computes the convex hull, Delaunay triangulation,
|
|
|
|
Voronoi diagram, halfspace intersection about a point,
|
|
|
|
furthest-site Delaunay triangulation, and furthest-site
|
|
|
|
Voronoi diagram. The source code 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. It computes volumes, surface
|
|
|
|
areas, and approximations to the convex hull.
|
|
|
|
|
|
|
|
http://www.qhull.org
|
|
|
|
|
2016-02-27 14:13:38 +01:00
|
|
|
comment "qhull needs a toolchain w/ C++, dynamic library, gcc >= 4.4"
|
|
|
|
depends on !BR2_INSTALL_LIBSTDCPP || BR2_STATIC_LIBS || !BR2_TOOLCHAIN_GCC_AT_LEAST_4_4
|