I'm looking for a specific type of Delaunay tessellation algorithm.

The algorithm should be: 

* incremental so that I can add new sites inside known simplexes (i.e. no searching for the right simplex is necessary)
* usable with a high number of dimensions (100 or more)
* usable with a high number of sites (10000 or more)
* (bonus) parallelizable to multiple cores

So basically I want to start off with a single simplex, add a site to split the simplex, and then iteratively select a simplex, add a site into it, and fix the Delaynay tesselation. 

Am I looking for a unicorn here, or does something like this actually exist?
I've been using [Devijver and Dekesel](http://www.sciencedirect.com/science/article/pii/0167865583900697)'s algorithm, but it's time complexity in number of sites and dimensions is no good enough.