Algorithms for Computing Diffuse Reflection Paths in Polygons

DOI10.1007/978-3-642-00202-1_5zbMATH Open1211.68467OpenAlexW1588543750MaRDI QIDQ3605484FDOQ3605484

Anil Maheshwari, Subhas C. Nandy, Swami Sarvattomananda, Partha Goswami, Subir Kumar Ghosh, Sudebkumar Prasant Pal

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_5

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Computing the visibility polygon from a convex set and related problems
• Triangulating a simple polygon in linear time
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Visibility with multiple reflections
• Visibility with one reflection
• Visibility with multiple diffuse reflections
• A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
• The Complexity of Diffuse Reflections in a Simple Polygon
• Polygonal Rooms Not Illuminable from Every Point
• Visibility Algorithms in the Plane
• Euclidean shortest paths in the presence of rectilinear barriers
• Optimal shortest path queries in a simple polygon
• Ray shooting in polygons using geodesic triangulations
• An optimal visibility graph algorithm for triangulated simple polygons
• Minimum-link paths among obstacles in the plane
• The vertex-edge visibility graph of a polygon

Cited In (3)

• Diffuse reflection radius in a simple polygon
• Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
• A Novel Ray Tracing Algorithm for Scenarios Comprising Pre-Ordered Multiple Planar Reflectors, Straight Wedges, and Vertexes

This page was built for publication: Algorithms for Computing Diffuse Reflection Paths in Polygons

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