Sciweavers

5962 search results - page 822 / 1193
» Efficient Clustering for Orders
Sort
View
197
Voted
GRAPHICSINTERFACE
2001
15 years 8 months ago
Accelerated Splatting using a 3D Adjacency Data Structure
We introduce a new acceleration to the standard splatting volume rendering algorithm. Our method achieves full colour (32-bit), depth-sorted and shaded volume rendering significan...
Jeff Orchard, Torsten Möller
MSV
2004
15 years 8 months ago
Design and Implementation of a Workflow Rendering Engine
Business visualization is an effective tool for business decision making and problem solving. Despite its obvious benefits, 3D visualization is far less common in practice than it...
Jason A. Pamplin, Ying Zhu
200
Voted
OPODIS
2001
15 years 8 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
SBBD
2004
82views Database» more  SBBD 2004»
15 years 8 months ago
FramePersist: An Object Persistence Framework for Mobile Device Applications
Traditional requirements for persistence layers do not consider limitations of the development platforms available for mobile devices. In order to facilitate the development of ap...
Katy C. P. Magalhães, Windson V. Carvalho, ...
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 8 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount