Sciweavers

413 search results - page 40 / 83
» Computing Distances between Surfaces Using Line Geometry
Sort
View
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 2 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
BMCBI
2010
95views more  BMCBI 2010»
14 years 9 months ago
Protein structure modelling and evaluation based on a 4-distance description of side-chain interactions
Background: Accurate evaluation and modelling of residue-residue interactions within and between proteins is a key aspect of computational structure prediction including homology ...
Vladimir Potapov, Mati Cohen, Yuval Inbar, Gideon ...
COMPGEOM
2010
ACM
15 years 2 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
DAGSTUHL
2010
14 years 11 months ago
Tracking Lines in Higher Order Tensor Fields
While tensors occur in many areas of science and engineering, little has been done to visualize tensors with order higher than two. Tensors of higher orders can be used for exampl...
Mario Hlawitschka, Gerik Scheuermann
IPPS
1997
IEEE
15 years 1 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...