A note on the perimeter of fat objects

Authors:
Prosenjit Bose;Otfried Cheong;Vida Dujmović
Affiliations:
School of Computer Science, Carleton University, Ottawa, Canada;Department of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, South Korea;School of Computer Science, Carleton University, Ottawa, Canada
Venue:
Computational Geometry: Theory and Applications
Year:
2011

Citing 6
Cited 1

On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

Discrete & Computational Geometry
Fat Triangles Determine Linearly Many Holes

SIAM Journal on Computing
Walking around fat obstacles

Information Processing Letters
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects

SIAM Journal on Computing
Improved Bounds on the Union Complexity of Fat Objects

Discrete & Computational Geometry
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory

Approximating the Fréchet distance for realistic curves in near linear time

Proceedings of the twenty-sixth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this Note, we show that the size of the perimeter of (@a,@b)-covered objects is a linear function of the diameter. Specifically, for an (@a,@b)-covered object O, per(O)=