11 search results - page 1 / 3 » Convex Distance Functions in 3-Space are Different |
COMPGEOM
1993
ACM
13 years 8 months ago
1993
ACM
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
SIAMCOMP
2008
13 years 4 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
NIPS
2007
13 years 6 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
SMI
2008
IEEE
13 years 11 months ago
2008
IEEE
The distribution of geometric features is anisotropic by its nature. Intrinsic properties of surfaces such as normal curvatures, for example, varies with direction. In this paper ...