scientific article; zbMATH DE number 432849

MaRDI QIDQ3138983zbMATH OpenFDO

Authors Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried Toussaint, J. Urrutia

Publication date 20 October 1993

zbMATH Keywords

Aquarium Keeper's problemconvex hullsconvex polygons

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(9)

• Finding shortest safari routes in simple polygons
• Watchman routes in the presence of a pair of convex polygons
• Computing minimum length paths of a given homotopy class
• Fast computation of shortest watchman routes in simple polygons
• Polynomial-time algorithms for the touring rays and related problems
• Optimal placement of base stations in border surveillance using limited capacity drones
• The touring rays and related problems
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
• Computing a shortest watchman path in a simple polygon in polynomial-time

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