Sciweavers

14850 search results - page 285 / 2970
» A Geometric Approach to Betweenness
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Adding one edge to planar graphs makes crossing number hard
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 ...
Sergio Cabello, Bojan Mohar
160
Voted
IPMU
2010
Springer
15 years 11 months ago
Plateau Regions: An Implementation Concept for Fuzzy Regions in Spatial Databases and GIS
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...
Virupaksha Kanjilal, Hechen Liu, Markus Schneider
SIGGRAPH
1996
ACM
15 years 10 months ago
The Lumigraph
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...
SIGGRAPH
2000
ACM
15 years 10 months ago
Out-of-core simplification of large polygonal models
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...
Peter Lindstrom
CVPR
2005
IEEE
15 years 8 months ago
Fast Illumination-Invariant Background Subtraction Using Two Views: Error Analysis, Sensor Placement and Applications
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 ...