Recognizing weakly convex visible polygons

DOI10.1016/S0925-7721(98)00006-6MaRDI QIDQ1392848zbMATH OpenOpenAlexFDO

Authors Supriya Biswas, D. C. Prasad, 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)

Recommendations

• scientific article; zbMATH DE number 2077120
• Characterizing and recognizing weak visibility polygons
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• scientific article; zbMATH DE number 4043246

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 2077120 (Why is no real title available?)
• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Finding the Kernel of a Polygon
• An algorithm for recognizing palm polygons
• An optimal visibility graph algorithm for triangulated simple polygons
• Characterizing and recognizing weak visibility polygons
• Corrections to Lee's visibility polygon algorithm
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Visibility of a simple polygon

Cited in

(6)

• Recognizing weakly simple polygons
• Characterizing and recognizing weak visibility polygons
• Convexifying monotone polygons while maintaining internal visibility
• Visibility concepts in orthogonal polygon recognition
• scientific article; zbMATH DE number 2077120 (Why is no real title available?)
• Recognizing polygons, or how to spy

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

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