Visibility with multiple diffuse reflections
type: Item
instance of: scholarly article
title: Visibility with multiple diffuse reflections
zbMATH Open document ID: 0908.68183
DOI: 10.1016/S0925-7721(97)00021-7
author: D. C. Prasad
author: Sudebkumar Prasant Pal
author: Tamal K. Dey
published in: Computational Geometry
publication date: 1998-08-02T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 1182021
zbMATH Keywords: visibility
zbMATH Keywords: combinatorial complexity
zbMATH Keywords: diffuse reflection
MaRDI profile type: Publication
cites work: Visibility with one reflection
cites work: Visibility with multiple reflections
cites work: Algorithms for Reporting and Counting Geometric Intersections
cites work: An O(n log n) algorithm for computing a link center in a simple polygon
cites work: A linear algorithm for computing the visibility polygon from a point
cites work: Computing the visibility polygon from a convex set and related problems
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: Visibility of a simple polygon
cites work: Computing the visibility polygon from an edge
cites work: Computing the link center of a simple polygon
cites work: Q3799261
cites work: A linear time algorithm for minimum link paths inside a simple polygon
full work available at URL: s0925-7721(97)00021-7
OpenAlex ID: W1999352513
description: scientific article; zbMATH DE number 1182021