scientific article

zbMATH Open0666.68037MaRDI QIDQ3817601FDOQ3817601

Subir Kumar Ghosh

Publication date: 1988

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational geometryvisibilityart gallery problemwatchman problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)

Cited In (2)

• Title not available (Why is that?)
• Does a point lie inside a polygon ?

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Computing the visibility polygon from a convex set and related problems 👍 👎
• Computing the visibility graph of points within a polygon 👍 👎
• Computing a visibility polygon using few variables 👍 👎

This page was built for publication:

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