A Geometric Approach for Computing the Kernel of a Polyhedron

T. Sorgente, S. Biasotti, M. Spagnuolo
{"title":"A Geometric Approach for Computing the Kernel of a Polyhedron","authors":"T. Sorgente, S. Biasotti, M. Spagnuolo","doi":"10.2312/STAG.20211470","DOIUrl":null,"url":null,"abstract":"We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel for a polygon has already been largely addressed in the literature, less has been done for polyhedra. Currently, the principal implementation of the kernel estimation is based on the solution of a linear programming problem. We compare against it on several examples, showing that our method is more efficient in analysing the elements of a generic tessellation. Details on the technical implementation and discussions on pros and cons of the method are also provided.","PeriodicalId":172563,"journal":{"name":"Smart Tools and Applications in Graphics","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Smart Tools and Applications in Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/STAG.20211470","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel for a polygon has already been largely addressed in the literature, less has been done for polyhedra. Currently, the principal implementation of the kernel estimation is based on the solution of a linear programming problem. We compare against it on several examples, showing that our method is more efficient in analysing the elements of a generic tessellation. Details on the technical implementation and discussions on pros and cons of the method are also provided.
计算多面体核的几何方法
提出了一种计算一般多面体几何核的几何算法。几何核(或简称核)被定义为整个多面体可见的点的集合。虽然多边形核的计算已经在文献中得到了很大的解决,但对多面体的计算却做得很少。目前,核估计的主要实现是基于线性规划问题的求解。我们在几个例子中与它进行了比较,表明我们的方法在分析一般镶嵌的元素时更有效。本文还详细介绍了该方法的技术实现和优缺点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信