Most common database management systems represent information in a simple record-based format. Semantic modeling provides richer data structuring capabilities for database applications. In particular, research in this area has articulated a number of constructs that provide mechanisms for representing structurally complex interrelations among data typically arising in commercial applications. In general terms, semantic modeling complements work on knowledge representation (in artificial intelligence) and on the new generation of database models based on the object-oriented paradigm of programming languages. This paper presents an in-depth discussion of semantic data modeling. It reviews the philosophical motivations of semantic models, including the need for high-level modeling abstractions and the reduction of semantic overloading of data type constructors. It then provides a tutorial introduction to the primary components of semantic models, which are the explicit representation of objects, attributes of and relationships among objects, type constructors for building complex types, ISA relationships, and derived schema components. Next, a survey of the prominent semantic models in the literature is presented. Further, since a broad area of research has developed around semantic modeling, a number of related topics based on these models are discussed, including data languages, graphical interfaces, theoretical investigations, and physical implementation strategies.

Recent research has demonstrated the usefulness of implicit surfaces for modeling geometric objects. The interactive design of such surfaces has not, however, received the same attention as has the design of parametric surfaces. Principally this is due to the difficulty of controlling the shape of implicit surfaces while displaying the changes quickly enough for use within an interactive design environment. This paper describes progress towards interactive control of implicit surfaces and introduces new techniques useful to the designer.

In this paper we describe a novel technique for detecting salient regions in an image. The detector is a generalization to a#ne invariance of the method introduced by Kadir and Brady [10]. The detector deems a region salient if it exhibits unpredictability in both its attributes and its spatial scale.

We present a novel approach for recognizing faces in images taken from different directions and under different illumination. The method is based on a 3D morphable face model that encodes shape and texture in terms of model parameters, and an algorithm that recovers these parameters from a single image of a face. For face identification, we use the shape and texture parameters of the model that are separated from imaging parameters, such as pose and illumination. In addition to the identity, the system provides a measure of confidence. We report experimental results for more than 4000 images from the publicly available CMU-PIE database. 1

A method is presented for representing botanical trees, given three-dimensional points and connections. Limbs are modeled as generalized cylinders whose axes are space curves that interpolate the points. A free-form surface connects branching limbs. "Blobby" techniques are used to model the tree trunk as a series of non-circular cross sections. Bark is simulated with a bump map digitized from real world bark; leaves are textures mapped onto simple surfaces.

Connected particle systems can depict many objects difficult to model in any other fashion. We present a method for animating viscous fluids by simulating the forces of such particles interacting with each other. This method allows for collision detection between the particles and obstacles, both stationary and mobile, and it allows solid objects to break and melt. An approximate method for covering the particles with an isosurface for efficient rendering is also presented.

This thesis presents a volumetric representation for the global illumination within a space based on the radiometric quantity irradiance. We call this representation the irradiance volume. Although irradiance is traditionally computed only for surfaces, its de nition can be naturally extended to all points and directions in space. The irradiance volume supports the reconstruction of believable approximations to the illumination in situations that overwhelm traditional global illumination algorithms. Atheoretical basis for the irradiance volume is discussed and the methods and issues involved with building the volume are described. The irradiance volume method is tested within several situations in which the use of traditional global illumination methods is impractical, and is shown to provide good performance.

A direct manipulation user interface presents a set of visual representations on a display and a repertoire of manipulations that can be performed on any of them. Such representations might include screen buttons, scroll bars, spreadsheet cells, or flowchart boxes. Interaction techniques of this kind were first seen in interactive graphics systems; they are now proving effective in user interfaces for applications that are not inherently graphical. While they are often easy to learn and use, these interfaces are also typically difficult to specify and program clearly. Examination of

Radial basis functions are presented as a practical solution to the problem of interpolating incomplete surfaces derived from three-dimensional (3-D) medical graphics. The specific application considered is the design of cranial implants for the repair of defects, usually holes, in the skull. Radial basis functions impose few restrictions on the geometry of the interpolation centers and are suited to problems where the interpolation centers do not form a regular grid. However, their high computational requirements have previously limited their use to problems where the number of interpolation centers is small (! 300). Recently developed fast evaluation techniques have overcome these limitations and made radial basis interpolation a practical approach for larger data sets. In this paper radial basis functions are fitted to depthmaps of the skull's surface, obtained from X-ray CT data using ray-tracing techniques. They are used to smoothly interpolate the surface of the skull across defe...

A parallel algorithm for the rasterization of polygons is presented that is particularly well suited for 3D Z-buffered graphics implementations. The algorithm represents each edge of a polygon by a linear edge function that has a value greater than zero on one side of the edge and less than zero on the opposite side. The value of the function can be interpolated with hardware similar to hardware required to interpolate color and Z pixel values. In addition, the edge function of adjacent pixels may be easily computed in parallel. The coefficients of the "Edge function " can be computed from floating point endpoints in such a way that sub-pixel precision of the endpoints can be retained in an elegant way. CR catagories and subject descriptors: 1.3.1 [Computer Graphics]: