issues
search
tomilov
/
quickhull
Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
https://habr.com/ru/articles/245221/
70
stars
8
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
qh.facets_; How do I get the points?
#15
ligonap
opened
3 months ago
1
Handling degeneracies
#14
ramcdona
opened
10 months ago
1
Is there a way to compute the centroid of the convex hull?
#13
wangxi0706
closed
1 year ago
2
In 3D cases, are facets triangular facets?
#12
wangxi0706
closed
1 year ago
5
Does this algorithm support integer types?
#11
nomadsinteractive
opened
1 year ago
0
fix FTBFS for GCC
#10
tomilov
closed
2 years ago
0
Readme or make file would help
#9
Akhila502
closed
1 year ago
6
How does the algorithm perform in higher dimensions? (e.g. 7D sphere in R^8)
#8
sgbaird
closed
2 years ago
5
simple example needed
#7
Jakobovski
closed
2 years ago
2
Out-of-memory issue when nvertices is too big
#6
lorenzo-rovigatti
closed
6 years ago
2
Compiler support
#5
kzampog
closed
2 years ago
2
segfault when running high dimensional input file (46 columns x 1955 rows)
#4
LMHmedchem
closed
7 years ago
5
Prevent the binding of eps to a temporary
#3
tomilov
closed
8 years ago
0
Support the algebraic numbers
#2
tomilov
closed
2 years ago
0
simplification
#1
tomilov
closed
9 years ago
0