121 search results - page 23 / 25 » Codegree problems for projective geometries |
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
VISUALIZATION
1997
IEEE
13 years 11 months ago
1997
IEEE
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
SIGGRAPH
2010
ACM
13 years 11 months ago
2010
ACM
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
VMV
2008
13 years 9 months ago
2008
Visualizing 3D flow fields intrinsically suffers from problems of clutter and occlusion. A common practice to alleviate these issues is to restrict the visualization to feature su...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...