Recognizing weakly convex visible polygons

DOI10.1016/S0925-7721(98)00006-6zbMath0901.68200OpenAlexW1985148525MaRDI QIDQ1392848

D. C. Prasad, Supriya Biswas, 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(98)00006-6

zbMATH Keywords

weakly convex visible polygons

Mathematics Subject Classification ID

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

Cites Work

• Characterizing and recognizing weak visibility polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Corrections to Lee's visibility polygon algorithm
• An optimal visibility graph algorithm for triangulated simple polygons
• An algorithm for recognizing palm polygons
• Visibility of a simple polygon
• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing weakly convex visible polygons