2251 search results - page 109 / 451 » Geometric Algorithms on CUDA |
111
click to vote
GMP
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract. An important surface modeling problem in CAD is to connect two disjoint B-spline patches with the second-order geometric continuity. In this paper we present a study to s...
116
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
132
Voted
ESA
2003
Springer
15 years 8 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
126
click to vote
VIS
2009
IEEE
16 years 4 months ago
2009
IEEE
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....
141
Voted
CMPB
2010
15 years 3 months ago
2010
The use of cone beam computed tomography (CBCT) is growing in the clinical arena due to its ability to provide 3-D information during interventions, its high diagnostic quality (su...