Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2010
Springer

favoriteEmaildiscussreport

113views Education» more CORR 2010»

Opaque sets

13 years 4 months ago

Download www.cs.uwm.edu

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest barrier for a given convex polygon with n vertices. No exact algorithm is currently known even for the simplest instances such as a square or an equilateral triangle. For general barriers, we present a O(n) time approximation algorithm with ratio 1 2 + 2+ 2

Adrian Dumitrescu, János Pach

Real-time Traffic

Convex Polygon | Convex Region | CORR 2010 | Education | Shortest Barrier |

claim paper

Related Content

» ExOpaque A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Progr...

» Dynamic Observers for the Synthesis of Opaque Systems

» On Schema Matching with Opaque Column Names and Data Values

» Shapeadaptive coding using binary set splitting with kd trees

» Verification of Kstep opacity and analysis of its complexity

» Automatic Rule Acquisition for Spelling Correction

» Opacityenforcing supervisory strategies for secure discrete event systems

» Genetic rule extraction optimizing brier score

» Oracle Coached Decision Trees and Lists

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Adrian Dumitrescu, János Pach

Comments (0)