Multiple point visibility and related problems

DOI10.1080/00207169608804483MaRDI QIDQ2710754zbMATH OpenOpenAlexFDO

Authors Kyoung A. Seong, H. Lee-Kwang

Publication date 19 December 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169608804483

zbMATH Keywords

art gallery problemcomputational geometrymultiple point visibility

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A combinatorial theorem in plane geometry
• A short proof of Chvatal's Watchman Theorem
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Computational complexity of art gallery problems
• Computing the visibility polygon from a convex set and related problems
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3520315 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Planar graphs: Theory and algorithms
• Visibility of a simple polygon

This page was built for publication: Multiple point visibility and related problems

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