Sciweavers

1604 search results - page 50 / 321
» Approximation algorithms for developable surfaces
Sort
View
VISSYM
2007
13 years 11 months ago
Model-free Surface Visualization of Vascular Trees
Expressive and efficient visualizations of complex vascular structures are essential for medical applications, such as diagnosis and therapy planning. A variety of techniques has ...
Christian Schumann, Steffen Oeltze, Ragnar Bade, B...
CSC
2006
13 years 10 months ago
Simulation for Helium Atom Scattering From Stepped Surfaces
-- A computer program has been developed to simulate the helium atom scattering from stepped surface for both up hill and down hill scattering with diffraction kinematics chosen to...
Alauddin Ahmed, Ahmed Ryadh Hasan, Durdana Islam, ...
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 8 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
COMPGEOM
2004
ACM
14 years 2 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
MOBIHOC
2008
ACM
14 years 8 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...