The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-07-01 DOI:10.1016/j.endm.2018.06.030

Elena Cabrera Revuelta, María José Chávez de Diego , Alberto Márquez Pérez

引用次数: 1

Abstract

This work focuses on the visibility of exterior of a polygon. We show a lower bound for the Fortress Problem applied to polygons P having n vertices in terms of the number of reflex vertices, the number of convex vertices and the number of pockets that are found when the convex hull is made on P. The results are related to the task of the geometric data acquisition for architectural surveys through techniques such as laser scanner.

查看原文本刊更多论文

基于反射顶点和凸顶点数量的堡垒问题。一个3D对象扫描应用程序

这项工作的重点是一个多边形的外部可见性。我们展示了堡垒问题的下界，适用于具有n个顶点的多边形P，根据反射顶点的数量，凸顶点的数量和在P上制作凸壳时发现的口袋数量。结果与通过激光扫描仪等技术获取建筑勘测几何数据的任务有关。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.