Open AccessObstacle-Avoiding Path Existence Queries in a Simple Polygon
Author(s) -
Matthew Eastman
Publication year - 2014
Language(s) - Uncategorized
Resource type - Dissertations/theses
DOI - 10.22215/etd/2014-10404
Subject(s) - polygon (computer graphics) , simple polygon , obstacle , disjoint sets , path (computing) , set (abstract data type) , simple (philosophy) , regular polygon , computer science , convex polygon , computational geometry , mathematics , visibility polygon , polygon covering , plane (geometry) , algorithm , combinatorics , geometry , geography , telecommunications , philosophy , archaeology , epistemology , frame (networking) , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom