Sciweavers

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

100

CCCG
1993

116views Computational Geometry» more CCCG 1993»

Algorithms for Proximity Problems on Colored Point Sets

15 years 4 months ago

Algorithms for Proximity Problems on Colored Point Sets

Download www.geometrylab.de

Klaus Hinrichs, Thorsten Graf

Real-time Traffic

CCCG 1993 | CCCG 2007 |

claim paper

Related Content

» An On log n Algorithm for the AllFarthestSegments Problem for a Planar Set of Points

» Proximity Algorithms for NearlyDoubling Spaces

» Inexact Proximal Point Methods for Variational Inequality Problems

» Noisy colored point set matching

» Proximal Alternating Minimization and Projection Methods for Nonconvex Problems An Approac...

» Solving LogDeterminant Optimization Problems by a NewtonCG Primal Proximal Point Algorithm

» Robust object boundary determination using a locally adaptive level set algorithm

» Pairwise Registration of 3DColor Data Sets with ICP

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1993
Where	CCCG
Authors	Klaus Hinrichs, Thorsten Graf

Comments (0)