VRML History: Storing And Browsing Temporal 3D-Worlds

Size: px
Start display at page:

Download "VRML History: Storing And Browsing Temporal 3D-Worlds"

Transcription

1 VRML History: Storing And Browsing Temporal 3D-Worlds Hartmut Luttermann Manfred Grauer University of Siegen Abstract Spatio-temporal data are presented and explored by VR-based visualization systems which offer 3D-navigation and time-navigation for better immersion and analysis. If the visualization results are disseminated on the WWW, they are mostly transformed into videos or, recently, into animated VRML-files which neither support 3D-navigation nor time navigation nor a time-referenced data representation. In this paper, the script language VRML History is proposed which supports the description of spatio-temporal worlds on the internet by conceptually extending VRML with a new time dimension. This is realized by a set of new nodes representing temporal geometries and time references, and a set of Java-classes extending standard VRML-browsers to perform time navigation. CR Categories and Subject Descriptors: I.3.6 [Computer Graphics]: Methodology and Techniques I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism Animation, Virtual Reality H.5.2. [Information Interfaces and Presentation]: User Interfaces Interaction Styles H.4.3 [Information Systems Applications]: Communications Applications Information Browsers Additional Keywords: Spatio-Temporal Data, Data Visualization, Data Modeling, VRML 1 INTRODUCTION In the last years, the amount of temporal (historical) and especially spatio-temporal data has dramatically increased. They are produced by scientific experiments and simulations or recorded in data warehouses and temporal GIS for making management decisions more reliable and comprehensible [12, 2]. One particular point of research is the temporal nature of the data: how does a special feature behave at certain times and how does it evolve over time [9]. The presentation and exploration of spatio-temporal data is performed by special visualization systems which transform data into a graphical form [12, 7]. Many times, the temporal nature of the data leads to animated visualizations which depict change over time. There are two kinds of animations [4, 14]: temporal and cartographic animations. In temporal animations, a change in the presented objects is based on temporal data. In cartographic animations, there is a change relative to factors other than time, identified University of Siegen, D Siegen, Germany fhartmut,grauerg@fb5.uni-siegen.de, as the visual animation variables [11], such as a change in the camera position, ligth source or other non-temporal variables. Therefore, VR-based interaction methods like navigating the spatial or temporal dimension of the visualization are offered to better investigate the data set and immerse in the presented virtual objects. In many applications, these visualizations are published in the WWW because of e.g. knowledge transmission, cooperative work, marketing, or documentation. Animations are transformed into videos or, recently, into animated VRML-files because they keep the temporal nature of the visualization. While videos do not support 3D-navigation, VRML itself does not support a technique which controls the time dimension of the visualization during the presentation. Instead, VRML-animations can neither be interactively stopped nor run backwards (possibly with different speeds). In the worst case, single frames may be skipped depending on the system s frame rate. Additionally, VRML does not allow a distinction of the presentation of temporal data and cartographic animations because in the representation of the visualization every change is referenced to some unique time during presentation. A simple solution is a VRML-based navigation interface which controls the time used for animations. But this time is local to the specific animation object and does not give control to the whole scene. Additionally, there is no support for the description of temporal data. In visualization systems, there are two main approaches to store this type of visualization. Some systems store the basic spatio-temporal data together with a script instructing how to create the visualization [15, 19]. Others store the visualization itself using a proprietary, system-dependent file format [13, 8]. In both cases, browsing the visualization requires the specific visualization system and enough operating knowledge on the user s side. Recently, new graphic libraries and graphic file formats were developed, e.g. Java3D, Chromeeffects or ScriptV [20], but all of them treat the presentation of temporal data like a cartographic animation without any time navigation technique. In this paper, VRML History [21] is described which consists of a set of nodes extending VRML with a new time dimension and a set of Java-classes extending a standard VRML-browser with a time navigation technique. With VRML History, spatio-temporal object data in 3D-worlds can be described, stored in VRML-files on the internet, and explored spatially and temporally by a VRMLbrowser. 2 TEMPORAL DATA MODELING Temporal data modeling is an essential part in the description of temporal 3D-worlds which involves concepts like valid time and time-variant objects. 2.1 System Time vs. Valid Time The time concept existing in VRML simulates approximately real time by generating events as time passes. Therefore, it is not changeable by the viewer. For a better distinction, this time is called system time. All events specified in VRML are referencing this time and consequently, are only activated if they are referenced to a time

