Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

DOI10.1016/J.DAM.2012.12.020MaRDI QIDQ2446331zbMATH OpenOpenAlexFDO

Authors Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy

Publication date 16 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.12.020

zbMATH Keywords

diametercombinatorial geometryradiusvisibilityilluminationdiffuse reflectionconvex-quadrilateralizable polygon

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• Diffuse reflection diameter in simple polygons
• Visibility with multiple diffuse reflections
• Visibility with multiple reflections

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 51916 (Why is no real title available?)
• scientific article; zbMATH DE number 1182918 (Why is no real title available?)
• scientific article; zbMATH DE number 1424300 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• A combinatorial theorem in plane geometry
• A linear time algorithm for minimum link paths inside a simple polygon
• A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
• Algorithms for Computing Diffuse Reflection Paths in Polygons
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• Computing the link center of a simple polygon
• Computing the visibility polygon from a convex set and related problems
• Polygonal Rooms Not Illuminable from Every Point
• The Complexity of Diffuse Reflections in a Simple Polygon
• Visibility Algorithms in the Plane
• Visibility with multiple diffuse reflections
• Visibility with multiple reflections
• Visibility with one reflection

Cited in

(4)

• The Complexity of Diffuse Reflections in a Simple Polygon
• Algorithms for Computing Diffuse Reflection Paths in Polygons
• A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
• Diffuse reflection diameter in simple polygons

This page was built for publication: Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

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