2007 6th International Asia-Pacific Symposium on Visualization最新文献

筛选
英文 中文
Particle-based volume rendering 基于粒子的体积渲染
2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329287
Naohisa Sakamoto, J. Nonaka, K. Koyamada, Satoshi Tanaka
{"title":"Particle-based volume rendering","authors":"Naohisa Sakamoto, J. Nonaka, K. Koyamada, Satoshi Tanaka","doi":"10.1109/APVIS.2007.329287","DOIUrl":"https://doi.org/10.1109/APVIS.2007.329287","url":null,"abstract":"In this paper, we introduce a novel point-based volume rendering technique based on tiny particles. In the proposed technique, a set of tiny opaque particles is generated from a given 3D scalar field based on a user-specified transfer function and the rejection method. The final image is then generated by projecting these particles onto the image plane. The particle projection does not need to be in order since the particle transparency values are not taken into account. During the projection stage, only a simple depth-order comparison is required to eliminate the occluded particles. This is the main characteristic of the proposed technique and should greatly facilitate the distributed processing. Semi-transparency is one of the main characteristics of volume rendering and, in the proposed technique the quantity of projected particles greatly influences the degree of semi-transparency. Sub-pixel processing was used in order to obtain the semi-transparent effect by controlling the projection of multiple particles onto each of the pixel areas. When using sub-pixel processing, the final pixel value is obtained by averaging the contribution from each of the projected particles. In order to verify its usefulness, we applied the proposed technique to volume rendering of multiple volume data as well as irregular volume data.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114388800","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}
引用次数: 52
Directed graphs and rectangular layouts 有向图和矩形布局
2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329276
A. Buchsbaum, E. Gansner, Suresh Venkatasubramanian
{"title":"Directed graphs and rectangular layouts","authors":"A. Buchsbaum, E. Gansner, Suresh Venkatasubramanian","doi":"10.1109/APVIS.2007.329276","DOIUrl":"https://doi.org/10.1109/APVIS.2007.329276","url":null,"abstract":"This paper deals with the problem, arising in practice, of drawing a directed graph as a collection of disjoint, isothetic rectangles, where the rectangles of the nodes of each edge must touch and where the placement of the rectangles respects the ordering of the edges. It provides characterizations for those graphs having the special type of rectangular layout known as a rectangular dual. It then characterizes the st-graphs having rectangular layouts in terms of the existence of certain planar embeddings and the non-existence of a particular subgraph.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127523628","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
Force-directed drawing method for intersecting clustered graphs 聚类相交图的力定向绘制方法
2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329280
H. Omote, Kozo Sugiyama
{"title":"Force-directed drawing method for intersecting clustered graphs","authors":"H. Omote, Kozo Sugiyama","doi":"10.1109/APVIS.2007.329280","DOIUrl":"https://doi.org/10.1109/APVIS.2007.329280","url":null,"abstract":"We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, aesthetics, model, algorithm, performance evaluation, and applications.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121074844","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
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学术官方微信