Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
This paper describes a novel rendering technique for special relativistic visualization. It is an image-based method which allows to render high speed flights through real-world ...
In this paper, we propose a visual hull algorithm, which guarantees a correct construction even in the presence of partial occlusion, while “correct” here means that the real ...
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...