A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Abstract. Many geographical applications need to model spatial phenomena with vague or indeterminate boundaries and interiors. A popular paradigm adopted by the GIS community for t...
This paper discusses a new method for capturing the complete appearanceof both synthetic and realworld objects andscenes,representing this information, and then using this represe...
Steven J. Gortler, Radek Grzeszczuk, Richard Szeli...
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Background modeling and subtraction to detect new or moving objects in a scene is an important component of many intelligent video applications. Compared to a single camera, the u...
Ser-Nam Lim, Anurag Mittal, Larry S. Davis, Nikos ...