Back to Results
First PageMeta Content
Polyhedron / Polyhedra / Searchlight / Art gallery problem / Simple polygon / Geometry / Polygons / Euclidean geometry


CCCG 2010, Winnipeg MB, August 9–11, 2010 The 3-dimensional Searchlight Scheduling Problem Giovanni Viglietta∗ Abstract
Add to Reading List

Document Date: 2010-07-19 10:46:14


Open Document

File Size: 401,34 KB

Share Result on Facebook

Company

Oxford University Press / SIAM Journal / 3SAT / /

/

Event

Product Issues / /

Facility

University of Pisa / /

IndustryTerm

clause devices / variable devices / proper clause device / computing / variable device / worst-case optimal algorithm / searchlight scheduling algorithm / clause device / /

Organization

Scuola Normale Superiore / poly∗ Department of Computer Science / Oxford University / University of Pisa / /

Person

Maurizio Monge / /

Position

guard / /

Product

fake link / /

PublishedMedium

SIAM Journal on Computing / IEEE Transactions on Information Theory / /

Technology

partitioning algorithm / laser / searchlight scheduling algorithm / /

SocialTag