Titlebook: Experimental Algorithms; 8th International Sy Jan Vahrenhold Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 algorithm.a

夾死提手勢(shì)

Rotated-Box Trees: A Lightweight ,-Oriented Bounding-Volume Hierarchy ,We introduce a new type of bounding-volume hierarchy, the ., or .-.-tree for short. A .-.-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new .-.-tree to two existing bounding-volumes hierarchies, namely .-.-tree and box-trees.

推測(cè)

商店街

Measuring the Similarity of Geometric Graphs,What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.

容易懂得

Charlotte Holgersson,Britt ?stlundon computing a feasible solution of the linear program that is as far as possible from satisfying an inequality at equality. To realize such an approach, we have to detect the set of inequalities that can only be satisfied at equality..Compared to previous approaches for this problem our algorithm has a much higher rate of success.

河潭

neoplasm

BRAVE

顯而易見(jiàn)

Classify

CEDE

Nguyen Phong Nguyen,Emmanuel Mogajint tuned variants of the already existing .-algorithm being up to 15 times faster than .. A surprising outcome of the paper is the astonishing level of data dependency of the algorithms. More detailed descriptions and further experimental results of this work can be found in [1].