In this paper we introduce a VR system extension that focuses on the creation of interactive, dynamic Virtual Environments. The extension uses the recently developed programming concept, Functional Reactive Programming. ...

Depth enhanced panoramas are a practical solution to the difficult problem of inside-looking-out modeling. Depth enhanced panoramas extend color panoramas to support viewpoint translation, while retaining their speed, ...

We present a method for dealing with degenerate situations in an exact boundary evaluation system. We describe the possible degeneracies that can arise and how to detect them. We then present a numeric perturbation method ...

The impulse-based dynamic simulation is a recent method to compute physically based simulations. It supports the simulation of rigid-bodies and particles connected by all kinds of implicit constraints. In recent years the ...

The computer vision and computer graphics fields have been developing largely independently since their genesis in the early 1960s. However, there is now a significant amount of exciting research at the intersection of ...

In this work a new approach of the visualization of unsteady high-resolution flow data in a network processing chain using property-enhanced traced particles or pathlines is presented. This approach allows to select subsets ...

In an application where sparse matching of feature points is used towards fast scene reconstruction, the choice of the type of features to be matched has an important impact on the quality of the resulting model. In this ...

The medial axis (MA) of an object and medial axis transform (MAT) have many applications in solid modeling, computer graphics and other areas. Exact computation of MA is complex and various medial axis approximation ...

Image-space occlusion culling is an useful approach to reduce the rendering load of large polygonal models in scienti c computing, mechanical engineering, or virtual medicine. Like most large model techniques, occlusion ...

Surface interrogation and intersection depend crucially on good root-finding algorithms, which in turn depend on accurate polynomial evaluation. Conventional algorithms for evaluation typically encounter difficulties near ...