464 search results - page 20 / 93 » On the Computational Complexity of Hierarchical Radiosity |
85
Voted
CGA
2004
14 years 9 months ago
2004
Point-based rendering is a compact and efficient means of displaying complex geometry. Our goal is to enable flexible point-based rendering, permitting local image refinement, req...
74
Voted
WG
1998
Springer
15 years 1 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
90
Voted
ICCAD
1993
IEEE
15 years 1 months ago
1993
IEEE
For submicron integrated circuits, 3D numerical techniques are required to accurately compute the values of the interconnect capacitances. In this paper, we describe an hierarchic...
83
Voted
ICNC
2005
Springer
15 years 3 months ago
2005
Springer
Advances in grid computing have recently sparkled the research and development of Grid problem solving environments for complex design. Parallelism in the form of distributed compu...
ICIP
2003
IEEE
15 years 2 months ago
2003
IEEE
Existing algorithms for exact helical cone beam (HCB) tomographic reconstruction are computationally infeasible for clinical applications. Their computational cost is dominated by...