Sciweavers

876 search results - page 3 / 176
» Complexity in geometric SINR
Sort
View
CVPR
2012
IEEE
11 years 8 months ago
Geometric understanding of point clouds using Laplace-Beltrami operator
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
Jian Liang, Rongjie Lai, Tsz Wai Wong, Hongkai Zha...
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
13 years 9 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
DCG
2011
13 years 17 days ago
Random Geometric Complexes
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
Matthew Kahle
ALGORITHMICA
2000
80views more  ALGORITHMICA 2000»
13 years 5 months ago
Geometric Eccentricity and the Complexity of Manipulation Plans
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
A. Frank van der Stappen, Kenneth Y. Goldberg
COLT
2001
Springer
13 years 10 months ago
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
Sanjay Jain, Efim B. Kinber