scientific article; zbMATH DE number 2077120

MaRDI QIDQ4470504zbMATH OpenFDO

Authors Supriya Biswas, D. C. Prasad, Sudebkumar Prasant Pal

Publication date 1 July 2004

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Recognizing weakly convex visible polygons
• Some chain visibility problems in a simple polygon
• Computing the visibility polygon from a convex set and related problems
• An Optimal Algorithm for Computing Visibility in the Plane
• Computing the visibility graph of points within a polygon

Cited in

(15)

• An algorithm for determining an opaque minimal forest of a convex polygon
• A hierarchy of simple polygons.
• Recognizing weakly convex visible polygons
• A unified approach to conic visibility
• Finding a guard that sees most and a shop that sells most
• Computing the maximum clique in the visibility graph of a simple polygon
• \(\alpha\)-visibility
• An Optimal Algorithm for Computing Visibility in the Plane
• scientific article; zbMATH DE number 1102588 (Why is no real title available?)
• POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER
• PLANAR STRONG VISIBILITY
• Convexifying monotone polygons while maintaining internal visibility
• Computing the visibility polygon from a convex set and related problems
• An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
• Some chain visibility problems in a simple polygon

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 Q4470504)