Abstract | ||
---|---|---|
Let D be a connected region inside a simple polygon, P. We define the angle hull,
AH\mathcal{A}\mathcal{H}
(D), of D to be the set of all points in P that can see two points of D at a right angle. We show that the perimeter of
AH\mathcal{A}\mathcal{H}
(D) cannot exceed the perimeter of the relative convex hull of D by more than a factor of 2. A special case occurs when P equals the full plane. Here we prove a bound of π/2. Both bounds are tight, and corresponding results are obtained for any
other angle.
|
Year | DOI | Venue |
---|---|---|
1998 | 10.1007/BFb0054356 | SWAT |
Keywords | Field | DocType |
convex hull | Combinatorics,Polygon,Right angle,Computational geometry,Convex hull,Arc length,Perimeter,Simple polygon,Geometry,Hull,Mathematics | Conference |
Volume | ISSN | ISBN |
1432 | 0302-9743 | 3-540-64682-5 |
Citations | PageRank | References |
2 | 0.49 | 8 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Frank Hoffmann | 1 | 575 | 51.49 |
Christian Icking | 2 | 364 | 33.17 |
Rolf Klein | 3 | 237 | 19.69 |
Klaus Kriegel | 4 | 242 | 26.37 |