20 lines
770 B
Plaintext
20 lines
770 B
Plaintext
|
config BR2_PACKAGE_QHULL
|
||
|
|
bool "qhull"
|
||
|
|
depends on BR2_INSTALL_LIBSTDCPP
|
||
|
|
depends on BR2_TOOLCHAIN_GCC_AT_LEAST_4_4 # needs gcc >= 4.4
|
||
|
|
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
|
||
|
|
|
||
|
|
comment "qhull needs a toolchain w/ C++, gcc >= 4.4"
|
||
|
|
depends on !BR2_INSTALL_LIBSTDCPP || \
|
||
|
|
!BR2_TOOLCHAIN_GCC_AT_LEAST_4_4
|