Approximate solutions to several visibility optimization problems

DOI10.4310/CMS.2011.V9.N2.A9MaRDI QIDQ548452zbMATH OpenFDO

Authors Rostislav Goroshin, Quyen Huynh, Haomin Zhou

Publication date 28 June 2011

Published in Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.cms/1305034466

zbMATH Keywords

level set methodoptimizationvisibility

Mathematics Subject Classification ID

Boundary value problems for nonlinear first-order PDEs (35F30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Recommendations

• Visibility optimization using variational approaches
• Optimal path planning based on visibility
• Properties of a level set algorithm for the visibility problems
• scientific article; zbMATH DE number 2112895
• Watchman routes under limited visibility

Cited in

(8)

• Optimal path planning based on visibility
• Visibility and its dynamics in a PDE based implicit framework
• Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
• Visibility optimization using variational approaches
• Solving visibility problems on MCCs of smaller size
• scientific article; zbMATH DE number 2112895 (Why is no real title available?)
• The visible-volume function of a set of cameras is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions
• Properties of a level set algorithm for the visibility problems

This page was built for publication: Approximate solutions to several visibility optimization problems

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