Simplicial Algorithms Over Labeled Uncertainty Space
EDMOND A. JONCKHEERE · 1997
Abstract This chapter is in the same spirit as the computational geometry algorithm for searching the crossover, as developed in Chapter 6. Both chapters share in common the concept of polyhedral dissection of the space of uncertainty and the idea of approximating the crossover with an assembly of simplexes. However, contrary to Chapter 6, the approach developed in the present chapter is meant to be approximative, with a bit of heuristics, but has the definite advantage of obviating the need for the rather formidable apparatus of Delaunay triangulation, point location, and simplicial approximation.