2593 search results - page 128 / 519 » Algorithms and Data Structures for Computer Topology |
172
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
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 ...
128
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper presents a comparative study of robust diffusion algorithms when used for smoothing structural fields applied in volumetric image interpolation. The input data consists...
172
click to vote
ICCAD
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
146
click to vote
VISUALIZATION
1997
IEEE
15 years 9 months ago
1997
IEEE
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
156
click to vote
ESA
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...