Solving visibility problems on MCCs of smaller size

DOI10.1016/0020-0255(91)90029-TMaRDI QIDQ2638829zbMATH OpenFDO

Authors Mi Lu

Publication date 1991

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

trade-offsvisibility problemMCC algorithms

Mathematics Subject Classification ID

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

Recommendations

• Approximate solutions to several visibility optimization problems
• Solving visibility and separability problems on a mesh-of-processors
• scientific article; zbMATH DE number 3894498
• A more compact visibility representation
• scientific article; zbMATH DE number 3958767
• Optimum algorithm for the mutual visibility problem
• A practical approach for planar visibility maintenance
• Visibility optimization using variational approaches

Cites work

• A linear algorithm for computing the visibility polygon from a point
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Geometric problems on two-dimensional array processors
• Graph Problems on a Mesh-Connected Processor Array
• On the Number of Stable States in a NOR Network
• Sorting on a mesh-connected parallel computer

Cited in

(1)

• scientific article; zbMATH DE number 4050999 (Why is no real title available?)

This page was built for publication: Solving visibility problems on MCCs of smaller size

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