Sciweavers

10 search results - page 2 / 2
» Point-in-polygon tests by convex decomposition
Sort
View
SIGGRAPH
1998
ACM
13 years 10 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 5 months ago
Restoration of Chopped and Nodded Images by Framelets
In infrared astronomy, an observed image from a chop and nod process can be considered as the result of passing the original image through a highpass filter. Here we propose a rest...
Jian-Feng Cai, Raymond H. Chan, Lixin Shen, Zuowei...
SIAMJO
2008
86views more  SIAMJO 2008»
13 years 5 months ago
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
Alexandre Belloni, Robert M. Freund
TWC
2008
135views more  TWC 2008»
13 years 5 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
SMA
2009
ACM
223views Solid Modeling» more  SMA 2009»
14 years 14 days ago
Particle-based forecast mechanism for continuous collision detection in deformable environments
Collision detection in geometrically complex scenes is crucial in physical simulations and real time applications. Works based on spatial hierarchical structures have been propose...
Thomas Jund, David Cazier, Jean-François Du...