Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Counterexamples for Non-disjunctive ions K. L. McMillan1 and L. D. Zuck2 1 Cadence Research Labs 2 University of Illinois at Chicago Counterexample-guided abstraction refinement (...
Abstract. Nowadays computer graphics hardware presents a series of characteristics, such as AGP memory, vertex cache, etc., that can be used for real-time rendering. The aim of thi...
Abstract. Traditional stereo algorithms implicitly use the frontal parallel plane assumption when exploiting contextual information, since the smoothness prior biases towards const...
Abstract. We define geometric self-structuring in a large-scale networked system as the ability of the participating nodes to collaboratively impose a geometric structure to the ne...