scientific article; zbMATH DE number 753969

MaRDI QIDQ4698690zbMATH OpenFDO

Authors Paul J. Heffernan, Giri Narasimhan, Gautam K. Das

Publication date 11 May 1995

zbMATH Keywords

chordcomputational geometryvisibility

Mathematics Subject Classification ID

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

Recommendations

• Finding all weakly-visible chords of a polygon in linear time
• Computing in linear time a chord from which a simple polygon is weakly internally visible
• Characterizing and recognizing weak visibility polygons
• Optimally computing a shortest weakly visible line segment inside a simple polygon

Cited in

(10)

• Guarding in a simple polygon
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• A constant-factor approximation algorithm for vertex guarding a WV-polygon
• scientific article; zbMATH DE number 177566 (Why is no real title available?)
• Finding all weakly-visible chords of a polygon in linear time
• On hamiltonian triangulations in simple polygons (Extended Abstract)
• Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
• Finding the shortest boundary guard of a simple polygon
• Computing in linear time a chord from which a simple polygon is weakly internally visible
• Characterizing and recognizing weak visibility polygons

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