Approximate solutions to several visibility optimization problems

DOI10.4310/CMS.2011.V9.N2.A9zbMATH Open1216.65027MaRDI QIDQ548452FDOQ548452

Quyen Huynh, Rostislav Goroshin, 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

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

zbMATH Keywords

optimizationlevel set methodvisibility

Mathematics Subject Classification ID

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

Cited In (7)

• Optimal path planning based on visibility
• Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
• Solving visibility problems on MCCs of smaller size
• The visible-volume function of a set of cameras is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions
• Visibility optimization using variational approaches
• Visibility and its dynamics in a PDE based implicit framework
• Title not available (Why is that?)

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)