Visibility with multiple diffuse reflections

DOI10.1016/S0925-7721(97)00021-7zbMath0908.68183OpenAlexW1999352513MaRDI QIDQ1392849

D. C. Prasad, Tamal Krishna Dey, Sudebkumar Prasant Pal

Publication date: 2 August 1998

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00021-7

zbMATH Keywords

visibilitycombinatorial complexitydiffuse reflection

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Diffuse reflection diameter in simple polygons ⋮ Diffuse reflection diameter and radius for convex-quadrilateralizable polygons ⋮ Algorithms for Computing Diffuse Reflection Paths in Polygons

Cites Work

• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Computing the link center of a simple polygon
• Visibility with multiple reflections
• Visibility with one reflection
• A linear time algorithm for minimum link paths inside a simple polygon
• Computing the visibility polygon from an edge
• Algorithms for Reporting and Counting Geometric Intersections
• Visibility of a simple polygon
• A linear algorithm for computing the visibility polygon from a point
• An O(n log n) algorithm for computing a link center in a simple polygon
• Computing the visibility polygon from a convex set and related problems

This page was built for publication: Visibility with multiple diffuse reflections