scientific article; zbMATH DE number 753969

zbMATH Open0817.68127MaRDI QIDQ4698690FDOQ4698690

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

Publication date 11 May 1995

zbMATH Keywords

computational geometryvisibilitychord

Mathematics Subject Classification ID

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

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

• Computing in linear time a chord from which a simple polygon is weakly internally visible
• Finding all weakly-visible chords of a polygon in linear time
• A constant-factor approximation algorithm for vertex guarding a WV-polygon
• Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
• Title not available (Why is no real title available?)
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• Finding the shortest boundary guard of a simple polygon
• Guarding in a simple polygon
• On hamiltonian triangulations in simple polygons (Extended Abstract)
• 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)