14377391
A Network Based Approach for Realtime Walkthrough of Massive Models
New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulll the real-time requirements necessary for interactive walk-through in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question. Their prototypical implementation presented in this work uses common libraries on standard workstations and thus represents a rst strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step.
14681345
The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments
We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects.For the computation of an approximate image of the scene, a sampling technique is used. In the preprocessing, a so-called sample tree is built whose nodes contain randomly selected polygons from the scene. This tree only uses space that is linear in the number of polygons. In order to produce an image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk.We implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology.
29746533
Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations
1648746
Experience in early and late software engineering project courses
We report on the experience we gained in different software engineering project courses at our department. A student who is specialized in software engineering has to complete, besides lectures on software engineering and related fields, two project courses: an "early" basic project course, and a "late" complex project course. For both of them we developed leveled teaching approaches considering the different knowledge and skills of beginners and "advanced" students, respectively. The paper describes, discusses and evaluates these approaches.
15236721
Bounds on secret key exchange using a random deal of cards
We present a general model for communication among a “team” of players overheard by a passive eavesdropper, Eve, in which all players including Eve are given private inputs that may be correlated. We define and explore secret key exchange in this model. Our secrecy requirements are information-theoretic and hold even if Eve is computationally unlimited. In particular, we consider the situation in which the team players are dealt hands of cards of prespecified sizes from a known deck of distinct cards. We explore when the team players can use the information contained in their hands to determine a value that each team player knows exactly but Eve cannot guess.
2458859
Impossibility of distributed consensus with one faulty process
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the "Byzantine Generals" problem.
207660233
Impossibility of distributed consensus with one faulty process
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the “Byzantine Generals” problem.