215 search results - page 43 / 43 » Farthest-Polygon Voronoi Diagrams |
90
Voted
CVPR
2007
IEEE
15 years 4 months ago
2007
IEEE
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
MOBICOM
2003
ACM
15 years 3 months ago
2003
ACM
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
91
Voted
SMA
2003
ACM
15 years 3 months ago
2003
ACM
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
96
Voted
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...