Proceedings the Eighth Pacific Conference on Computer Graphics and Applications最新文献

Optimized triangle mesh compression using prediction trees 优化三角网格压缩使用预测树

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883968

Boris Kronrod, C. Gotsman

{"title":"Optimized triangle mesh compression using prediction trees","authors":"Boris Kronrod, C. Gotsman","doi":"10.1109/PCCGA.2000.883968","DOIUrl":"https://doi.org/10.1109/PCCGA.2000.883968","url":null,"abstract":"Recently, a wealth of algorithms for the efficient coding of 3D triangle meshes have been published. All these focus on achieving the most compact code for the connectivity data. The geometric data, i.e. the vertex coordinates, are then coded in an order induced by the connectivity code, which is probably not optimal. This is a pity, as the geometric portion of the data set dominates the code. We propose a way to optimize the geometry code without sacrificing too much in the connectivity code. In our approach, we achieve approximately two bits/triangle for the connectivity before entropy coding, which is not as good as other published algorithms but certainly not significantly worse. Our approach is based on the parallelogram prediction method for mesh geometry. This method is based on the observation that two adjacent triangles in a typical mesh tend to form a shape similar to a parallelogram. If an algorithm uses a parallelogram prediction method then it should build a traversal structure of triangles covering all vertices. The vertex coordinates are then predicted as the structure is traversed. The cost of this code is then the entropy of the distribution of the vertex prediction errors. Since this entropy is hard to manipulate, the accepted practice is to measure the code's effectiveness in the approximation sense, i.e. as the sum of the lengths of the vertex prediction error vectors. The full version of this paper is available at .","PeriodicalId":342067,"journal":{"name":"Proceedings the Eighth Pacific Conference on Computer Graphics and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127273164","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}

引用次数: 12

Interactive behavioural update of large flocks 大型禽群的互动行为更新

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883977

Noel O'Hara

引用次数: 0

Low cost immersive displays: the cubicle of the future 低成本的沉浸式显示器:未来的格子间

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883960

M. Green

引用次数: 1

Mesh construction from non-uniformly distributed and noisy 3D points recovered from image sequence 从图像序列中恢复的非均匀分布和噪声的三维点进行网格构建

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883976

I. Atmosukarto, W. Leow, Zhiyong Huang, Yong Zhang, K. Sung

引用次数: 1

Visibility in the presence of occluders with curved boundaries 具有弯曲边界的遮挡物存在时的可见性

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883932

G. Baciu, Cliff Cheung, Chun-Yeh Yu

{"title":"Visibility in the presence of occluders with curved boundaries","authors":"G. Baciu, Cliff Cheung, Chun-Yeh Yu","doi":"10.1109/PCCGA.2000.883932","DOIUrl":"https://doi.org/10.1109/PCCGA.2000.883932","url":null,"abstract":"Accurate global visibility information has become essential in global illumination rendering. Combinatorial structures, such as the visibility complex, aspect graphs and the visibility skeleton, are the seeds of a new topic of research motivated by practical problems in computer graphics and global illumination rendering. This is now attracting interest from the computational geometry, combinatorics, CAD and robotics communities. The initial motivation has been to accurately represent shadow boundaries generated by occluding surfaces in the path of light from emitting surfaces (sources) to receiving surfaces (receivers). This article adds to the rich body of research in this field by presenting solutions to the problem of occluders with curved boundaries. This has profound implications in three main areas: (1) the generation, maintenance and search functions associated with the global visibility complex, (2) mesh generation, and (3) global illumination rendering. We present a new visibility complex based on the proposed visibility skeleton. The new visibility complex has been designed to handle not only polygonal elements but also surfaces with curved boundaries. We have found that, even in simple 3D scenes, the new visibility complex generates less polygons in the meshing phase and a more accurate global illumination.","PeriodicalId":342067,"journal":{"name":"Proceedings the Eighth Pacific Conference on Computer Graphics and Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132680351","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}

引用次数: 0

A new paradigm for changing topology during subdivision modeling 一种在细分建模过程中改变拓扑结构的新范例

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883941

E. Akleman, V. Srinivasan, Jianer Chen

引用次数: 31

Modelling of smoke flow taking obstacles into account 考虑障碍物的烟流模型

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883935

S. Yoshida, T. Nishita

引用次数: 8

Compression of indoor video sequences using homography-based segmentation 基于同形图分割的室内视频序列压缩

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883952

T. Park, S. Fleishman, D. Cohen-Or, Dani Lischinski

引用次数: 1

CubicalPath-dynamic potential fields for guided exploration in virtual environments 虚拟环境中用于引导探索的立方路径动态势场

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883963

Steffi Beckhaus, Felix Ritter, T. Strothotte

引用次数: 42

Acceleration of Monte Carlo path tracing in general environments 一般环境下蒙特卡罗路径跟踪的加速

Proceedings the Eighth Pacific Conference on Computer Graphics and Applications Pub Date : 2000-10-03 DOI: 10.1109/PCCGA.2000.883883

Frederic Pérez, I. Martín, X. Pueyo, F. Sillion

引用次数: 13