Back to Results
First PageMeta Content
Polygons / NP-complete problems / Computational problems / Computational geometry / Combinatorial optimization / Art gallery problem / Visibility graph / Simple polygon / Clique / Cut / Optimization problem / Polygon covering


Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece
Add to Reading List

Document Date: 2016-05-24 11:28:43


Open Document

File Size: 89,33 KB

Share Result on Facebook