Sciweavers

876 search results - page 17 / 176
» Complexity in geometric SINR
Sort
View
MOBICOM
2005
ACM
14 years 1 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ICCS
2005
Springer
14 years 1 months ago
A Comparative Study of Acceleration Techniques for Geometric Visualization
Abstract. Nowadays computer graphics hardware presents a series of characteristics, such as AGP memory, vertex cache, etc., that can be used for real-time rendering. The aim of thi...
Pascual Castelló, J. Francisco Ramos, Migue...
IJCGA
2006
85views more  IJCGA 2006»
13 years 7 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
BIOCOMP
2006
13 years 9 months ago
Membrane Remodeling and Diffusion of Cytochrome C from a Geometrically Idealized Mitochondrial Crista
In healthy eukaryotic cells, mitochondria have an outer membrane that surrounds a complex inner membrane structure [7,8]. Cytochrome c is found in the space between the two membra...
John Manor, Peter Salamon, James Nulton, Joseph Ma...
VRML
1997
ACM
13 years 11 months ago
Lodestar: An Octree-Based Level of Detail Generator for VRML
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...
Dieter Schmalstieg