-
From personal email:
> I would like to know how I can add hole and region information in the input for TetGen? I have seen the signature for function igl::tetrahedralize function but cannot find prov…
-
The stencil classes for generating polyhedral stencils need some work, especially on parallel domains. There are tests for this, so it's mostly a matter of putting in the time.
-
```
I implemented the convex hull algorithm of Preparata and Hong. This has a time
complexity of
O(n log n), which is much better than what is currently implemented (although I
do not know the
exa…
-
```
I implemented the convex hull algorithm of Preparata and Hong. This has a time
complexity of
O(n log n), which is much better than what is currently implemented (although I
do not know the
exa…
-
Hi all,
im succesfully installed engrid 1.4 in ubuntu 14.04 even having some troubles.
I would like how to install new concept version in such distro. I assume that I cannot use build.bash script bec…
-
When trying to perform 3D boolean operations on Nef polyhedra i get the assertion fail
```
CGAL error: assertion violation!
Expression : G.mark(v1,0)==G.mark(v2,0)&& G.mark(v1,1)==G.mark(v2,1)
File …
-
```
I implemented the convex hull algorithm of Preparata and Hong. This has a time
complexity of
O(n log n), which is much better than what is currently implemented (although I
do not know the
exa…
-
```
I implemented the convex hull algorithm of Preparata and Hong. This has a time
complexity of
O(n log n), which is much better than what is currently implemented (although I
do not know the
exa…
-
If I try 'gC', and compare the result with https://en.wikipedia.org/wiki/Conway_polyhedron_notation#/media/File:Pentagonalicositetrahedronccw.jpg, they don't really look the same.
In polyhedronisme th…
-
```
I implemented the convex hull algorithm of Preparata and Hong. This has a time
complexity of
O(n log n), which is much better than what is currently implemented (although I
do not know the
exa…