scientific article; zbMATH DE number 4043246

MaRDI QIDQ3780436zbMATH OpenFDO

Authors Günter Werner

Publication date 1987

zbMATH Keywords

algorithmtime complexitycorrectnessweak visibility polygonedge visibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• Characterizing and recognizing weak visibility polygons
• scientific article; zbMATH DE number 4050998
• Visibility of a simple polygon
• Weak visibility queries of line segments in simple polygons and polygonal domains
• Determining Weak Visibility of a Polygon from an Edge in Parallel

Cited in

(13)

• Computing in linear time a chord from which a simple polygon is weakly internally visible
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• Corrections to Lee's visibility polygon algorithm
• The VC-dimension of visibility on the boundary of monotone polygons
• Weak visibility polygons of NURBS curves inside simple polygons
• Computing the visibility polygon using few variables
• Weak visibility queries of line segments in simple polygons and polygonal domains
• How to extend visibility polygons by mirrors to cover invisible segments
• Three dimensional weak visibility: Complexity and applications
• \(\alpha\)-kernel problem with fuzzy visibility
• scientific article; zbMATH DE number 177566 (Why is no real title available?)
• scientific article; zbMATH DE number 4050998 (Why is no real title available?)
• 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 Q3780436)