1
vote
2answers
60 views

What is the equivalent of Delaunay tringulations in high dimensions?

For 2D manifolds, Delaunay triangulation is a very useful tool for coarse graining. It has the nice property that in the flat/euclidian manifold case, it reduces to a 2D simplicial tesselation of the ...
2
votes
2answers
92 views

What is a good way to simplicize the integer lattice?

I have a function $f$ defined on the positive integer lattice in $\mathbb{R}^n$ (i.e. the vectors in $\mathbb{R}^n$ whose coordinates are all nonnegative integers). I want to extend the domain of $f$ ...
3
votes
2answers
216 views

Triangulate rectangular parallelepiped in $\mathbb{R}^{n}$

I need to triangulate the n-dimensioned rectangular parallelepiped in $\mathbb{R}^{n}$ into a set of $n$-simplices. Could you suggest me any known algorithm for that or maybe an extension of Delaunay ...