2 during the presentation of a VRML-scene. Practically, they all are anchored relative to the beginning of the presentation. Future and past events being activated during presentation are only possible if a new time dimension, called valid time ([Snod95],[Lan92]), is introduced. Valid time is independent of system time and specifies the time when an event or a state was valid, is valid or will be valid in the real world. During presentation a specific valid time value only changeable by the viewer is used to show only those events or states which are valid at that time. The time model of valid time is linear and continuous to be independent of the resolution of discrete time values. With valid time, each object can be shifted to a temporal object o : (a0; :::; a n; vp) described by the attributes a i and by the valid period vp. The valid period restricts the time of existence or validity of the object in the temporal world to the time period [t0; t n): The object starts to exist at t0 (object s birth) and dies at t n. Outside this period the object does not exist, i.e. there is no information or representation of the object available. A temporal object can always be valid, i.e. the valid period specifies (?1;1). 2.2 Time-Invariant vs. Time-Variant Objects Integrating valid time moves the formerly only spatial world to a spatio-temporal world with many temporal 3D-objects whose spatial or graphical description may be time-invariant or time-variant. Time-invariant objects possess only one non-changeable representation which is valid during the given valid period. Time-variant objects may have different representations (versions) v i where each is valid at the associated version time period [t i; t i+1) existing during the valid period of the object: o : (v : (v0; :::; v n?1); vp : [t0; :::; t n)). If no representation exists at a version time period this simulates the invisibility of the object at this period which is an allowed representation. The set of version time periods of each object is mutually exclusive and sums up to the valid period of the object because temporal objects can accept only one version of itself at each point in valid time. The list of consecutive representations one object possesses during its valid period is called version history. Different types of version histories can be identified in the real world which affect the semantical interpretation of how objects do evolve over time: they may describe a) a series of discrete, constant versions, where one version is valid until the consecutive version starts immediately (step-wise function). This type is mostly used for administratively registered spatial data (e.g. borderlines, streets, real estate). Or b) a time series, i.e. a sequence of pairs of discrete versions and time values forming the base points of a continuously changing, linearly interpolated property, which are mostly used for natural phenomena (e.g. ground water level, moving car). A special case are events which have only one version valid at a very short period approximating a moment in time (e.g. accidents). Each version has its own version time period, i.e. is timestamped. The question what a version describes is very important for temporal data modeling and storage [17]. Normally, each version describes the whole object representation (v i(o) = (a0i; a1i; :::; a ni)) which is called tuple-timestamping [16]. If some attributes are constant, while others change very frequently at different times this would lead to many redundant attribute values. Therefore, a less redundant and spaceconsuming data structure called attribute-timestamping [1] exists which stores a timestamped version history to each single attribute (o : ((v a0 ; vp a0 ); :::; (v an ; vp an ))), though leading to a split object description. Although attribute-timestamping is preferred, both strategies should be offered to the author for describing spatiotemporal data because the efficiency (related to redundancy, space efficiency and data access) depends mainly on the data itself. 3 TIME NAVIGATION Presentation tools need a real-time interaction method which allows the viewer to investigate the temporal dimension of the visualization. Like in 3D-navigation, a special viewpoint in the valid time dimension is needed from which the temporal world is currently viewed by the user. In this view, only those objects and their representation are shown which are valid at the time given by the current viewpoint, such as a time-slice or snapshot of the temporal world. Changing this valid time allows the viewer to move through the temporal dimension of the world. The time navigation should be performed in parallel to the spatial navigation because both dimensions are independent. It should be global, i.e. performed synchronously to all objects defined in the temporal world. For the viewer, this is more intuitive and the presented scene is easier to be understood and recognized than if the local valid time of each object is changed independently like in [8] because the viewer has to keep in mind the chosen time values of every object presented. Instead, if some applications (e.g. scheduling, simulations) need to view different objects at different valid times, an easier technique is to move the valid period of these objects along the valid time dimension by e.g. an interactively given time offset for each object. Being aware of the valid time presented in the current scene might even be a big problem in the global time navigation paradigm because only one snapshot of the temporal world is shown which is not sufficient for the viewer to get an overview of the temporal dimension of the world. However, in the 3D-navigation this is possible by the spatial perspective view. Additionally, during presentation it is important to distinguish between change based on system time (cartographic animation) and change based on valid time. Therefore, some additional visual information are useful to tackle these problems, e.g. displaying the current valid time or a virtual time line showing the time of existence of all objects in the world. During presentation, events need a special handling because they are hard to be discovered. While navigating in the time dimension, their time of existence quite often falls in between two presented snapshots. If they are presented in a single snapshot, no information about their moment-like valid period is shown. 4 REALIZATION VRML is extended by a set of new and changed nodes (VRML History) to realize the concepts and requirements described above. In the following, these nodes are explained, justified, and compared with other realization options. It is assumed that the reader is familiar with the VRML-notation. 4.1 Valid Time Definition The ValidPeriod node is designed to define the validity of objects as well as of its versions by specifying a list of consecutive times (t0; :::; t n) via the period field. ValidPeriod { exposedfield SFBool loop FALSE exposedfield MFTime period [] exposedfield SFTime periodoffset 0.0 Let n times t0; t1; :::; t n partition the time domain (?1; +1) into n+2 subintervals given by (?1; t0); [t0; t1); :::; [t n; +1) each subinterval defines one version time period and the interval [t0; t n) defines the valid period of the object. For each subinterval 2

3 in the valid period a version may be defined. In the subintervals (?1; t0) and [t n; +1) the object does not exist, i.e. no version is valid. Time periods are designed as closed-open intervals, i.e. the time concluding a period simultaneously describes the beginning of the next period. Sometimes, a version is valid only at one discrete moment, i.e. the associating version time period has no duration. For this special case a closed subinterval [t i] may be defined which automatically changes the following subinterval from a closed-open into an open subinterval: :::; [t i]; (t i; t i+1); :::. The starting times of the version time periods are defined relative to an absolute time offset given by the field periodoffset which is mostly used in scientific experiments and simulations. The field loop specifies whether the version history of the object is periodical (e.g. tides), i.e. whether the first, second, etc. version is valid again right after the last version. All time values are given as numbers relative to a global time origin. This avoids parsing time values with different date formats and calendars. In VRML, values of the system time (type SFTime) are defined as seconds since 1 January 1970,00:00:00. For the valid time, the same is assumed, but other application-dependent units (e.g. days, years) may be used because valid time has no link to system time which has to use one time unit to identify specific times. 4.2 Which VRML-Objects may be Time-Variant? VRML supports nodes of various semantical types: grouping, graphical shape including sound, geometry, and appearance (with color, texture, and movie), environment, light, sensor, interpolator, and description. An extension with valid time does not make sense for grouping (which are structural elements), interpolator (which are functional descriptions of pairs of values), and description nodes (which are meta information to a visualization) because their meaning is time-independent. Sensor nodes (not TimeSenor) which are designed to react on user interactions may be active only in a limited period in valid time. Graphical shape and light nodes are the only ones which may have a limited validity and time-variant characteristics. Environmental nodes, like Background and Fog, are valid forever even in a temporal world, but may change their properties like their corresponding natural phenomena. For a seamless integration of VRML97 in VRML History, by default, every VRML97-object is time-invariant with the implicit valid period (?1;1). 4.3 Limited Validity and Time-Referenced Object Versions The new grouping node History is designed to limit the validity of its childrens. History { exposedfield SFNode validperiod NULL exposedfield MFNode version [] Each child v i given in the version field specifies a local temporal world whose validity is given by the associated version time period i specified in the ValidPeriod node which is defined in the validperiod field. Regardless of being time-invariant or time-variant, the maximal time of existence of each children is limited to the associated version time period and does not exist outside this period. This node can be used for two representations of temporal data: a) to limit the validity of a time-invariant object (possibly a VRMLobject) given as a child; b) to specify a time-variant object whose representation is changing in a step-wise mode, i.e. consists of a series of constant object versions. The valid period of this timevariant object is given by the sum of all version time periods. 4.4 Temporal Scene Graph In VRML, all objects are stored in a scene graph combined with geometrical transformations to determine the absolute location of the objects in the world. To determine the period of validity of each object in the world, valid time is integrated in the scene graph yielding a temporal scene graph (Fig. 1). The maximal validity of each child, regardless of being a time-invariant or time-variant object, is given by the version time period of the parent. Following the branches from the root of the temporal scene graph to the leaves, the period of validity of each branch can be limited again and again by History nodes (circles with time periods inside). The History node can also be the root of a set of children each giving its own mutual exclusive validity. The world specified with the root of the temporal scene graph is always valid, i.e. (?1;1). The temporal scene graph does not contain temporal transformations like move or scale because both are rarely used in the description of time information of temporal data. Instead of using relative time values transformed by multiple move operations possibly with different units (e.g. years, months, days), absolute time values are used more often by the user. [00, 80) [30, 70) (-oo, oo) [60, 70) [70, 85) [85, 99) [70, 75)[75, 80) [50, 99) [00,80) [30,70) [60,70) [70,75) [75,80) [70,85) [85,99) [50,99) Figure 1: Temporal scene graph with different valid periods. 4.5 Time-Referenced Attribute Versions Attributes of time-variant objects are time-invariant or time-variant during the valid period of the object. Time-invariant attributes have only one value and are specified as defined in VRML. Time-variant attributes have multiple different values (versions), each valid at a specific version time period during the valid period of the object. Time-variant attributes change their versions instantly or continuously. In both cases, if the type of the single- or multiple-valued attribute is numerical, the time-referenced change is modelled via time series decribed in the next subsection. Categorical attributes (textual, boolean, image or node type) are normally time-invariant, especially in many VRML-nodes, but if these attributes should be time-variant they have to be modelled via time-referenced object versions. There are two special attributes of graphical objects which are handled separately because they may change frequently in valid time: geometry and texture. The HistoryGeometry node is designed to handle time-variant geometries and the HistoryTexture node to handle time-variant textures. 3

