Triangulating and guarding realistic polygons

被引：0

作者：

Aloupis, Greg ^{[1
,2
]}

Bose, Prosenjit ^{[1
]}

Dujmovic, Vida ^{[1
]}

Gray, Chris ^{[3
]}

Langerman, Stefan ^{[4
]}

Speckmann, Bettina ^{[3
]}

机构：

[1] Carleton Univ, Ottawa, ON K1S 5B6, Canada

[2] Univ Libre Bruxelles, Brussels, Belgium

[3] TU Eindhoven, Eindhoven, Netherlands

[4] Univ Libre Bruxelles, Chercheur Qualifie FNRS, Brussels, Belgium

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2014年 / 47卷 / 02期

关键词：

Triangulation; Art gallery; Guarding; Polygon; LINEAR ALGORITHM; CONVEX-HULL; POINT; COMPLEXITY; GALLERIES; POLYHEDRA; OBJECTS; TIME;

D O I：

10.1016/j.comgeo.2013.03.005

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards. We show that k-guardable polygons generalize two previously identified classes of realistic input. Following this, we give two simple algorithms for triangulating k-guardable polygons. One algorithm requires the guards as input while the other does not. Both take linear time assuming that k is constant and both are easily implementable. (C) 2013 Published by Elsevier B.V.

引用

页码：296 / 306

页数：11

共 50 条

[1] Algorithms for triangulating simple polygons
Lamot, M
Zalik, B
ITI 2000: PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2000, : 429 - 436
[2] TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
BERN, M
DOBKIN, D
EPPSTEIN, D
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (1-2) : 171 - 192
[3] On triangulating three-dimensional polygons
Barequet, G
Dickerson, M
Eppstein, D
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 10 (03): : 155 - 170
[4] TRIANGULATING SIMPLE POLYGONS AND EQUIVALENT PROBLEMS
FOURNIER, A
MONTUNO, DY
ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (02): : 153 - 174
[5] Altitude terrain guarding and guarding uni-monotone polygons
Daescu, Ovidiu
Friedrichs, Stephan
Malik, Hemant
Polishchuk, Valentin
Schmidt, Christiane
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 84 : 22 - 35
[6] A NEW LINEAR ALGORITHM FOR TRIANGULATING MONOTONE POLYGONS
TOUSSAINT, GT
PATTERN RECOGNITION LETTERS, 1984, 2 (03) : 155 - 158
[7] Approximate Guarding of Monotone and Rectilinear Polygons
Krohn, Erik A.
Nilsson, Bengt J.
ALGORITHMICA, 2013, 66 (03) : 564 - 594
[8] Generalized guarding and partitioning for rectilinear polygons
Comput Geom Theory Appl, 1 (21):
[9] Inapproximability results for guarding polygons and terrains
Eidenbenz, S
Stamm, C
Widmayer, P
ALGORITHMICA, 2001, 31 (01) : 79 - 113
[10] APPROXIMATION ALGORITHMS FOR GUARDING HOLEY POLYGONS
Moghaddam, M. H.
Divdel, H.
Alipour, G.
JOURNAL OF FUNDAMENTAL AND APPLIED SCIENCES, 2016, 8 : 1063 - 1068

← 1 2 3 4 5 →