Proceedings of the 27th annual conference on Computer graphics and interactive techniques最新文献_第3页

Dynamically reparameterized light fields 动态重参数化光场

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344929

Aaron Isaksen, L. McMillan, S. Gortler

引用次数: 598

The EMOTE model for effort and shape EMOTE模型的努力和形状

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.352172

D. Chi, Mónica Costa, Liwei Zhao, N. Badler

引用次数: 476

Image-based visual hulls 基于图像的视觉船体

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344951

W. Matusik, Chris Buehler, R. Raskar, S. Gortler, L. McMillan

引用次数: 1067

Image inpainting 图像修复

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344972

M. Bertalmío, G. Sapiro, V. Caselles, C. Ballester

{"title":"Image inpainting","authors":"M. Bertalmío, G. Sapiro, V. Caselles, C. Ballester","doi":"10.1145/344779.344972","DOIUrl":"https://doi.org/10.1145/344779.344972","url":null,"abstract":"Inpainting, the technique of modifying an image in an undetectable form, is as ancient as art itself. The goals and applications of inpainting are numerous, from the restoration of damaged paintings and photographs to the removal/replacement of selected objects. In this paper, we introduce a novel algorithm for digital inpainting of still images that attempts to replicate the basic techniques used by professional restorators. After the user selects the regions to be restored, the algorithm automatically fills-in these regions with information surrounding them. The fill-in is done in such a way that isophote lines arriving at the regions' boundaries are completed inside. In contrast with previous approaches, the technique here introduced does not require the user to specify where the novel information comes from. This is automatically done (and in a fast way), thereby allowing to simultaneously fill-in numerous regions containing completely different structures and surrounding backgrounds. In addition, no limitations are imposed on the topology of the region to be inpainted. Applications of this technique include the restoration of old photographs and damaged film; removal of superimposed text like dates, subtitles, or publicity; and the removal of entire objects from the image like microphones or wires in special effects.","PeriodicalId":269415,"journal":{"name":"Proceedings of the 27th annual conference on Computer graphics and interactive techniques","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127888768","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}

引用次数: 3944

Out-of-core simplification of large polygonal models 大型多边形模型的核外简化

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344912

Peter Lindstrom

{"title":"Out-of-core simplification of large polygonal models","authors":"Peter Lindstrom","doi":"10.1145/344779.344912","DOIUrl":"https://doi.org/10.1145/344779.344912","url":null,"abstract":"We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme of Rossignac and Borrel [13] by using error quadric information for the placement of each cluster's representative vertex, which better preserves fine details and results in a low mean geometric error. The use of quadrics instead of the vertex grading approach in [13] has the additional benefits of requiring less disk space and only a single pass over the model rather than two. The resulting linear time algorithm allows simplification of datasets of arbitrary complexity. In order to handle degenerate quadrics associated with (near) flat regions and regions with zero Gaussian curvature, we present a robust method for solving the corresponding underconstrained least-squares problem. The algorithm is able to detect these degeneracies and handle them gracefully. Key features of the simplification method include a bounded Hausdorff error, low mean geometric error, high simplification speed (up to 100,000 triangles/second reduction), output (but not input) sensitive memory requirements, no disk space overhead, and a running time that is independent of the order in which vertices and triangles occur in the mesh.","PeriodicalId":269415,"journal":{"name":"Proceedings of the 27th annual conference on Computer graphics and interactive techniques","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128142670","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}

引用次数: 388

Timewarp rigid body simulation 时间扭曲刚体模拟

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344866

B. Mirtich

{"title":"Timewarp rigid body simulation","authors":"B. Mirtich","doi":"10.1145/344779.344866","DOIUrl":"https://doi.org/10.1145/344779.344866","url":null,"abstract":"The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies. The problem is unnecessary synchronization implicit in these methods. Jefferson's timewarp algorithm [22] is a technique for alleviating this problem in parallel discrete event simulation. Rigid body dynamics, though a continuous process, exhibits many aspects of a discrete one. With modification, the timewarp algorithm can be used in a uniprocessor rigid body simulator to give substantial performance improvements for simulations with large numbers of bodies. This paper describes the limitations of the traditional high-level simulation algorithms, introduces Jefferson's algorithm, and extends and optimizes it for the rigid body case. It addresses issues particular to rigid body simulation, such as collision detection and contact group management, and describes how to incorporate these into the timewarp framework. Quantitative experimental results indicate that the timewarp algorithm offers significant performance improvements over traditional high-level rigid body simulation algorithms, when applied to systems with hundreds of bodies. It also helps pave the way to parallel implementations, as the paper discusses.","PeriodicalId":269415,"journal":{"name":"Proceedings of the 27th annual conference on Computer graphics and interactive techniques","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115358307","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}

引用次数: 122

Computer-generated pen-and-ink illustration of trees 电脑生成的钢笔和墨水的树木插图

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344792

O. Deussen, T. Strothotte

引用次数: 159

A simple, efficient method for realistic animation of clouds 一个简单，有效的方法，逼真的动画的云

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344795

Y. Dobashi, K. Kaneda, H. Yamashita, T. Okita, T. Nishita

引用次数: 296

Animating explosions 动画爆炸

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344801

Gary D. Yngve, J. F. O'Brien, J. Hodgins

引用次数: 183

Example-based hinting of true type fonts 真实字体的基于示例的提示

Proceedings of the 27th annual conference on Computer graphics and interactive techniques Pub Date : 2000-07-01 DOI: 10.1145/344779.344969

Douglas E. Zongker, G. Wade, D. Salesin

{"title":"Example-based hinting of true type fonts","authors":"Douglas E. Zongker, G. Wade, D. Salesin","doi":"10.1145/344779.344969","DOIUrl":"https://doi.org/10.1145/344779.344969","url":null,"abstract":"Hinting in TrueType is a time-consuming manual process in which a typographer creates a sequence of instructions for better fitting the characters of a font to a grid of pixels. In this paper, we propose a new method for automatically hinting TrueType fonts by transferring hints of one font to another. Given a hinted source font and a target font without hints, our method matches the outlines of corresponding glyphs in each font, and then translates all of the individual hints for each glyph from the source to the target font. It also translates the control value table (CVT) entries, which are used to unify feature sizes across a font. The resulting hinted font already provides a great improvement over the unhinted version. More importantly, the translated hints, which preserve the sound, hand-designed hinting structure of the original font, provide a very good starting point for a professional typographer to complete and fine-tune, saving time and increasing productivity. We demonstrate our approach with examples of automatically hinted fonts at typical display sizes and screen resolutions. We also provide estimates of the time saved by a professional typographer in hinting new fonts using this semi-automatic approach.","PeriodicalId":269415,"journal":{"name":"Proceedings of the 27th annual conference on Computer graphics and interactive techniques","volume":"468 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127415620","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}

引用次数: 15