发布求助
文献互助 智能选刊 最新文献

Proceedings. Computer Graphics International (Cat. No.98EX149)最新文献

筛选
英文 中文
Volume modelling: representations and advanced operations 体建模:表示和高级操作
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694244
V. Savchenko, A. Pasko, A. Sourin, T. Kunii
{"title":"Volume modelling: representations and advanced operations","authors":"V. Savchenko, A. Pasko, A. Sourin, T. Kunii","doi":"10.1109/CGI.1998.694244","DOIUrl":"https://doi.org/10.1109/CGI.1998.694244","url":null,"abstract":"We present our approach to volume modelling which combines volume representations by voxel data and by continuous real functions. We discuss the main differences between direct volume visualization and modelling with voxel data, questions of conversion between two representations including volume reconstruction from contour data. We illustrate the approach by several advanced operations on a volumetric object: set-theoretic operations, sweeping, hypertexturing, feature-based sculpting, splitting, spatial and temporal transformations.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"45 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":"125453946","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}
引用次数: 19
Real time simulation and visualization of NC milling processes for inhomogeneous materials on low-end graphics hardware 基于低端图形硬件的非均匀材料数控铣削过程实时仿真与可视化
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694284
A. Konig, E. Groller
{"title":"Real time simulation and visualization of NC milling processes for inhomogeneous materials on low-end graphics hardware","authors":"A. Konig, E. Groller","doi":"10.1109/CGI.1998.694284","DOIUrl":"https://doi.org/10.1109/CGI.1998.694284","url":null,"abstract":"Simulation and visualization of NC milling processes has become an important step in computer aided manufacturing. The usage of stock materials with specific locally varying properties (such as density, accuracy, color, etc.) is becoming more important with new technologies emerging in the material industry. The authors' approach, using volumetric representation, has been adapted to these needs and copes with inhomogeneous material properties. Taking color as one possible material property, their approach enables the visualization of milled wood or compound materials. Furthermore, their approach has been developed with the usage of low-end graphics hardware in mind. The algorithms have been optimized to ensure interactive update rates even on standard personal computers without hardware graphics acceleration.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"167 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":"115316192","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}
引用次数: 18
Hierarchical meshes for volume data 体数据的分层网格
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694336
R. Grosso, G. Greiner
{"title":"Hierarchical meshes for volume data","authors":"R. Grosso, G. Greiner","doi":"10.1109/CGI.1998.694336","DOIUrl":"https://doi.org/10.1109/CGI.1998.694336","url":null,"abstract":"An algorithm for adaptive refinement of 3D meshes is presented. This algorithm can be applied for the generation of mesh hierarchies used for efficient volume visualization algorithms, e.g. iso-surface extraction or direct volume rendering, as well as for multilevel finite element computations. The aim was to construct an algorithm which generates as few congruence classes as possible. The main idea is to work with consistent partitions of the domain into tetrahedra and octahedra. The refinement consists of regular refinement rules which produce per element type one congruence class. In the case of local mesh refinement, for generating consistent subdivisions a temporary (virtual) closure is done based on suitable irregular refinement rules.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"116 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":"116725613","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}
引用次数: 28
A new type of free-form curve given by an integral form 一种由积分形式给出的新型自由曲线
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694331
K. Miura, Teruhisa Nakaseko, T. Ikedo
{"title":"A new type of free-form curve given by an integral form","authors":"K. Miura, Teruhisa Nakaseko, T. Ikedo","doi":"10.1109/CGI.1998.694331","DOIUrl":"https://doi.org/10.1109/CGI.1998.694331","url":null,"abstract":"The paper proposes a new type of free-form curve for fairness. A unit quaternion curve is used to specify the tangent of the curve in order to more directly manipulate its curvature and variation of curvature than is possible for the traditional parametric representations like Bezier and NURBS curves. Since the new curve is represented by can integral form of a unit quaternion curve, it is named unit quaternion integral curve or QI curve for brevity. It is a generalization and an extension of the clothoid into three dimensional space and the norm of its tangent is always equal to 1. Its curvature and variation of curvature are given by rather simple expressions.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"12 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":"116025877","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}
引用次数: 4
Polyhedral approximation and first order segmentation of unstructured point sets 非结构化点集的多面体逼近与一阶分割
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694297
Frank Isselhard, G. Brunnett, Thomas Schreiber
{"title":"Polyhedral approximation and first order segmentation of unstructured point sets","authors":"Frank Isselhard, G. Brunnett, Thomas Schreiber","doi":"10.1109/CGI.1998.694297","DOIUrl":"https://doi.org/10.1109/CGI.1998.694297","url":null,"abstract":"The paper is concerned with the first two steps in a surface reconstruction process. Given a set of 3D points sampled from a physical model the first problem is that of creating a polyhedral approximation of the model. For that the authors introduce an algorithm which extends Boissonnat's (1984) work. It allows the reconstruction of objects with arbitrary genus and proposes an automatic termination procedure. The next step in the process concerns the segmentation of the data points into regions for which each may be fitted by a single surface. They summarize some experiences with a region growing technique based on angle between normals criteria. Using just first order derivative estimations it is shown that the method is able to classify segments into predefined second order surface classes.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"3 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":"129606766","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}
引用次数: 6
Rational quadratic Bezier triangles on quadrics 二次曲面上的有理二次贝塞尔三角形
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694247
G. Albrecht
{"title":"Rational quadratic Bezier triangles on quadrics","authors":"G. Albrecht","doi":"10.1109/CGI.1998.694247","DOIUrl":"https://doi.org/10.1109/CGI.1998.694247","url":null,"abstract":"First, different ways of solving the problem, if a given rational triangular Bezier patch of degree 2 lies on a quadric surface, are presented. Although these approaches are theoretically equivalent, their difference from the practical point of view is illustrated by analysing and comparing the numerical condition of the respective problems. Second, given a rational triangular Bezier patch of degree 2 in standard form with five fixed control points, geometrical conditions on the locus of the sixth control point are derived and the remaining inner weights are determined. The locus of this remaining control point results to be part of a quadric surface. The obtained results are illustrated for a representative example.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"37 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":"129671897","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}
引用次数: 6
An architecture of a universal DBMS for graphics applications 图形应用的通用DBMS体系结构
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694287
A. Collison, H. Bieri
{"title":"An architecture of a universal DBMS for graphics applications","authors":"A. Collison, H. Bieri","doi":"10.1109/CGI.1998.694287","DOIUrl":"https://doi.org/10.1109/CGI.1998.694287","url":null,"abstract":"This paper presents a new architecture of a database management system intended to be used together with existing graphics software. In the first place, a system with this architecture shall be capable of coping with the large variety of data representations typically found in the graphics domain. Data is stored in its original form, without prior conversions, thus conserving the maximum information content. A special typing model separating semantics from implementation ensures type safeness and at the same time provides the flexibility and extensibility needed to cope with multiple data representations. Secondly, software components enable seamless integration of existing graphics operations offered by various software packages. The components together with a composition mechanism act as the data manipulation language of the architecture. The architecture presented has been implemented in a prototype system called GSCOPE.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"3 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":"126081519","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}
引用次数: 1
Towards an understanding of surfaces through polygonization 通过多边形化来理解曲面
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694295
W. Seibold, G. Wyvill
{"title":"Towards an understanding of surfaces through polygonization","authors":"W. Seibold, G. Wyvill","doi":"10.1109/CGI.1998.694295","DOIUrl":"https://doi.org/10.1109/CGI.1998.694295","url":null,"abstract":"We identify some of the major problems in polygonizing parametric surfaces. We are interested in associating an error with a polygonization which tells us how well we have done, rather than judging a surface by its looks alone. We introduce an error measurement which is more intuitive and helps to understand the surface.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"144 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":"128894822","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}
引用次数: 10
Hierarchical visibility culling with occlusion trees 分层可见度剔除遮挡树
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694268
Jiří Bittner, V. Havran, P. Slavík
{"title":"Hierarchical visibility culling with occlusion trees","authors":"Jiří Bittner, V. Havran, P. Slavík","doi":"10.1109/CGI.1998.694268","DOIUrl":"https://doi.org/10.1109/CGI.1998.694268","url":null,"abstract":"In the scope of rendering complex models with high depth complexity, it is of great importance to design output-sensitive algorithms, i.e., algorithms with the time complexity proportional to the number of visible graphic primitives in the resulting image. In this paper an algorithm allowing efficient culling of the invisible portion of the rendered model is presented. Our approach uses a spatial hierarchy to represent the topology of the model. For a current viewpoint a set of polygonal occluders is determined that are used to build the occlusion tree. In the occlusion tree occlusion volumes of the selected occluders are merged. Visibility from the viewpoint is determined by processing the spatial hierarchy and classifying the visibility of its regions. In this process the occlusion tree is used to determine the viewpoint-to-region visibility efficiently. The algorithm is well-suited for complex models where large occluders are present.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"13 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":"122323332","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}
引用次数: 110
An anti-aliasing method for parallel rendering 一种并行渲染的抗混叠方法
Proceedings. Computer Graphics International (Cat. No.98EX149) Pub Date : 1998-06-22 DOI: 10.1109/CGI.1998.694270
Sam Lin, Rynson W. H. Lau, X. Lin, P. Cheung
{"title":"An anti-aliasing method for parallel rendering","authors":"Sam Lin, Rynson W. H. Lau, X. Lin, P. Cheung","doi":"10.1109/CGI.1998.694270","DOIUrl":"https://doi.org/10.1109/CGI.1998.694270","url":null,"abstract":"We describe a parallel rendering method based on the adaptive supersampling technique to produce anti-aliased images with minimal memory consumption. Unlike traditional supersampling methods, this one does not supersample every pixel, but only those edge pixels. We consider various strategies to reduce the memory consumption in order for the method to be applicable in situations where limited or fixed amount of pre-allocated memory is available. This is a very important issue, especially in parallel rendering. We have implemented our algorithm on a parallel machine based on the message passing model. Towards the end of the paper, we present some experimental results on the memory usage and the performance of the method.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"187 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":"115025511","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信