Sciweavers

103 search results - page 7 / 21
» An improved bound on the number of unit area triangles
Sort
View
APDC
1997
13 years 9 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
ICCAD
2004
IEEE
158views Hardware» more  ICCAD 2004»
14 years 4 months ago
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
Deming Chen, Jason Cong
TIP
2010
155views more  TIP 2010»
13 years 6 months ago
Is Denoising Dead?
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...
Priyam Chatterjee, Peyman Milanfar
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 6 months ago
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Multipath Routing
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
Yuxin Chen, Jeffrey Andrews
SMA
2008
ACM
203views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Interactive continuous collision detection between deformable models using connectivity-based culling
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
Min Tang, Sean Curtis, Sung-Eui Yoon, Dinesh Manoc...