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

1999 Proceedings Computer Graphics International最新文献

筛选
英文 中文
Monotonic cubic spline interpolation 单调三次样条插值
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777953
G. Wolberg, Itzik Alfy
{"title":"Monotonic cubic spline interpolation","authors":"G. Wolberg, Itzik Alfy","doi":"10.1109/CGI.1999.777953","DOIUrl":"https://doi.org/10.1109/CGI.1999.777953","url":null,"abstract":"This paper describes the use of cubic splines for interpolating monotonic data sets. Interpolating cubic splines are popular for fitting data because they use low-order polynomials and have C/sup 2/ continuity, a property that permits them to satisfy a desirable smoothness constraint. Unfortunately, that same constraint often violates another desirable property: monotonicity. The goal of this work is to determine the smoothest possible curve that passes through its control points while simultaneously satisfying the monotonicity constraint. We first describe a set of conditions that form the basis of the monotonic cubic spline interpolation algorithm presented. The conditions are simplified and consolidated to yield a fast method for determining monotonicity. This result is applied within an energy minimization framework to yield linear and nonlinear optimization-based methods. We consider various energy measures for the optimization objective functions. Comparisons among the different techniques are given, and superior monotonic cubic spline interpolation results are presented.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"613 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123322137","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}
引用次数: 79
Islamic symmetric pattern generation based on group theory 基于群论的伊斯兰对称图案生成
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777923
H. Karam, M. Nakajima
{"title":"Islamic symmetric pattern generation based on group theory","authors":"H. Karam, M. Nakajima","doi":"10.1109/CGI.1999.777923","DOIUrl":"https://doi.org/10.1109/CGI.1999.777923","url":null,"abstract":"The art of Islamic symmetrical patterns (ISP) has proven to be an elegant method for the study of symmetry. These patterns offer a rich source for exploitation by artists and are also of interest to mathematicians, crystallographers, architects, archaeologists and others. This paper discusses, studies and analyzes the evolution of the Islamic symmetrical repeat pattern design by exploring ways in which the patterns can be created algorithmically based on the properties of group theory. The use of both isometrics and fold type symmetric concepts to create and perfectly color such symmetric patterns are also discussed. Experimental results demonstrate the approach with a variety of Islamic symmetrical pattern designs.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124093890","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}
引用次数: 8
Evolutionary optimization of functionally defined shapes: case study of natural optical objects 功能定义形状的进化优化:自然光学物体的案例研究
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777894
V. Savchenko, A. Pasko
{"title":"Evolutionary optimization of functionally defined shapes: case study of natural optical objects","authors":"V. Savchenko, A. Pasko","doi":"10.1109/CGI.1999.777894","DOIUrl":"https://doi.org/10.1109/CGI.1999.777894","url":null,"abstract":"The paper focuses on an approach to modeling shapes through the use of evolutionary optimization or genetic algorithms for functionally represented geometric objects. This representation allows us to take into account non-manifold geometry and material distribution inside natural lenses. We use ray tracing as an instrument of the current shape evaluation. We describe a case study of a \"four-eyed\" fish and discuss problems of using the optimization procedure.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039324","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
Volume decimation of irregular tetrahedral grids 不规则四面体网格的体积抽取
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777958
A. V. Gelder, Vivek Verma, J. Wilhelms
{"title":"Volume decimation of irregular tetrahedral grids","authors":"A. V. Gelder, Vivek Verma, J. Wilhelms","doi":"10.1109/CGI.1999.777958","DOIUrl":"https://doi.org/10.1109/CGI.1999.777958","url":null,"abstract":"Rendering highly complex models can be time and space prohibitive, and decimation is an important tool in providing simplifications. A decimated model may replace the original entirely or provide level-of-detail approximations. We present and evaluate, quantitatively and qualitatively, methods for rapidly decimating volumetric data defined on a tetrahedral grid. Results are compared using both direct volume rendering and isosurface rendering. A mass-based and a density-based decimation error metric are compared, and the mass-based metric is found to be superior. Grid surface vertices are decimated using a geometric error metric, as well as one of the data-based error metrics. Images produced using direct volume rendering and isosurface extraction on grids that are decimated approximately 80% are nearly indistinguishable from similar images using the non-decimated grids, and even at 95% decimation, the rendered images have few artifacts. Rendering speed-up depends upon the renderer used.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123053445","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
From synthesis to analysis: fitting human animation models to image data 从合成到分析:拟合人体动画模型到图像数据
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777889
P. Fua, Ralf Plänkers, D. Thalmann
{"title":"From synthesis to analysis: fitting human animation models to image data","authors":"P. Fua, Ralf Plänkers, D. Thalmann","doi":"10.1109/CGI.1999.777889","DOIUrl":"https://doi.org/10.1109/CGI.1999.777889","url":null,"abstract":"We show that we can effectively fit complex animation models to noisy image data. Our approach is based on robust least squares adjustment and takes advantage of three complementary sources of information: stereo data, silhouette edges and 2D feature points. We take stereo to be our main information source and use the other two whenever available. In this way, complete head models-including ears and hair-can be acquired with a cheap and entirely passive sensor, such as an ordinary video camera. The motion parameters of limbs can be similarly captured. They can then be fed to existing animation software to produce synthetic sequences.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268073","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}
引用次数: 22
A shape-preserving data embedding algorithm for NURBS curves and surfaces NURBS曲线曲面的保形数据嵌入算法
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777952
Ryutarou Ohbuchi, H. Masuda, Masaki Aono
{"title":"A shape-preserving data embedding algorithm for NURBS curves and surfaces","authors":"Ryutarou Ohbuchi, H. Masuda, Masaki Aono","doi":"10.1109/CGI.1999.777952","DOIUrl":"https://doi.org/10.1109/CGI.1999.777952","url":null,"abstract":"Existing data embedding algorithms for polygonal meshes and their attributes cannot be applied to the majority of (geometric) computer aided design (CAD) applications for two major reasons. First, these CAD systems employ parametric curves and surfaces, not polygonal meshes, as their main shape-defining primitives. Second, most CAD applications do not tolerate modifications of model topology and/or geometry that are introduced by existing data embedding algorithms. We propose a new data embedding algorithm for non-uniform rational B-spline (NURBS) curves and surfaces, which employs rational linear reparameterization for embedding messages. The algorithm exactly preserves the shape, that is, the geometry and topology of its embedding targets. Furthermore, it preserves the data size of the model. We consider how these two properties, preservation of shape and preservation of data size, can be significant with regard to the use of data embedding in CAD applications. In addition to the shape- and data size-preserving data embedding algorithm for NURBS curves and surfaces, we outline additional methods for embedding data in various types of parametric curves and surfaces.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134512122","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}
引用次数: 97
Efficient occlusion culling for z-buffer systems z缓冲系统的有效遮挡剔除
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777917
Ned Greene
{"title":"Efficient occlusion culling for z-buffer systems","authors":"Ned Greene","doi":"10.1109/CGI.1999.777917","DOIUrl":"https://doi.org/10.1109/CGI.1999.777917","url":null,"abstract":"In recent years the performance of z-buffer hardware has improved rapidly, enabling inexpensive accelerators to smoothly animate relatively simple scenes such as game environments. Although faster processors, buses, and rasterization hardware will gradually enable animation of increasingly complex scenes, it will be many years before very deeply occluded scenes can be rendered in real time with traditional z-buffer hardware.One approach to accelerating the rendering of complex scenes is occlusion culling, which refers to culling of occluded geometry early in the graphics pipeline in order to reduce the workload on transformation, rasterization, and shading hardware. In this talk I will discuss the general problem of occlusion culling, review my work on applying hierarchical methods to the problem, and then describe how these methods can be applied to accelerate hardware pipelines.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123973106","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}
引用次数: 11
Virtual laboratory: an interactive software environment for computer graphics 虚拟实验室:计算机图形学的交互式软件环境
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777921
P. Federl, P. Prusinkiewicz
{"title":"Virtual laboratory: an interactive software environment for computer graphics","authors":"P. Federl, P. Prusinkiewicz","doi":"10.1109/CGI.1999.777921","DOIUrl":"https://doi.org/10.1109/CGI.1999.777921","url":null,"abstract":"Many activities in computer graphics can be regarded as experiments on virtual objects or models. In the process of experimentation the existing models are gradually improved and new model categories emerge. The Virtual Laboratory (vlab) is a software environment designed to support model development by facilitating the manipulation of models and providing mechanisms for storing and retrieving large numbers (e.g., thousands) of them. The models can be shared between users who work at different geographical locations over the Internet. In the paper we first clarify the essential concept of the Virtual Laboratory by describing its operation from a user's perspective. The modeling of plants serves as a sample application. We then present the key elements of vlab design and implementation, discuss the obtained results, and present their possible ramifications in the context of related ideas.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124954521","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}
引用次数: 44
Effective volume sampling of solid models using distance measures 使用距离测量的实体模型的有效体积采样
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777892
G. Sealy, K. Novins
{"title":"Effective volume sampling of solid models using distance measures","authors":"G. Sealy, K. Novins","doi":"10.1109/CGI.1999.777892","DOIUrl":"https://doi.org/10.1109/CGI.1999.777892","url":null,"abstract":"We present several methods for converting solid models to volume models whose boundaries are defined by an iso-surface. By storing samples of a signed distance function at each point in the volume, we show that we can reconstruct the original object with greater accuracy than methods based on an inclusion function. Our methods are fast, and require no more memory than conventional point sampling. These approaches apply to all solid objects for which ray intersection and point classification methods are defined. If a space subdivision test is available, we can quickly sample complex objects. We also present enhancements that allow for sampling of the object's original colour and texture.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128282670","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}
引用次数: 9
Time-dependent parametric surface models of the human heart 人类心脏的时变参数表面模型
1999 Proceedings Computer Graphics International Pub Date : 1999-06-07 DOI: 10.1109/CGI.1999.777937
M. Bloor, M. Wilson, Z. Knudsen, Carsten Knudsen, A. Holden
{"title":"Time-dependent parametric surface models of the human heart","authors":"M. Bloor, M. Wilson, Z. Knudsen, Carsten Knudsen, A. Holden","doi":"10.1109/CGI.1999.777937","DOIUrl":"https://doi.org/10.1109/CGI.1999.777937","url":null,"abstract":"A method is presented for generating a time-dependent parametric surface. The application on which this paper concentrates is that of producing a parametric surface description of the surfaces of the left and right ventricles of the human heart. The model is generated from two-dimensional section data obtained from MRI images of the heart. The method views surface generation as a boundary-value problem and produces surfaces as the solutions to elliptic partial differential equations. Shape parameters controlling the geometry of the surface model are introduced through the boundary conditions on the solution of the partial differential equation. These parameters are functions of time, and the surface model can be used to produce an animation of the heart during the cardiac cycle.","PeriodicalId":165593,"journal":{"name":"1999 Proceedings Computer Graphics International","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124617509","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}
引用次数: 3
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信