A note on the perimeter of fat objects

DOI10.1016/J.COMGEO.2010.06.002zbMATH Open1202.65025OpenAlexW1965013906MaRDI QIDQ709064FDOQ709064

Authors: Prosenjit Bose, Vida Dujmović, Otfried Cheong 

Publication date: 15 October 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.06.002

Recommendations

• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
• Walking around fat obstacles.
• Improved bounds for the union of locally fat objects in the plane
• Improved bounds on the union complexity of fat objects
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

zbMATH Keywords

fractalscurvesfat objectsKoch snowflakeperimeter lengthrealistic inputsvisibility perimeter

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Fractals (28A80) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Guarding galleries where no point sees a small area.
• Triangulating and guarding realistic polygons
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
• Improved bounds on the union complexity of fat objects
• Realistic input models for geometric algorithms
• Fat Triangles Determine Linearly Many Holes
• Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
• Walking around fat obstacles.

Cited In (1)

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

This page was built for publication: A note on the perimeter of fat objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709064)