Sciweavers

264 search results - page 5 / 53
» Sample Sort on Meshes
Sort
View
VIS
2008
IEEE
176views Visualization» more  VIS 2008»
14 years 8 months ago
Particle-based Sampling and Meshing of Surfaces in Multimaterial Volumes
Abstract-- Methods that faithfully and robustly capture the geometry of complex material interfaces in labeled volume data are important for generating realistic and accurate visua...
Miriah Meyer, Ross Whitaker, Robert M. Kirby, C...
PICS
1998
13 years 8 months ago
Quantifying Perceptual Image Quality
This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scalar data. Instead o...
D. Amnon Silverstein, Joyce E. Farrell
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 8 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
ICALP
2010
Springer
13 years 9 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
IPPS
1998
IEEE
13 years 11 months ago
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu