Sciweavers

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

56

Voted

COMPGEOM
2000
ACM

favoriteEmaildiscussreport

130views Discrete Geometry» more COMPGEOM 2000»

An algorithm for searching a polygonal region with a flashlight

15 years 1 months ago

An algorithm for searching a polygonal region with a flashlight

Download msl.cs.uiuc.edu

Steven M. LaValle, Borislav H. Simov, Giora Slutzk

Real-time Traffic

COMPGEOM 2000 | Discrete Geometry |

claim paper

Related Content

» Finding the MinimumDistance Schedule for a Boundary Searcher with a Flashlight

» Applications of Parametric Searching in Geometric Optimization

» ExpansionBased Algorithms for Finding Single Pair Shortest Path on Surface

» Widestcorridor Problems

» Finding Optimal Integral Sampling Lattices for a given Frequency Support in Multidimension...

Post Info
More Details (n/a)

Added	01 Aug 2010
Updated	01 Aug 2010
Type	Conference
Year	2000
Where	COMPGEOM
Authors	Steven M. LaValle, Borislav H. Simov, Giora Slutzki

Comments (0)