1390 search results - page 51 / 278 » Computing the depth of a flat |
NPAR
2006
ACM
15 years 3 months ago
2006
ACM
We present techniques to create convincing high-quality watercolor illustrations of plants. Mainly focusing on the real-time rendering, we introduce methods to abstract the visual...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we present a new segmentation-based 2D mosaic framework. Most of current mosaic algorithms do not explicitly remove moving objects from images before registration, ...
AGILE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In cartography and computational geometry, concepts and techniques for automated label placement have been developed for twodimensional maps. Less is known whether these ...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
IWVF
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In this paper we propose two techniques to qualitatively estimate distance in monocular vision. Two kinds of approaches are described, the former based on texture analysi...