-
I'm interested in 3D Delaunay tesselation, by which I mean the tetrahedralisation of points. Is it correct that your package can do this?
I tried your package using the following:
```julia
usin…
-
The function returns 0 for a convex hull calculated using MelkmanConvexHull. I included the points of the convex hull directly.
```
#include
#include
#include
#include
using namespace DG…
-
I suspect this is due to slow collision detection.
The first picture is the point cloud I added, and the second picture is the collision detection code of my inverse kinematic solution. I am sure t…
-
### Discussed in https://github.com/humanoid-path-planner/hpp-fcl/discussions/422
Originally posted by **manuel-koch** May 15, 2023
I'm new to hpp-fcl and can't find useful documentation about…
-
There is only one operator that reduces number of faces which is hull(). But it works on convex objects only. It would be nice to have something like:
`module reduce(min_face_size mfs, max_deviatio…
-
Bounding rectangle and convex hull are rendered incorrectly when the layer (US) passes beyond the (-180, 180) edges
It's related to the small part of US being on the right side of screen (-188.9)
-
How hard would it be to make a function that maps a point in the first BZ to its symmetrically identical point in the irreducible BZ? I am trying to integrate/sum over the first BZ and it would be nic…
-
I think I noted that the collision geometry is just a mesh-collider of the output CSG, which is a bad approach in my opinion. Instead, we could use the shape of each brush to generate collision geomet…
-
# 10-03 Max flow and min cut · 모두를 위한 컨벡스 최적화
[https://convex-optimization-for-all.github.io/contents/chapter10/2021/03/22/10_03_Max_flow_and_min_cut/](https://convex-optimization-for-all.github.io…
-
### 🔍 Search Terms
- #14107
- That is labelled as "Needs Proposal". This proposal covers that, and details some of the tradeoffs.
- (Thanks to @jcalz for finding that)
- #1805
-…