Sciweavers

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

33

SIBGRAPI
2000
IEEE

favoriteEmaildiscussreport

104views Computer Graphics» more SIBGRAPI 2000»

Fast Euclidean Distance Transform using a Graph-Search Algorithm

14 years 3 months ago

Fast Euclidean Distance Transform using a Graph-Search Algorithm

Download sibgrapi.sid.inpe.br

Roberto de Alencar Lotufo, Alexandre X. Falc&atild

Real-time Traffic

Computer Graphics | SIBGRAPI 2000 |

claim paper

Related Content

» Fast Euclidean distance transformation in two scans using a 3 3 neighborhood

» An Efficient Euclidean Distance Transform

» The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable

» Neighborhood based fast graph search in large networks

» Beyond the Euclidean distance Creating effective visual codebooks using the histogram inte...

» Parallel Banding Algorithm to compute exact distance transform with the GPU

» Optimum design of chamfer distance transforms

» Generalized pattern matching using orbit decomposition

» 3D Shape Context and Distance Transform for action recognition

Post Info
More Details (n/a)

Added	01 Aug 2010
Updated	01 Aug 2010
Type	Conference
Year	2000
Where	SIBGRAPI
Authors	Roberto de Alencar Lotufo, Alexandre X. Falcão, Francisco A. Zampirolli

Comments (0)