<--- Back to Details
First PageDocument Content
Star-shaped polygon / Monotone polygon / Area / Binary space partitioning / Visibility polygon / Art gallery problem / Star polygon / Geometry / Polygons / Simple polygon
Date: 2008-10-29 00:00:28
Star-shaped polygon
Monotone polygon
Area
Binary space partitioning
Visibility polygon
Art gallery problem
Star polygon
Geometry
Polygons
Simple polygon

triangulating-guarded-polygons-journal.dvi

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 221,06 KB

Share Document on Facebook

Similar Documents

Geometry / Polygons / Mathematics / Space / Art gallery problem / Polygon / Vertex / Convex polygon / Simple polygon / Star polygon / Visibility graph / Knapsack problem

How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract

DocID: 1r85C - View Document

Geometry / Polygons / Mathematics / Art gallery problem / Simple polygon / Visibility polygon

Maximizing the Guarded Interior of an Art Gallery Ioannis Emiris∗ Christodoulos Fragoudakis† (Θ(log n)–approximable [6], [3], [4]). In [7] the case

DocID: 1qETY - View Document

Polygons / Geometry / Mathematics / Polygon triangulation / Simple polygon / Visibility polygon / Polygon / Art gallery problem / Triangulation / Star-shaped polygon / Rectilinear polygon / Star polygon

Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Experience Report Ilya Sergey University College London, UK

DocID: 1q1E0 - View Document

Mathematics / Geometry / Graph theory / Polygons / Computational geometry / Euclidean plane geometry / Art gallery problem / Vertex / Visibility graph / Visibility polygon / Pseudotriangle

Budgeted Coverage of a Maximum Part of a Polygonal Area Euripides Markou1 , Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens

DocID: 1pP8r - View Document

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

DocID: 1paTw - View Document