We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
We extend to topological affine planes the standard theorems of convexity, among them the separation theorem, the anti-exchange theorem, Radon’s, Helly’s, Carath´eodory’s,...
Raghavan Dhandapani, Jacob E. Goodman, Andreas Hol...
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...
The availability of microarray data has enabled several studies on the application of aggregated classifiers for molecular classification. We present a combination of classifier ag...