scientific article; zbMATH DE number 2080272

MaRDI QIDQ4472523zbMATH OpenFDO

Authors Xuehou Tan

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690503.htm

Mathematics Subject Classification ID

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

Recommendations

• Simple algorithms for searching a polygon with flashlights
• Searching for a Mobile Intruder in a Polygonal Region
• Combinatorial Geometry and Graph Theory
• scientific article; zbMATH DE number 1754612
• Searching a polygonal region by a group of stationary \(k\)-searchers

Cited in

(20)

• An efficient algorithm for the three-guard problem
• Simple algorithms for searching a polygon with flashlights
• A unified and efficient solution to the room search problem
• An alternative proof for the equivalence of searcher and 2-searcher
• A characterization of link-2 LR-visibility polygons with applications
• Characterization of boundary 1-searchers for polygons
• The Searchlight Scheduling Problem
• Searching for a Mobile Intruder in a Polygonal Region
• scientific article; zbMATH DE number 1754612 (Why is no real title available?)
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Visibility-based pursuit-evasion in a polygonal environment
• Searching polyhedra by rotating half-planes
• Searching a Polygonal Region by Two Guards
• Algorithms – ESA 2004
• Combinatorial Geometry and Graph Theory
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• Searching a polygonal region by a group of stationary \(k\)-searchers
• Sweeping simple polygons with the minimum number of chain guards

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 Q4472523)