Sciweavers

1075 search results - page 17 / 215
» Calculating the Number of Tunnels
Sort
View
92
Voted
AFRIGRAPH
2009
ACM
15 years 1 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage
JCB
2006
115views more  JCB 2006»
14 years 9 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
JCT
1998
70views more  JCT 1998»
14 years 9 months ago
Partitions into Distinct Parts and Elliptic Curves
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
Ken Ono
AFRIGRAPH
2003
ACM
15 years 1 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
60
Voted
CSC
2006
14 years 11 months ago
On the Number of Minimal Addition Chains
An addition chain for a natural number n is a sequence 1 = a0 < a1 < . . . < ar = n of numbers such that for each 0 < i r, ai = aj + ak for some 0 k j < i. Thurbe...
Hatem M. Bahig