The visibility skeleton: a powerful and efficient multi-purpose global visibility tool

F. Durand, G. Drettakis, C. Puech
{"title":"The visibility skeleton: a powerful and efficient multi-purpose global visibility tool","authors":"F. Durand, G. Drettakis, C. Puech","doi":"10.1145/258734.258785","DOIUrl":null,"url":null,"abstract":"Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numerically unstable, and often too expensive in storage or computation. The Visibility Skeleton is a new powerful utility which can efficiently and accurately answer visibility queries for the entire scene. The Visibility Skeleton is a multi-purpose tool, which can solve numerous different problems. A simple construction algorithm is presented which only requires the use of well known computer graphics algorithmic components such as ray-casting and line/plane intersections. We provide an exhaustive catalogue of visual events which completely encode all possible visibility changes of a polygonal scene into a graph structure. The nodes of the graph are extremal stabbing lines, and the arcs are critical line swaths. Our implementation demonstrates the construction of the Visibility Skeleton for scenes of over a thousand polygons. We also show its use to compute exact visible boundaries of a vertex with respect to any polygon in the scene, the computation of global or on-the-fly discontinuity meshes by considering any scene polygon as a source, as well as the extraction of the exact blocker list between any polygon pair. The algorithm is shown to be manageable for the scenes tested, both in storage and in computation time. To address the potential complexity problems for large scenes, on-demand or lazy contruction is presented, its implementation showing encouraging first results.","PeriodicalId":128920,"journal":{"name":"Proceedings of the 24th annual conference on Computer graphics and interactive techniques","volume":"2003 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"172","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 24th annual conference on Computer graphics and interactive techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/258734.258785","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 172

Abstract

Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numerically unstable, and often too expensive in storage or computation. The Visibility Skeleton is a new powerful utility which can efficiently and accurately answer visibility queries for the entire scene. The Visibility Skeleton is a multi-purpose tool, which can solve numerous different problems. A simple construction algorithm is presented which only requires the use of well known computer graphics algorithmic components such as ray-casting and line/plane intersections. We provide an exhaustive catalogue of visual events which completely encode all possible visibility changes of a polygonal scene into a graph structure. The nodes of the graph are extremal stabbing lines, and the arcs are critical line swaths. Our implementation demonstrates the construction of the Visibility Skeleton for scenes of over a thousand polygons. We also show its use to compute exact visible boundaries of a vertex with respect to any polygon in the scene, the computation of global or on-the-fly discontinuity meshes by considering any scene polygon as a source, as well as the extraction of the exact blocker list between any polygon pair. The algorithm is shown to be manageable for the scenes tested, both in storage and in computation time. To address the potential complexity problems for large scenes, on-demand or lazy contruction is presented, its implementation showing encouraging first results.
可见性框架:一个强大而高效的多用途全局可见性工具
计算机图形学和计算机视觉中的许多问题都需要精确的全局可见性信息。以前的方法通常实现起来很复杂,在数值上也不稳定,而且在存储或计算方面往往过于昂贵。可见性框架是一个新的强大的实用程序,它可以有效和准确地回答整个场景的可见性查询。可见性框架是一个多用途的工具,它可以解决许多不同的问题。提出了一种简单的构造算法,它只需要使用众所周知的计算机图形学算法组件,如光线投射和线/面相交。我们提供了一个详尽的视觉事件目录,它将多边形场景的所有可能的可见性变化完全编码为图形结构。图的节点是极端的刺线,弧是关键的线段。我们的实现演示了超过一千个多边形场景的可见性骨架的构造。我们还展示了它的用途,以计算相对于场景中任何多边形的顶点的精确可见边界,通过考虑任何场景多边形作为源计算全局或动态不连续网格,以及提取任何多边形对之间的精确阻塞列表。结果表明,该算法在存储和计算时间上都是可管理的。为了解决大型场景的潜在复杂性问题,提出了按需或惰性构造,其实现显示出令人鼓舞的初步结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书