4 HistoryGeometry { exposedfield SFNode validperiod NULL exposedfield MFNode geometry [] HistoryTexture { exposedfield SFNode validperiod NULL exposedfield MFNode texture [] The HistoryGeometry node is usable for complex geometries like IndexedLineSet or IndexedFaceSet especially if they contain different amounts of coordinate points. These geometry types (instead of the simple geometry types Box, Cylinder, Cone and Sphere) include the spatial location and therefore mostly do not need any spatial transformation. Both nodes allow a possible implementation of morphing algorithms for geometries and textures, which do not yet exist in VRML. 4.6 Time Series of Numerical Attributes Time series describe a list of pairs of attribute values and associated time values which are the base points of a linearly interpolated attribute function. They are used to compute and set the temporal values of time-variant numerical attributes according to the valid time used for current presentation. In our proposal, time series are divided into the time value definition (ValidTimeSensor) and the attribute value definition (Interpolator). Both nodes are linked together and further linked with the specific numerical attribute by employing the event routing technique, i.e. events are sent on defined routes from the ValidTimeSensor to the Interpolator and then to the attribute to change its value. This concept uses existing VRML-nodes and is more flexible than developing special time series nodes parametrized by the valid time. The ValidTimeSensor node is a sensor object which sends events if the viewer moves (employing time navigation) within a time period in valid time dimension given by the validperiod field. ValidTimeSensor { exposedfield SFBool enabled TRUE exposedfield SFNode validperiod NULL eventout SFFloat fraction_changed eventout SFBool isactive eventout SFTime validtime The field validperiod simultaneously specifies the list of all time values of the base points of the time series (in the ValidPeriod node). The value of each event, sent by the fraction changed field on each time navigation action, is computed from the current valid time and the given list of time values. The Interpolator node is required to specify the attribute values of the base points of the time series (via keyvalue field). Based on the events received from the ValidTimeSensor this node interpolates linearly the new temporal attribute value among the attribute values of the given base points. There are various Interpolator node types according to the different attribute types. Here, a ScalarInterpolator is shown as an example: ScalarInterpolator { eventin SFFloat set_fraction exposedfield MFFloat key [] exposedfield MFFloat keyvalue [] eventout SFFloat value_changed Interpolator nodes use a linear interpolation to compute new values. Quadratic, cubic or other functional descriptions may reduce the amount of base points needed to approximate a given timevariant behaviour. But linear interpolation is modelled more simply and easier to handle mathematically. Even in database systems, continuously time-variant attributes are stored using linear interpolation [17, 5]. 4.7 Time Navigation To support time navigation, the current location of the viewer is extended with valid time which is responsible for the current snapshot of the temporal 3D-world. Only those objects and their representation whose version time period contain the current valid time are presented. In the temporal scene graph (Fig. 1) this means that only the branches containing the current valid time are used for rendering. The Viewpoint node specifies spatial and temporal key locations given by the field position, orientation, and valid time. Viewpoint {... exposedfield SFTime validtime # added An author can automatically move the user s view through the valid time dimension (i.e. doing a time journey) by binding the user to a Viewpoint and then animating the validtime field of this Viewpoint by a TimeInterpolator. The TimeInterpolator node interpolates linearly among a list of time values specified in the field keyvalue. TimeInterpolator { eventin SFFloat set_fraction exposedfield MFFloat key [] exposedfield MFTime keyvalue [] eventout SFTime value_changed The NavigationInfo node specifies the characteristics of the desired navigation behaviour, i.e. the physical parameters of the viewer, the viewing model and the navigation paradigm. The Navigation paradigm describes the way the position, orientation and valid time of the current viewpoint may be changed. To explore the valid time dimension two new navigation paradigms are introduced in the field type of the NavigationInfo node: TIME WALK and TIME-STUDY. The actual user interface provided to accomplish these navigation paradigms is described in the implementation section. One important feature of an immersed presentation while navigating in 3D-worlds is collision detection. While time navigation is performed, this feature may confuse the viewer because there are unknown objects in the future or past which may collide with the viewer, yielding an unexpected or unrecognized adjustment of the viewer s position. Therefore, browsers should disable collision detection during navigating in the valid time dimension. 4.8 Temporal Sensors Sensors may be specified with limited validity according to valid time by grouping the sensor as one version of the History node. The ValidTimeSensor described above is designed to react if the viewer navigates in a specified period in valid time dimension. The ProximitySensor generates events (e.g. via the validtime changed field) when the viewer enters, exits, or moves within a given spatiotemporal region in the world (equal to a 4D-region) defined by the fields center, size and validperiod. 4

5 GUI Time Navigation Valid Time of Current Viewpoint Temporal Scene Graph ValidPeriod Nodes VRML- Browser Script Presentation Reactions Object and Attribute Versions Nontemporal Scene Graph Figure 2: Functional concept of time navigation. ProximitySensor {... exposedfield SFNode validperiod eventout... NULL # added SFTime validtime_changed # added This Sensor object may also be created by limiting the validity of a ProximitySensor by a History node. This solution sends the entering and exiting events exactly like the Sensor above, but does not send events on time navigation. 5 IMPLEMENTATION ISSUES 5.1 Extending the Language All new and changed node types are defined and implemented via the external prototyping feature of VRML. The prototype definition is realized in VRML and Java (via the Script node) and stored in external files which are loaded and executed by the VRML-browser only if needed [21]. Unfortunately, the prototype definitions are browser-specific because the two VRML-browser mostly used (Intervista s WorldView and SGI s CosmoPlayer) have realized event routing between the prototype interface and Script node in different ways. There are two possibilities to store browser-specific prototype definitions: using the universal resource name identifier or files locally stored on each computer. The former concept is not standardized among the VRML-browsers until now, and therefore, the second choice is used to transparently offer browser-specific implementations. 5.2 Time Navigation in the VRML-Browser A set of Java-classes extend the functionality of the VRML-browser to offer a time navigation technique to the viewer. Conceptually, Fig. 2 shows how the time navigation is implemented in the VRML-browser. A navigation action is prompted by the viewer through the time navigation instruments of the browser s GUI or by a script stored in the scene graph of the temporal visualization. Each action changes the valid time of the current viewpoint. The newest valid time is taken to perform the current presentation, i.e. to traverse the temporal scene graph to identify which objects and versions are valid at that valid time, and where they are positioned in the current view. This may cause some other reactions in the scene graph, e.g. new events changing other objects or attributes, but these are executed before a new traversal with the next valid time is performed. Current VRML-browsers manage only a non-temporal scene graph. Therefore, in this implementation the traversal of the temporal scene graph is split into searching all valid objects and their versions, updating the non-temporal scene graph with the new versions and then traversing this scene graph by the browser to render the presentation. In more detail, the search for valid objects is done by searching all ValidPeriod nodes in an internal node storage list and identifying the versions of the objects using that ValidPeriod nodes which are valid at the current valid time. This is performed asynchronically to be timely independent of prompting for navigation actions. This solution has some benefits and drawbacks: One benefit is that this concept and its implementation can be used in every VRML-browser which supports the Java Scripting Authoring Interface (JSAI) in the Script node. Additionally, the implementation can be accelerated by using a time index which accesses the relevant set of object versions more quickly [17]. On the other hand, searching for valid object versions does not consider the current scene graph and location of the viewer. Some objects are spatially not visible in the current presentation because of the view direction and position, the level of detail, or the switch state. If a browser is enhanced by a spatial index this might not really work because temporal objects partly exist in the non-temporal scene graph without any geometries, and whenever a time navigation action is performed, the scene graph is updated with new geometries which then may cause an undesired spatial index update. 5.3 Navigation Instruments The navigation instruments consists of three elements (see Fig. 3): a) a time display shows textually the current valid time in different possible modes (as e.g. date, numbers, simulation ticks); b) the navigation controls allow the viewer to change the current valid time by pressing and/or dragging the mouse on the arrows in different modes: step-wise or continuous, slow or fast, forward or backward; and c) a virtual time line renders the valid periods of all temporal objects described in the visualization in two different resolutions in relation to the current valid time. 2 x Virtual Time Line Time Display Navigation Controls Current Valid Time Valid Periods of Temporal Objects Figure 3: Time navigation instruments displayed in the VRMLbrowser. 5

6 Figure 4: Snapshots showing a temporal ground water head. With these instruments, while navigating in the time dimension the viewer keeps in mind the time reference of the current snapshot presented, the time navigation speed, and the time of existence and temporal location of future or past temporal objects. Furthermore, the viewer may deduce data change in the world from identified discrete states of objects and from the recognized sequence of these states including their continuous and instant transitions, and may conclude the speed of change from comparing the time-references of each change. 6 APPLICATION OF VRML HISTORY Two example applications which commonly explore spatiotemporal data sets are presented to show the use of VRML History: a visualization of temporal finite-element method (FEM) data and a visualization of temporal GIS-data. The description of the VRML History scenes of both examples can be browsed at [21]. 6.1 Visualization of Temporal FEM-Data In the first application, VRML History was used to publish a visualization of temporal FEM-data which should be geographically and temporally explorable at project partners, at exhibitions or in the internet by using simple browsing tools. The background problem consists of an optimization problem: in a high water region the pumping costs (energy) of a well should be minimized over a year. The optimization algorithm [6] is linked with the FEM-simulation program Feflow [3] that checks the nonlinear constraint whether the ground water head which changes temporally and geographically by the pump rate will reach a specified upper level at a special control point. The resulting FEM-data representing the temporal ground water head are documented and explored to possibly improve the optimization results. In Fig. 4 (visualized with Netscape Navigator and SGI CosmoPlayer) several snapshots of the ground water head over a year are shown including the location of the control point (red/dark grey cylinder) and the upper level of ground water at that point (the almost transparent grey rectangle). The resulting VRML-file is automatically written by a exclusively developed filter in the simulation program. The data stored as the temporal visualization form a colored triangle irregular network (TIN) at 34 different valid times. The geographical extension is given by that one of the finite elements. The times are chosen by the automatic time stepping algorithm of the simulation program and is later further reduced manually. The TINs are modelled as the base points of a geometrical time series which yields a continuously changing shape by a linear interpolation during presentation. The VRML-file s size is about 1.2 MB, compressed 250 KB. Different valid times, viewpoint positions and orientations can be explored. 6.2 Visualization of Temporal GIS-Data An application of a visualization front-end to a Temporal GIS [10] is demonstrated by visualizing a set of synthetically produced GIS-data. GIS-data consists of sets of polygonal data (2D/3Dcoordinates shaping region or line objects) describing the spatial extension of geographical objects (e.g. buildings, streets, cities, states), some non-geometrical data describing the characteristics of the geographical objects (e.g. ownership, soil of estates, roadway state, traffic density on streets), surface data, and some satellite or survey imageries. In many applications (e.g. real estate, survey, environmental studies, geo-marketing, archaeology) all this data are seen in a temporal context which, especially, allows two types of research directions: analysis of historical and current processes as well as prediction and analysis of future states in changing environments. Here, the historical development of a city according to the construction of buildings is shown (Fig. 5). The data stored as the temporal visualization are sets of temporal objects with different versions of geometries and appearances and different validities. The sea level is changing during time navigation describing higher and lower tides. Note that the waves are animated not by valid time but system time which can not be navigated by the viewer. 7 DISCUSSION AND FUTURE WORK A special problem is the description of chaotic and nonlinear behaviour of objects or sets of objects over time, especially, if this changes the time of existence of some objects (e.g. clouds of particles, smoke, explosion of objects, morphing). This behaviour is badly described by linear interpolation or step-wise functions because too many base points are needed to match the given behaviour. Sometimes, more special, i.e. functional, stochastic, evolutionary or morphing descriptions would be more apropriate. Therefore, new nodes have to be developed and integrated to meet these requirements. In our proposal, all time values are defined as numerical values relative to a global time origin like in VRML itself. Although this representation is very easy to manage, most time information 6

7 Figure 5: Snapshots showing historical views of a city. is stored by the user using readable dates and times based on a specific calendar. Even in database systems time values are stored as dates and times to be readable to the user [16]. Integrating different date and time formats, even calendars in the proposal would have unnecessarily enlarged the implementation of the parser tool. A good compromise is if this special feature will be moved to the client side, i.e. extending editing and authoring tools with userspecific calendar semantics and date/time formats which transforms the given absolute time values in relative time values processable by VRML History. Normally, the description of historical spatial informations enlarges the VRML-file many times. Huge files increase not only the time for downloading files from the internet but also the time to build up the scene graph in the browser and to generate the presentation. There are various approaches to reduce the file size. The author of the VRML-file can reduce the spatial and temporal base points by using linear interpolation or a generalization method which deletes some base points according to the rendering resolution of the screen [12]. Other approaches are independent of the file contents which are all discussed by the VRML-community: reusing existing objects of the description, file compressing, binary file format, contents streaming. Especially contents streaming seems to be very promising for temporal data because one snapshot of the temporal world can be shown in the browser while the others a further loaded. The spatio-temporal description also leads to a huge scene graph and object storage in the browser. Many objects do not need to be processed because they are not visible in the current view depending on the current viewpoint position, orientation and valid time. For static temporal scenes, a spatio-temporal access method may be very usable to reach the relevant set of objects in a short time [18]. A feature which is often subjectly accompanied by temporal data is version and configuration control of worlds. This feature may also be realized with VRML History but in that subject each version describes a discrete editing state of a possibly even temporal 3Dworld which are constructed as finished steps in a longer or branching editing process. Additionally, some VRML-nodes can not be versioned in this way because they are not extended with valid time in this proposal. Version control may be a future research field for VRML-files. 8 CONCLUSION This paper outlined our approach, called VRML History, to store spatio-temporal objects in VRML-files on the WWW and to browse them spatially and temporally by featuring a time navigation technique. One important concept of VRML History is the distinction of the system time included in VRML and the new time dimension valid time. Now, temporal visualization can be created where valid time may be explored by time navigation and system time may be used for cartographic animations. References [1] J. Clifford and A. Crocker. The Historical Relational Data Model (HRDM) and Algebra Based on Lifespans. In Proceedings of 3rd International Conference on Data Engineering, Los Angeles, pages , [2] P. Chamoni and P. Gluchowski, editors. Analytische Informationssysteme: Data Warehouse, Online Analytical Processing, Data Mining. Springer, [3] H.-J. G. Diersch and R. Gründler. GIS-based Groundwater Flow and Transport Modeling - The Simulation system FE- FLOW. In HYDROGIS 93, Wien, [4] D. Dransch. Temporale und Nontemporale Computer- Animation in der Kartographie. Selbstverlag FB Geowissenschaften, FU Berlin, [5] M. Erwig, R.H. Güting, M. Schneider and M. Vazirgiannis. Spatio-temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases. In 1. CHOROCHRONOS Workshop on Spatio-Temporal Database Systems, Petronell-Carnuntum, Austria, Nov [6] M. Grauer and T. Barth. Multidisciplinary Optimization and Cluster Computing using the OpTiX-Workbench. In A.D. Belegundu and F. Mistree, editors, Optimization in Industry 1997 Conference Proceedings, pages ASME, [7] N. Gershon and S.G. Eick. Information Visualization. IEEE Computer Graphics and Applications, 17(4):29-31, Jul/Aug [8] GRAPE Manual. Inst. of Applied Mathematics, University of Bonn and of Freiburg, [9] G. Langran. Time in Geographical Information Systems. Taylor & Francis, [10] H. Luttermann and A. Blobel. CHRONOS: A Spatio- Temporal Data Server for a GIS. In H. Kremers and W. Pillmann, editors, Space and Time in Evironmental Information Systems, CSEP 95, pages Metropolis,

8 [11] N. Magnenat-Thalmann and D. Thalmann. Computer- Animation: Theory and Practice. Springer, [12] G.M. Nielsen, H. Hagen and H. Müller, editors. Scientific Visualization: Overview, Methodologies, Techniques. IEEE Computer Society Press, [13] University of Minnesota. GeomView. [14] M.P. Peterson. Interactive and Animated Cartography. Prentice Hall, [15] W.J. Schroeder, K.M. Martin and W.E. Lorensen. The Visualization Toolkit: An Object-Oriented Approach To 3D Graphics. Prentice Hall, [16] R.T. Snodgras, editor. The TSQL2 Temporal Query Language. Kluwer Academic Press, [17] A.U. Tansel, J. Clifford, S.K. Gadia, S. Jajodia, A. Segev and R.T. Snodgras, editors. Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings, [18] Y. Theodoridis. Indexing Methods for Spatiotemporal Databases. In 1. CHOROCHRONOS Workshop on Spatio- Temporal Database Systems, Petronell-Carnuntum, Austria, Nov [19] C. Upson, T. Faulhaber, D. Kamins, D. Laidlaw, D. Schlegel, J. Vroom, R. Gurwitz, and A. van Dam. The Application Visualization System: A Computational Environment for Scientific Visualization. IEEE Computer Graphics and Applications, 9(4):30-42, [20] Visviva Software Inc. ScriptV. [21] University of Siegen. The VRML History Homepage. 8

Einführung in die Erweiterte Realität - 4. VRML - Gudrun Klinker Nov 11, 2003

Einführung in die Erweiterte Realität - 4. VRML - Gudrun Klinker Nov 11, 2003 Einführung in die Erweiterte Realität - 4. VRML - Gudrun Klinker Nov 11, 2003 Agenda 1. General information on VRML 2. Basic concepts: minimal VRML worlds 3. Combination of several objects 4. Model reusability

More information

Introduction to Virtual Environments - Spring Wernert/Arns. Lecture 4.2 Animation & Interaction

Introduction to Virtual Environments - Spring Wernert/Arns. Lecture 4.2 Animation & Interaction Introduction to Virtual Environments - Spring 2004 - Wernert/Arns Lecture 4.2 Animation & Interaction Outline 1. Animation Techniques & Concepts 2. Input & Event Concepts 3. Implementation Details 0. Resources

More information

Topics. Overview of VRML 97 VRML Today After VRML

Topics. Overview of VRML 97 VRML Today After VRML VRML Ruth Aylett Topics Overview of VRML 97 VRML Today After VRML What is VRML? VR modelling language NOT a programming language! Open standard (1997) for Internet sharing of 3D files and Virtual Worlds

More information

Introduction to X3D. Roberto Ranon HCI Lab University of Udine, Italy

Introduction to X3D. Roberto Ranon HCI Lab University of Udine, Italy Introduction to X3D Roberto Ranon ranon@dimi.uniud.it HCI Lab University of Udine, Italy http://hcilab.uniud.it Outline What is X3D? X3D basics including some new capabilities and details on the (near)

More information

On Design of 3D and Multimedia Extension of Information System Using VRML

On Design of 3D and Multimedia Extension of Information System Using VRML On Design of 3D and Multimedia Extension of Information System Using VRML Jiří Žára Daniel Černohorský Department of Computer Science & Engineering Czech Technical University Karlovo nam 13 121 35 Praha

More information

VRML++: A Language for Object-Oriented Virtual-Reality Models

VRML++: A Language for Object-Oriented Virtual-Reality Models VRML++: A Language for Object-Oriented Virtual-Reality Models Stephan Diehl FB 14 - Informatik, Universität des Saarlandes, Postfach 15 11 50, 66041 Saarbrücken, GERMANY Email: diehl@cs.uni-sb.de, WWW:

More information

SPATIOTEMPORAL INDEXING MECHANISM BASED ON SNAPSHOT-INCREMENT

SPATIOTEMPORAL INDEXING MECHANISM BASED ON SNAPSHOT-INCREMENT SPATIOTEMPORAL INDEXING MECHANISM BASED ON SNAPSHOT-INCREMENT L. Lin a, Y. Z. Cai a, b, Z. Xu a a School of Resource and Environment Science,Wuhan university, Wuhan China 430079, lilin@telecarto.com b

More information

V. THREE-DIMENSIONAL REAL-TIME COMPUTER GRAPHICS

V. THREE-DIMENSIONAL REAL-TIME COMPUTER GRAPHICS V. THREE-DIMENSIONAL REAL-TIME COMPUTER GRAPHICS A. INTRODUCTION This chapter describes the principal characteristics needed for the creation of object-oriented graphics viewers for visualizing a large-scale

More information

M. Andrea Rodríguez-Tastets. I Semester 2008

M. Andrea Rodríguez-Tastets. I Semester 2008 M. -Tastets Universidad de Concepción,Chile andrea@udec.cl I Semester 2008 Outline refers to data with a location on the Earth s surface. Examples Census data Administrative boundaries of a country, state

More information

A Content Based Image Retrieval System Based on Color Features

A Content Based Image Retrieval System Based on Color Features A Content Based Image Retrieval System Based on Features Irena Valova, University of Rousse Angel Kanchev, Department of Computer Systems and Technologies, Rousse, Bulgaria, Irena@ecs.ru.acad.bg Boris

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe CHAPTER 26 Enhanced Data Models: Introduction to Active, Temporal, Spatial, Multimedia, and Deductive Databases 26.1 Active Database Concepts and Triggers Database systems implement rules that specify

More information

Spatial Data Structures

Spatial Data Structures 15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie

More information

Introduction to Trajectory Clustering. By YONGLI ZHANG

Introduction to Trajectory Clustering. By YONGLI ZHANG Introduction to Trajectory Clustering By YONGLI ZHANG Outline 1. Problem Definition 2. Clustering Methods for Trajectory data 3. Model-based Trajectory Clustering 4. Applications 5. Conclusions 1 Problem

More information

VRML FOR URBAN VISUALIZATION

VRML FOR URBAN VISUALIZATION Proceedings of the 1999 Winter Simulation Conference P. A. Farrington, H. B. Nembhard, D. T. Sturrock, and G. W. Evans, eds. VRML FOR URBAN VISUALIZATION Lee A. Belfore, II Department of Electrical and

More information

VRML for Visualization

VRML for Visualization VRML for Visualization James Earl Johnson ABSTRACT: VRML, the Virtual Reality Modeling Language, is heading for a browser near you. VRML promises a write once, view anywhere capability for visualizing

More information

Spatial Data Structures

Spatial Data Structures 15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) March 28, 2002 [Angel 8.9] Frank Pfenning Carnegie

More information

Introduction to Temporal Database Research. Outline

Introduction to Temporal Database Research. Outline Introduction to Temporal Database Research by Cyrus Shahabi from Christian S. Jensen s Chapter 1 1 Outline Introduction & definition Modeling Querying Database design Logical design Conceptual design DBMS

More information

informatory frame VRML browser window Java applet

informatory frame VRML browser window Java applet Remote VRML browser control using EAI Milan Kubec, Jiri Zara @fel.cvut.cz Departament of Computer Science and Engeneering Czech Technical University Prague / Czech Republic Abstract The paper

More information

A CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION

A CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION CO-182 A CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION AI T.(1), ZHANG W.(2) (1) Wuhan University, WUHAN CITY, CHINA ; (2) Zhongnan University of Economics and Law, WUHAN CITY,

More information

DRAPED AERIAL PHOTOS AND 3D GIS ON THE INTERNET

DRAPED AERIAL PHOTOS AND 3D GIS ON THE INTERNET DRAPED AERIAL PHOTOS AND 3D GIS ON THE INTERNET Jun Seok Lee *, In-Joon Kang *, Yong-Ku Chang *, Soon-Heon Hong ** * Dept. of Civil Engineering of Pusan National University, Pusan 609735, KOREA jaslee@hyowon.pusan.ac.kr

More information

A Data Flow Approach to Color Gamut Visualization

A Data Flow Approach to Color Gamut Visualization A Data Flow Approach to Color Gamut Visualization Gary W. Meyer and Chad A. Robertson Department of Computer and Information Science University of Oregon, Eugene, Oregon 97403 Abstract Software has been

More information

Spatial Data Structures

Spatial Data Structures Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) [Angel 9.10] Outline Ray tracing review what rays matter? Ray tracing speedup faster

More information

ANALYZING AND COMPARING TRAFFIC NETWORK CONDITIONS WITH A QUALITY TOOL BASED ON FLOATING CAR AND STATIONARY DATA

ANALYZING AND COMPARING TRAFFIC NETWORK CONDITIONS WITH A QUALITY TOOL BASED ON FLOATING CAR AND STATIONARY DATA 15th World Congress on Intelligent Transport Systems ITS Connections: Saving Time, Saving Lives New York, November 16-20, 2008 ANALYZING AND COMPARING TRAFFIC NETWORK CONDITIONS WITH A QUALITY TOOL BASED

More information

Data Flow Languages for Immersive Virtual Environments

Data Flow Languages for Immersive Virtual Environments Chapter 1 Data Flow Languages for Immersive Virtual Environments Anthony Steed Department of Computer Science University College London > «Abstract Current immersive virtual environment (WE) systems use

More information

Graph-based Guidance in Huge Point Clouds

Graph-based Guidance in Huge Point Clouds Graph-based Guidance in Huge Point Clouds Claus SCHEIBLAUER / Michael WIMMER Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria Abstract: In recent years the use of

More information

Foundations of 3D Graphics Programming

Foundations of 3D Graphics Programming Foundations of 3D Graphics Programming Jim X. Chen Edward J. Wegman Foundations of 3D Graphics Programming Using JOGL and Java3D With 139 Figures Jim X. Chen, PhD Computer Science Department George Mason

More information

Experiences with Open Inventor. 1 Introduction. 2 HEP Visualization in an Object-Oriented Environment

Experiences with Open Inventor. 1 Introduction. 2 HEP Visualization in an Object-Oriented Environment Experiences with Open Inventor Joseph Boudreau University of Pittsburgh, Pittsburgh, PA, 15260 USA Abstract The Open Inventor(OI) library is a toolkit for constructing, rendering and interacting with a

More information

Abstractions in Multimedia Authoring: The MAVA Approach

Abstractions in Multimedia Authoring: The MAVA Approach Abstractions in Multimedia Authoring: The MAVA Approach Jürgen Hauser, Jing Tian Institute of Parallel and Distributed High-Performance Systems (IPVR) University of Stuttgart, Breitwiesenstr. 20-22, D

More information

Extending VRML by One-Way Equational Constraints

Extending VRML by One-Way Equational Constraints Extending VRML by One-Way Equational Constraints Stephan Diehl Abstract In this paper we discuss how VRML can be extended by one-way equational constraints. We give the syntax of our extension, discuss

More information

High Dynamic Range Image Texture Mapping based on VRML

High Dynamic Range Image Texture Mapping based on VRML High Dynamic Range Image Texture Mapping based on VRML Sung-Ye Kim and Byoung-Tae Choi 3D Graphics Research Team, Virtual Reality Research and Development Department, Computer Software Research Laboratory,

More information

Shadow Maps and Projective Texturing In X3D

Shadow Maps and Projective Texturing In X3D Shadow Maps and Projective Texturing In X3D michalis.kambi@gmail.com Institute of Computer Science University of Wrocław, Poland Web3D 2010 Outline 1 Motivation and Previous Work Motivation Previous Work

More information

City, University of London Institutional Repository

City, University of London Institutional Repository City Research Online City, University of London Institutional Repository Citation: Andrienko, N., Andrienko, G., Fuchs, G., Rinzivillo, S. & Betz, H-D. (2015). Real Time Detection and Tracking of Spatial

More information

Scene Management. Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development

Scene Management. Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development Chap. 5 Scene Management Overview Scene Management vs Rendering This chapter is about rendering

More information

Construction of Complex City Landscape with the Support of CAD Model

Construction of Complex City Landscape with the Support of CAD Model Construction of Complex City Landscape with the Support of CAD Model MinSun 1 JunChen 2 AinaiMa 1 1.Institute of RS & GIS, Peking University, Beijing, China, 100871 2.National Geomatics Center of China,

More information

Mobility Data Management and Exploration: Theory and Practice

Mobility Data Management and Exploration: Theory and Practice Mobility Data Management and Exploration: Theory and Practice Chapter 4 -Mobility data management at the physical level Nikos Pelekis & Yannis Theodoridis InfoLab, University of Piraeus, Greece infolab.cs.unipi.gr

More information

Flight Systems are Cyber-Physical Systems

Flight Systems are Cyber-Physical Systems Flight Systems are Cyber-Physical Systems Dr. Christopher Landauer Software Systems Analysis Department The Aerospace Corporation Computer Science Division / Software Engineering Subdivision 08 November

More information

Spatial-Temporal Data Management for a 3D Graphical Information System

Spatial-Temporal Data Management for a 3D Graphical Information System Spatial-Temporal Data Management for a 3D Graphical Information System Minoru Maruyama I, Teruhiko Teraoka 1, Takashi Tamada I, and Shogo Nishida 2 Central Research Laboratory, Mitsubishi Electric Corporation

More information

A DBMS-BASED 3D TOPOLOGY MODEL FOR LASER RADAR SIMULATION

A DBMS-BASED 3D TOPOLOGY MODEL FOR LASER RADAR SIMULATION A DBMS-BASED 3D TOPOLOGY MODEL FOR LASER RADAR SIMULATION C. Jun a, * G. Kim a a Dept. of Geoinformatics, University of Seoul, Seoul, Korea - (cmjun, nani0809)@uos.ac.kr Commission VII KEY WORDS: Modelling,

More information

S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T

S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T Copyright 2018 Sung-eui Yoon, KAIST freely available on the internet http://sglab.kaist.ac.kr/~sungeui/render

More information

Keywords: 3D-GIS, R-Tree, Progressive Data Transfer.

Keywords: 3D-GIS, R-Tree, Progressive Data Transfer. 3D Cadastres 3D Data Model Visualisation 3D-GIS IN NETWORKING ENVIRONMENTS VOLKER COORS Fraunhofer Institute for Computer Graphics Germany ABSTRACT In this paper, we present a data model for 3D geometry

More information

3D GAMING AND CARTOGRAPHY - DESIGN CONSIDERATIONS FOR GAME-BASED GENERATION OF VIRTUAL TERRAIN ENVIRONMENTS

3D GAMING AND CARTOGRAPHY - DESIGN CONSIDERATIONS FOR GAME-BASED GENERATION OF VIRTUAL TERRAIN ENVIRONMENTS 3D GAMING AND CARTOGRAPHY - DESIGN CONSIDERATIONS FOR GAME-BASED GENERATION OF VIRTUAL TERRAIN ENVIRONMENTS Abstract Oleggini L. oleggini@karto.baug.ethz.ch Nova S. nova@karto.baug.ethz.ch Hurni L. hurni@karto.baug.ethz.ch

More information

Spatial Data Structures and Speed-Up Techniques. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology

Spatial Data Structures and Speed-Up Techniques. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Spatial Data Structures and Speed-Up Techniques Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Spatial data structures What is it? Data structure that organizes

More information

INTERACTIVE ENVIRONMENT FOR INTUITIVE UNDERSTANDING OF 4D DATA. M. Murata and S. Hashimoto Humanoid Robotics Institute, Waseda University, Japan

INTERACTIVE ENVIRONMENT FOR INTUITIVE UNDERSTANDING OF 4D DATA. M. Murata and S. Hashimoto Humanoid Robotics Institute, Waseda University, Japan 1 INTRODUCTION INTERACTIVE ENVIRONMENT FOR INTUITIVE UNDERSTANDING OF 4D DATA M. Murata and S. Hashimoto Humanoid Robotics Institute, Waseda University, Japan Abstract: We present a new virtual reality

More information

Spatial Data Structures

Spatial Data Structures CSCI 420 Computer Graphics Lecture 17 Spatial Data Structures Jernej Barbic University of Southern California Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees [Angel Ch. 8] 1 Ray Tracing Acceleration

More information

Indexing by Shape of Image Databases Based on Extended Grid Files

Indexing by Shape of Image Databases Based on Extended Grid Files Indexing by Shape of Image Databases Based on Extended Grid Files Carlo Combi, Gian Luca Foresti, Massimo Franceschet, Angelo Montanari Department of Mathematics and ComputerScience, University of Udine

More information

Class #2. Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures

Class #2. Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures Class #2 Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures Role of a Data Model Levels of Data Model Abstraction GIS as Digital

More information

Reference Requirements for Records and Documents Management

Reference Requirements for Records and Documents Management Reference Requirements for Records and Documents Management Ricardo Jorge Seno Martins ricardosenomartins@gmail.com Instituto Superior Técnico, Lisboa, Portugal May 2015 Abstract When information systems

More information

Zornitza Yovcheva Corné van Elzakker Barend Köbben. 3 rd Workshop on Usability of GI Ordnance Survey

Zornitza Yovcheva Corné van Elzakker Barend Köbben. 3 rd Workshop on Usability of GI Ordnance Survey Zornitza Yovcheva Corné van Elzakker Barend Köbben 3 rd Workshop on Usability of GI Ordnance Survey 10.11.2010 Groupware: E mail for asynchronous group work Domain expert user Domain expert user The map:

More information

Generating Traffic Data

Generating Traffic Data Generating Traffic Data Thomas Brinkhoff Institute for Applied Photogrammetry and Geoinformatics FH Oldenburg/Ostfriesland/Wilhelmshaven (University of Applied Sciences) Ofener Str. 16/19, D-26121 Oldenburg,

More information

UI Elements. If you are not working in 2D mode, you need to change the texture type to Sprite (2D and UI)

UI Elements. If you are not working in 2D mode, you need to change the texture type to Sprite (2D and UI) UI Elements 1 2D Sprites If you are not working in 2D mode, you need to change the texture type to Sprite (2D and UI) Change Sprite Mode based on how many images are contained in your texture If you are

More information

Creating Interactive Procedures and Training Courses

Creating Interactive Procedures and Training Courses Creating Interactive s and Training Courses 2017 ParallelGraphics CONTENTS INTRODUCTION... 1 1 PROCESS LAYOUT AND BASIC OPERATIONS... 1 1.1 General Data Flow Diagram... 2 1.2 Preparing Input Data for RapidAuthor

More information

Interactive Simulation and Visualization of Realistic Flooding Scenarios. Challenge the future

Interactive Simulation and Visualization of Realistic Flooding Scenarios. Challenge the future Interactive Simulation and Visualization of Realistic Flooding Scenarios 1 Overview Background Project Goals Large-Scale Point Cloud Rendering Interactive and Adaptive Flooding Simulation Geo-Information

More information

ENHANCING THE CONTROL AND PERFORMANCE OF PARTICLE SYSTEMS THROUGH THE USE OF LOCAL ENVIRONMENTS. Abstract

ENHANCING THE CONTROL AND PERFORMANCE OF PARTICLE SYSTEMS THROUGH THE USE OF LOCAL ENVIRONMENTS. Abstract ENHANCING THE CONTROL AND PERFORMANCE OF PARTICLE SYSTEMS THROUGH THE USE OF LOCAL ENVIRONMENTS Daniel O. Kutz Richard R. Eckert State University of New York at Binghamton Binghamton, NY 13902 Abstract

More information

Modeling Historical and Future Spatio-Temporal Relationships of Moving Objects in Databases

Modeling Historical and Future Spatio-Temporal Relationships of Moving Objects in Databases Modeling Historical and Future Spatio-Temporal Relationships of Moving Objects in Databases Reasey Praing & Markus Schneider University of Florida, Department of Computer & Information Science & Engineering,

More information

Understanding Geospatial Data Models

Understanding Geospatial Data Models Understanding Geospatial Data Models 1 A geospatial data model is a formal means of representing spatially referenced information. It is a simplified view of physical entities and a conceptualization of

More information

Computer Graphics Ray Casting. Matthias Teschner

Computer Graphics Ray Casting. Matthias Teschner Computer Graphics Ray Casting Matthias Teschner Outline Context Implicit surfaces Parametric surfaces Combined objects Triangles Axis-aligned boxes Iso-surfaces in grids Summary University of Freiburg

More information

Teiid Designer User Guide 7.5.0

Teiid Designer User Guide 7.5.0 Teiid Designer User Guide 1 7.5.0 1. Introduction... 1 1.1. What is Teiid Designer?... 1 1.2. Why Use Teiid Designer?... 2 1.3. Metadata Overview... 2 1.3.1. What is Metadata... 2 1.3.2. Editing Metadata

More information

Computer Graphics Curves and Surfaces. Matthias Teschner

Computer Graphics Curves and Surfaces. Matthias Teschner Computer Graphics Curves and Surfaces Matthias Teschner Outline Introduction Polynomial curves Bézier curves Matrix notation Curve subdivision Differential curve properties Piecewise polynomial curves

More information

Geometry proxies (in 2D): a Convex Polygon

Geometry proxies (in 2D): a Convex Polygon Geometry proxies (in 2D): a Convex Polygon Intersection of half-planes each delimited by a line Stored as: Test: a collection of (oriented) lines a point is inside iff it is in each half-plane A very good

More information

Chapter 25: Spatial and Temporal Data and Mobility

Chapter 25: Spatial and Temporal Data and Mobility Chapter 25: Spatial and Temporal Data and Mobility Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Chapter 25: Spatial and Temporal Data and Mobility Temporal Data Spatial

More information

High Level Graphics Programming & VR System Architecture

High Level Graphics Programming & VR System Architecture High Level Graphics Programming & VR System Architecture Hannes Interactive Media Systems Group (IMS) Institute of Software Technology and Interactive Systems Based on material by Dieter Schmalstieg VR

More information

Language Extension and Composition with Language Workbenches

Language Extension and Composition with Language Workbenches Language Extension and Composition with Language Workbenches Eelco Visser TU Delft E.Visser@tudelft.nl Markus Voelter Independent/itemis voelter@acm.org Different Worlds Programming Tools!= Modeling Tools

More information

CPSC GLOBAL ILLUMINATION

CPSC GLOBAL ILLUMINATION CPSC 314 21 GLOBAL ILLUMINATION Textbook: 20 UGRAD.CS.UBC.CA/~CS314 Mikhail Bessmeltsev ILLUMINATION MODELS/ALGORITHMS Local illumination - Fast Ignore real physics, approximate the look Interaction of

More information

SVG GRAPHICS LANGUAGE AS A DESCRIPTION OF A 2D PATH IN ROBOT PROGRAMMING TASKS

SVG GRAPHICS LANGUAGE AS A DESCRIPTION OF A 2D PATH IN ROBOT PROGRAMMING TASKS S E L E C T E D E N G I N E E R I N G P R O B L E M S N U M B E R 5 I N S T I T U T E O F E N G I N E E R I N G P R O C E S S E S A U T O M A T I O N A N D I N T E G R A T E D M A N U F A C T U R I N G

More information

1. Interpreting the Results: Visualization 1

1. Interpreting the Results: Visualization 1 1. Interpreting the Results: Visualization 1 visual/graphical/optical representation of large sets of data: data from experiments or measurements: satellite images, tomography in medicine, microsopy,...

More information

Geometric Rectification of Remote Sensing Images

Geometric Rectification of Remote Sensing Images Geometric Rectification of Remote Sensing Images Airborne TerrestriaL Applications Sensor (ATLAS) Nine flight paths were recorded over the city of Providence. 1 True color ATLAS image (bands 4, 2, 1 in

More information

2.5 Animations. Applications. Learning & Teaching Design User Interfaces. Content Process ing. Group Communi cations. Documents.

2.5 Animations. Applications. Learning & Teaching Design User Interfaces. Content Process ing. Group Communi cations. Documents. 2.5 Animations Usage Applications Learning & Teaching Design User Interfaces Services Content Process ing Security... Documents Synchronization Group Communi cations S ystem s Databases Programming Media-Server

More information

2.5 Animations. Contents. Basics. S ystem s. Services. Usage. Computer Architectures. Learning & Teaching Design User Interfaces.

2.5 Animations. Contents. Basics. S ystem s. Services. Usage. Computer Architectures. Learning & Teaching Design User Interfaces. 2.5 Animations 2.5 Animations 2.5-1 Basics S ystem s Services Usage Applications Learning & Teaching Design User Interfaces Content Process ing Security... Documents Synchronization Group Communi cations

More information

Performance impact of dynamic parallelism on different clustering algorithms

Performance impact of dynamic parallelism on different clustering algorithms Performance impact of dynamic parallelism on different clustering algorithms Jeffrey DiMarco and Michela Taufer Computer and Information Sciences, University of Delaware E-mail: jdimarco@udel.edu, taufer@udel.edu

More information

Dissolving Models with Particle Flow and Animated Opacity Map

Dissolving Models with Particle Flow and Animated Opacity Map Dissolving Models with Particle Flow and Animated Opacity Map In this tutorial we are going to start taking a look at Particle Flow, and one of its uses in digital effects of making a model look as though

More information

3D Visualization of a Complex Cave System

3D Visualization of a Complex Cave System 3D Visualization of a Complex Cave System Bernd Hetze and Manfred Buchroithner, Dresden University of Technology, D-01062 Dresden, Germany bernd.hetze@urz.tu-dresden.de, buc@karst9.geo.tu-dresden.de ABSTRACT:

More information

Research on the key technologies and realization of virtual campus

Research on the key technologies and realization of virtual campus Journal of Physics: Conference Series PAPER OPEN ACCESS Research on the key technologies and realization of virtual campus To cite this article: Cheng Zhang 2018 J. Phys.: Conf. Ser. 1074 012141 View the

More information

Spatial Data Structures

Spatial Data Structures CSCI 480 Computer Graphics Lecture 7 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids BSP Trees [Ch. 0.] March 8, 0 Jernej Barbic University of Southern California http://www-bcf.usc.edu/~jbarbic/cs480-s/

More information

Integrating 3D-GIS and Virtual Reality Design and implementation of the Karma VI system

Integrating 3D-GIS and Virtual Reality Design and implementation of the Karma VI system Integrating 3D-GIS and Virtual Reality Design and implementation of the Karma VI system Gert van Maren 1, Rick Germs 2 & Frederik Jansen 2 1 Department of GIS Technology Faculty of Civil Engineering and

More information

Virtual Marionettes: A System and Paradigm for Real-Time 3D Animation

Virtual Marionettes: A System and Paradigm for Real-Time 3D Animation Virtual Marionettes: A System and Paradigm for Real-Time 3D Animation Adi Bar-Lev, Alfred M. Bruckstein, Gershon Elber Computer Science Department Technion, I.I.T. 32000 Haifa, Israel Abstract This paper

More information

Use Math to Solve Problems and Communicate. Level 1 Level 2 Level 3 Level 4 Level 5 Level 6

Use Math to Solve Problems and Communicate. Level 1 Level 2 Level 3 Level 4 Level 5 Level 6 Number Sense M.1.1 Connect and count number words and numerals from 0-999 to the quantities they represent. M.2.1 Connect and count number words and numerals from 0-1,000,000 to the quantities they represent.

More information

DATA MINING AND WAREHOUSING

DATA MINING AND WAREHOUSING DATA MINING AND WAREHOUSING Qno Question Answer 1 Define data warehouse? Data warehouse is a subject oriented, integrated, time-variant, and nonvolatile collection of data that supports management's decision-making

More information

Chapter 4. Chapter 4. Computer Graphics 2006/2007 Chapter 4. Introduction to 3D 1

Chapter 4. Chapter 4. Computer Graphics 2006/2007 Chapter 4. Introduction to 3D 1 Chapter 4 Chapter 4 Chapter 4. Introduction to 3D graphics 4.1 Scene traversal 4.2 Modeling transformation 4.3 Viewing transformation 4.4 Clipping 4.5 Hidden faces removal 4.6 Projection 4.7 Lighting 4.8

More information

The Construction of Virtual Archaeological Museum

The Construction of Virtual Archaeological Museum The Construction of Virtual Archaeological Museum Kensuke UEHARA, Kazuaki TANAKA, Norihiro ABE, Jiang Yu ZHENG 1) Science and System Engineering Kyushu Institute of Technology Kawazu 680-4, Iizuka, Fukuoka,

More information

MPEG-4 AUTHORING TOOL FOR THE COMPOSITION OF 3D AUDIOVISUAL SCENES

MPEG-4 AUTHORING TOOL FOR THE COMPOSITION OF 3D AUDIOVISUAL SCENES MPEG-4 AUTHORING TOOL FOR THE COMPOSITION OF 3D AUDIOVISUAL SCENES P. Daras I. Kompatsiaris T. Raptis M. G. Strintzis Informatics and Telematics Institute 1,Kyvernidou str. 546 39 Thessaloniki, GREECE

More information

move object resize object create a sphere create light source camera left view camera view animation tracks

move object resize object create a sphere create light source camera left view camera view animation tracks Computer Graphics & Animation: CS Day @ SIUC This session explores computer graphics and animation using software that will let you create, display and animate 3D Objects. Basically we will create a 3

More information

Distributed Virtual Reality Computation

Distributed Virtual Reality Computation Jeff Russell 4/15/05 Distributed Virtual Reality Computation Introduction Virtual Reality is generally understood today to mean the combination of digitally generated graphics, sound, and input. The goal

More information

Computer Graphics 1. Chapter 2 (May 19th, 2011, 2-4pm): 3D Modeling. LMU München Medieninformatik Andreas Butz Computergraphik 1 SS2011

Computer Graphics 1. Chapter 2 (May 19th, 2011, 2-4pm): 3D Modeling. LMU München Medieninformatik Andreas Butz Computergraphik 1 SS2011 Computer Graphics 1 Chapter 2 (May 19th, 2011, 2-4pm): 3D Modeling 1 The 3D rendering pipeline (our version for this class) 3D models in model coordinates 3D models in world coordinates 2D Polygons in

More information

TUML: A Method for Modelling Temporal Information Systems

TUML: A Method for Modelling Temporal Information Systems TUML: A Method for Modelling Temporal Information Systems 2 Marianthi Svinterikou 1, Babis Theodoulidis 2 1 Intrasoft, GIS Department, Adrianiou 2, 11525 Athens, Greece MSSvin@tee.gr UMIST, Department

More information

Chapter 2 Overview of the Design Methodology

Chapter 2 Overview of the Design Methodology Chapter 2 Overview of the Design Methodology This chapter presents an overview of the design methodology which is developed in this thesis, by identifying global abstraction levels at which a distributed

More information

Carrara Enhanced Remote Control (ERC)

Carrara Enhanced Remote Control (ERC) Carrara Enhanced Remote Control (ERC) The Enhanced Remote Control suite is a set of behavior modifiers and scene commands that work together to add much needed functionality and control to your animation

More information

Post Processing, Visualization, and Sample Output

Post Processing, Visualization, and Sample Output Chapter 7 Post Processing, Visualization, and Sample Output Upon successful execution of an ADCIRC run, a number of output files will be created. Specifically which files are created depends upon how the

More information

Navigating Large Hierarchical Space Using Invisible Links

Navigating Large Hierarchical Space Using Invisible Links Navigating Large Hierarchical Space Using Invisible Links Ming C. Hao, Meichun Hsu, Umesh Dayal, Adrian Krug* Software Technology Laboratory HP Laboratories Palo Alto HPL-2000-8 January, 2000 E-mail:(mhao,

More information

Topic 10: Scene Management, Particle Systems and Normal Mapping. CITS4242: Game Design and Multimedia

Topic 10: Scene Management, Particle Systems and Normal Mapping. CITS4242: Game Design and Multimedia CITS4242: Game Design and Multimedia Topic 10: Scene Management, Particle Systems and Normal Mapping Scene Management Scene management means keeping track of all objects in a scene. - In particular, keeping

More information

A data-driven framework for archiving and exploring social media data

A data-driven framework for archiving and exploring social media data A data-driven framework for archiving and exploring social media data Qunying Huang and Chen Xu Yongqi An, 20599957 Oct 18, 2016 Introduction Social media applications are widely deployed in various platforms

More information

Data Structure. IBPS SO (IT- Officer) Exam 2017

Data Structure. IBPS SO (IT- Officer) Exam 2017 Data Structure IBPS SO (IT- Officer) Exam 2017 Data Structure: In computer science, a data structure is a way of storing and organizing data in a computer s memory so that it can be used efficiently. Data

More information

Product Engineering Optimizer

Product Engineering Optimizer CATIA V5 Training Foils Product Engineering Optimizer Version 5 Release 19 January 2009 EDU_CAT_EN_PEO_FI_V5R19 1 About this course Objectives of the course Upon completion of this course, you will learn

More information

Adaptive Point Cloud Rendering

Adaptive Point Cloud Rendering 1 Adaptive Point Cloud Rendering Project Plan Final Group: May13-11 Christopher Jeffers Eric Jensen Joel Rausch Client: Siemens PLM Software Client Contact: Michael Carter Adviser: Simanta Mitra 4/29/13

More information

SPATIAL DATA MODELS Introduction to GIS Winter 2015

SPATIAL DATA MODELS Introduction to GIS Winter 2015 SPATIAL DATA MODELS Introduction to GIS Winter 2015 GIS Data Organization The basics Data can be organized in a variety of ways Spatial location, content (attributes), frequency of use Come up with a system

More information

Performance Level Descriptors. Mathematics

Performance Level Descriptors. Mathematics Performance Level Descriptors Grade 3 Well Students rarely, Understand that our number system is based on combinations of 1s, 10s, and 100s (place value, compare, order, decompose, and combine using addition)

More information

Mobile Viewers based on SVG ±geo and XFormsGI

Mobile Viewers based on SVG ±geo and XFormsGI Mobile Viewers based on SVG ±geo and XFormsGI Thomas Brinkhoff 1, Jürgen Weitkämper 2 Institut für Angewandte Photogrammetrie und Geoinformatik (IAPG) Fachhochschule Oldenburg/Ostfriesland/Wilhelmshaven

More information

Matthew Heric, Geoscientist and Kevin D. Potter, Product Manager. Autometric, Incorporated 5301 Shawnee Road Alexandria, Virginia USA

Matthew Heric, Geoscientist and Kevin D. Potter, Product Manager. Autometric, Incorporated 5301 Shawnee Road Alexandria, Virginia USA INTEGRATIONS OF STRUCTURED QUERY LANGUAGE WITH GEOGRAPHIC INFORMATION SYSTEM PROCESSING: GeoServer Matthew Heric, Geoscientist and Kevin D. Potter, Product Manager Autometric, Incorporated 5301 Shawnee

More information

Intersection Acceleration

Intersection Acceleration Advanced Computer Graphics Intersection Acceleration Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volume hierarchies uniform grids kd-trees octrees

More information

System Design for Visualizing Scientific Computations

System Design for Visualizing Scientific Computations 25 Chapter 2 System Design for Visualizing Scientific Computations In Section 1.1 we defined five broad goals for scientific visualization. Specifically, we seek visualization techniques that 1. Can be

More information

Composability Test of BOM based models using Petri Nets

Composability Test of BOM based models using Petri Nets I. Mahmood, R. Ayani, V. Vlassov and F. Moradi 7 Composability Test of BOM based models using Petri Nets Imran Mahmood 1, Rassul Ayani 1, Vladimir Vlassov 1, and Farshad Moradi 2 1 Royal Institute of Technology

More information