Sciweavers

264 search results - page 2 / 53
» Sample Sort on Meshes
Sort
View
VC
2008
88views more  VC 2008»
13 years 5 months ago
Evolution of T-spline level sets for meshing non-uniformly sampled and incomplete data
Given a large set of unorganized point sample data, we propose a new framework for computing a triangular mesh representing an approximating piecewise smooth surface. The data may ...
Huaiping Yang, Bert Jüttler
NIPS
2008
13 years 7 months ago
Spike Feature Extraction Using Informative Samples
This paper presents a new spike feature extraction algorithm that targets real-time spike sorting and facilitates miniaturized microchip implementation. The proposed algorithm has...
Zhi Yang, Qi Zhao, Wentai Liu
CGF
1999
159views more  CGF 1999»
13 years 5 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
13 years 11 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 7 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel