scientific article; zbMATH DE number 177567

MaRDI QIDQ4037438zbMATH OpenFDO

Authors Gert Vegter

Publication date 18 May 1993

zbMATH Keywords

dynamic algorithmline segmentsvisibility

Mathematics Subject Classification ID

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

Recommendations

• Maintaining the visibility graph of a dynamic simple polygon
• Dynamic algorithms for visibility polygons in simple polygons
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Visibility queries and maintenance in simple polygons
• A fast algorithm for computing sparse visibility graphs

Cited in

(6)

• Maintaining the visibility graph of a dynamic simple polygon
• Incremental algorithms to update visibility polygons
• A practical approach for planar visibility maintenance
• Semi-dynamic connectivity in the plane
• Dynamic algorithms for visibility polygons in simple polygons
• Dynamic maintenance of shortest path trees in simple 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 Q4037438)