Thomas Christensen

Results 116 comments of Thomas Christensen

> We should not do benchmarks on such small graphs unless the algorithm has a huge complexity and is slow even on very small graphs. Otherwise the benchmark is way...

Hmm, I'm not completely sure, I admit. By > "maps a point in the first BZ to its symmetrically identical point in the irreducible BZ", I imagine you also mean...

Actually, the intersection of a half-space and a convex polygon is not too involved. E.g., chatGPT gives a nice, clear summary of how to adapt Sutherland-Hodgman clipping to this when...

I'll keep this open as a reminder to one day implement a method to construct the symmetry-reduced or irreducible BZ.

> I would think you could just get the property names and loop over that? Then, if we add a new option it should automatically be covered. Yeah, that approach...