An algorithm for recognizing palm polygons

DOI10.1007/BF01910634MaRDI QIDQ1345480zbMATH OpenFDO

Authors Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan

Publication date 30 March 1995

Published in The Visual Computer (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• An optimal visibility graph algorithm for triangulated simple polygons
• Characterizing and recognizing weak visibility polygons
• Computing the visibility polygon from a convex set and related problems
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On geodesic properties of polygons relevant to linear time triangulation
• Triangulating a simple polygon in linear time

Cited in

(1)

• Recognizing weakly convex visible polygons

This page was built for publication: An algorithm for recognizing palm polygons

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