{"title":"Visualization of meteorological data using an interactive flight","authors":"M. König, C. Lenz, G. Domik","doi":"10.1109/CGI.1998.694292","DOIUrl":"https://doi.org/10.1109/CGI.1998.694292","url":null,"abstract":"Visualization offers useful tools for understanding large data sets. The visualization techniques in this work, realized in the program GeoVis, depict static as well as dynamic geoscientific data through glyphs, surfaces and animation. The flight over a virtual landscape (where multidimensional data are represented by abstract glyphs) proves to be useful for the quick exploration of coherencies as well as differences in the data compound.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126494109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Incremental techniques for implicit surface modeling","authors":"Eric Galin, S. Akkouche","doi":"10.1109/CGI.1998.694282","DOIUrl":"https://doi.org/10.1109/CGI.1998.694282","url":null,"abstract":"The paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. The method lends itself as an interactive modeling system as the mesh is updated locally in regions of space where changes in the potential field occurred. The authors rely on an octree decomposition of space combined with Lipschitz conditions to recursively subdivide cells until a given level of precision is reached. Timings show that the incremental algorithm dramatically speeds up the overall polygonization process for complex objects.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116629423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Geometric- and parametric-tolerance constraints in variational design of multiresolution curves and surfaces","authors":"Shigeo Takahashi","doi":"10.1109/CGI.1998.694327","DOIUrl":"https://doi.org/10.1109/CGI.1998.694327","url":null,"abstract":"The paper introduces constraints termed tolerance constraints, which specify several types of variations, in the design of smooth curves and surfaces at multiresolution levels. The mathematical model for such tolerance constraints is implemented by extending Welch and Witkin's (1992) work on linear constraints in variational shape sculpting. The tolerance constraints presented in this paper are classified into two types: geometric-tolerance and parametric-tolerance constraints. The geometric-tolerance constraints serve as constraints that allow variations in geometric size, while the parametric ones introduce variations in the parametric domain where the shape is defined. These two types are employed as not only finite-dimensional constraints, such as points and tangents, but also transfinite constraints, such as curves and areas. In order to find a smooth shape of a curve or a surface, the multiplier method is used that seeks to minimize the function subject the shape deformation, along with the penalty terms derived from the tolerance constraints. An optimal solution is then found easily because the derivatives of the penalty terms can be evaluated using vector and matrix calculations. Several design, examples are presented to show that the tolerance constraints are powerful tools for finding optimal shapes of multiresolution curves and surfaces.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114281873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An array processor architecture with parallel data cache for image rendering and compositing","authors":"Mladen Berekovic, P. Pirsch","doi":"10.1109/CGI.1998.694294","DOIUrl":"https://doi.org/10.1109/CGI.1998.694294","url":null,"abstract":"This paper proposes a new array architecture for MPEG-4 image compositing and 3D rendering. The emerging MPEG-4 standard for multimedia applications allows VRML-like script-based compositing of audio-visual scenes from multiple audio and visual objects. MPEG-4 supports both natural (video) and synthetic (3D) visual objects or a combination of both. Objects can be manipulated e.g. positioned, rotated, warped or duplicated by user interaction. A coprocessor architecture is presented, that works in parallel to an MPEG-4 video and audio-decoder and a floating-point geometry-processor. It performs computation and bandwidth intensive low-level tasks for image compositing and rasterization. The processor consists of a SIMD array of 16 identical DSPs to reach the required processing power for real-time image warping, alpha-blending, z-buffering and phong-shading. The processor has an object-oriented parallel cache architecture with 2D virtual address space (e.g. textures) that allows concurrent and conflict-free access to shared image data objects for all 16 DSPs.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131415116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast approximate quantitative visibility for complex scenes","authors":"Y. Chrysanthou, D. Cohen-Or, Dani Lischinski","doi":"10.1109/CGI.1998.694269","DOIUrl":"https://doi.org/10.1109/CGI.1998.694269","url":null,"abstract":"Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantitative visibility queries, such as: what is the average visibility between a point (a differential area element) and a finite area or volume; or what is the average visibility between two finite areas or volumes. We present a new data structure and an algorithm for rapidly evaluating such queries in complex scenes. The proposed approach utilizes a novel image-based discretization of the space of bounded rays in the scene, constructed in a preprocessing stage. This data structure makes it possible to quickly compute approximate answers to visibility queries. Because visibility queries are computed using a discretization of the space, the execution time is effectively decoupled from the number of geometric primitives in the scene. A potential hazard with the proposed approach is that it might require large amounts of memory, if the data structures are designed in a naive fashion. We discuss ways for representing the discretization in a compact manner while still allowing rapid query evaluation. Preliminary results demonstrate the effectiveness of the proposed approach.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127749181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computer visualization for the topology of integrable cases in rigid body dynamics","authors":"A. T. Fomenko","doi":"10.1109/CGI.1998.694302","DOIUrl":"https://doi.org/10.1109/CGI.1998.694302","url":null,"abstract":"In modern applied mathematics computer visualization is often extremely useful for solving concrete mechanical and physical problems. Some methods of topological modeling for visualization can be found, for example, in the book of T.L. Kunii and A.T. Fomenko (1997). Many problems of modern geometry and topology, mathematical physics and mechanics are reduced to the analysis of symmetries of corresponding differential equations. In cases when the group of symmetries is large, it is usually possible to integrate the differential equations, i.e. to find solutions of physical problems in a \"direct way\". The remarkable relation of this problem with topological bifurcation theory was recently discovered. It turns out that classification of dynamical systems which have \"the maximal symmetry group\" can be given in terms of one-dimensional and two-dimensional topological objects. Some of these results were obtained on the basis of computer visualization of the set of bifurcations appearing in integrable Hamiltonian systems. The author illustrates this theory by visual material showing the bifurcations in concrete dynamical systems from classical mechanics.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115079711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visibility as an intrinsic property of geometric models","authors":"A. Bar-Lev, G. Elber","doi":"10.1109/CGI.1998.694267","DOIUrl":"https://doi.org/10.1109/CGI.1998.694267","url":null,"abstract":"This paper presents a technique to improves the performance of algorithms that exploits visibility based analysis in computer graphics, such as ray tracing. The presented approach maintains a list of visible polygons for each and every one of the polygons in the model as well as for optionally, the light sources in the scene. A pre-processing visibility analysis stage that is view-independent is computed once per scene, creating a Visibility Data Structure (VDS) that becomes part of the model. This, before any visibility intensive computer graphics algorithm takes place. The approach presented may be combined with most acceleration methods for ray tracing such as octree or voxel based spatial subdivision. Furthermore, any algorithm that requires visibility computations can exploit the VDS, from Radiosity to NC machining. Though the presented technique is fairly intuitive, it demonstrates the usability of a visibility data structure of a scene.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114798180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visualizing 3-D geographical data with VRML","authors":"J. Shan","doi":"10.1109/CGI.1998.694257","DOIUrl":"https://doi.org/10.1109/CGI.1998.694257","url":null,"abstract":"The article discusses visualizing and interacting with 3D geographical data via VRML in the Web environment. For this purpose, the Web based desktop VR for geographical information is conceptualized. After VRML is briefly introduced, issues in modeling geographical data such as modeling geometry, topology and appearance are addressed. Sample visualization results for terrain and buildings are given, followed by discussions on the application of VRML. Cooperation within computer graphics and GIS is prospected in automatic model reconstruction and in exploring VRML application potential in visualizing geographical information.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115163523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improved triangular subdivision schemes","authors":"H. Prautzsch, G. Umlauf","doi":"10.1109/CGI.1998.694321","DOIUrl":"https://doi.org/10.1109/CGI.1998.694321","url":null,"abstract":"The authors improve the butterfly and Loop's (1987) algorithm. As a result they obtain subdivision algorithms for triangular nets which can be used to generate G/sup 1/- and G/sup 2/-surfaces, respectively.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"162 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123419474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computational metrology of the circle","authors":"J. Pegna, C. Guo","doi":"10.1109/CGI.1998.694285","DOIUrl":"https://doi.org/10.1109/CGI.1998.694285","url":null,"abstract":"Fitting a circle to a set of data points arranged in a circular pattern is a common problem in many fields of science and engineering. Specific applications in metrology include center position and circularity measurements. The fitting criteria usually depends on the application and varies with the statistical error model. Chebyshev fits, also known as minmax or least L-infinity fits, are of particular interest in metrology where they quantify the form error in addition to yielding an allegedly more objective position assessment. The paper offers further empirical evidence to support this conjecture. The Chebyshev circular fit problem can be solved using common computational geometry tools but the computational complexity of the algorithm is prohibitive for real-time applications. A substitute heuristic marching algorithm was developed and implemented. After a comprehensive state of the art review, the paper presents the marching algorithm and evaluates its convergence properties for full and partial circular data sets. A comparative study of convergence rate and accuracy is presented with respect to exhaustive computational geometry solutions and other fitting criteria.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124453480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}