Open AccessObstacle-Avoiding Path Existence Queries in a Simple Polygon
Author(s) -
Matthew Eastman
Publication year - 2018
Language(s) - Uncategorized
Resource type - Dissertations/theses
DOI - 10.22215/etd/2014-10404
Subject(s) - polygon (computer graphics) , simple polygon , disjoint sets , path (computing) , obstacle , set (abstract data type) , simple (philosophy) , computer science , visibility polygon , regular polygon , computational geometry , polygon covering , mathematics , convex polygon , plane (geometry) , algorithm , combinatorics , geometry , geography , telecommunications , philosophy , archaeology , epistemology , frame (networking) , programming language