Results 1  10
of
852,978
Freeform deformation of solid geometric models
 IN PROC. SIGGRAPH 86
, 1986
"... A technique is presented for deforming solid geometric models in a freeform manner. The technique can be used with any solid modeling system, such as CSG or Brep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces, f ..."
Abstract

Cited by 702 (1 self)
 Add to MetaCart
A technique is presented for deforming solid geometric models in a freeform manner. The technique can be used with any solid modeling system, such as CSG or Brep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces
Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories
 In CVPR
"... This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingly fine subregions and computing histograms of local features found inside each subregion. The resulting “spatial pyrami ..."
Abstract

Cited by 1918 (47 self)
 Add to MetaCart
This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingly fine subregions and computing histograms of local features found inside each subregion. The resulting “spatial
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 631 (6 self)
 Add to MetaCart
is based on relative coordinates that are simply the distances from a host to some special network nodes. We propose the second mechanism, called Global Network Positioning (GNP), which is based on absolute coordinates computed from modeling the Internet as a geometric space. Since end hosts maintain
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 495 (0 self)
 Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
 Machine Learning
, 1998
"... . This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract

Cited by 483 (43 self)
 Add to MetaCart
. This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from
Incremental mapping of large cyclic environments
 In Computational Intelligence in Robotics and Automation
, 1999
"... Mobile robots can use geometric or topological maps of their environment to navigate reliably. Automatic creation of such maps is still an unrealized goal, especially in environments that have large cyclical structures. Drawing on recent techniques of global registration and correlation, we present ..."
Abstract

Cited by 331 (19 self)
 Add to MetaCart
Mobile robots can use geometric or topological maps of their environment to navigate reliably. Automatic creation of such maps is still an unrealized goal, especially in environments that have large cyclical structures. Drawing on recent techniques of global registration and correlation, we present
Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
 Proceedings of the National Academy of Sciences
, 2005
"... of contexts of data analysis, such as spectral graph theory, manifold learning, nonlinear principal components and kernel methods. We augment these approaches by showing that the diffusion distance is a key intrinsic geometric quantity linking spectral theory of the Markov process, Laplace operators ..."
Abstract

Cited by 257 (45 self)
 Add to MetaCart
of contexts of data analysis, such as spectral graph theory, manifold learning, nonlinear principal components and kernel methods. We augment these approaches by showing that the diffusion distance is a key intrinsic geometric quantity linking spectral theory of the Markov process, Laplace
Some properties of Noether charge and a proposal for dynamical black hole entropy
 Phys. Rev
, 1994
"... We consider a general, classical theory of gravity with arbitrary matter fields in n dimensions, arising from a diffeomorphism invariant Lagrangian, L. We first show that L always can be written in a “manifestly covariant ” form. We then show that the symplectic potential current (n − 1)form, Θ, an ..."
Abstract

Cited by 327 (4 self)
 Add to MetaCart
, and the symplectic current (n − 1)form, ω, for the theory always can be globally defined in a covariant manner. Associated with any infinitesimal diffeomorphism is a Noether current (n − 1)form, J, and corresponding Noether charge (n − 2)form, Q. We derive a general “decomposition formula ” for Q. Using
Conformal deformation of a Riemannian metric to constant curvature
 J. Diff. Geome
, 1984
"... A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe&apos ..."
Abstract

Cited by 308 (0 self)
 Add to MetaCart
the local geometry of M in a small neighborhood of a point, and hence could not be used on a conformally flat manifold where the Yamabe problem is clearly a global problem. Recently, a number of geometers have been interested in the conformally flat manifolds of positive scalar curvature where a solution
Shape Distributions
 ACM Transactions on Graphics
, 2002
"... this paper, we propose and analyze a method for computing shape signatures for arbitrary (possibly degenerate) 3D polygonal models. The key idea is to represent the signature of an object as a shape distribution sampled from a shape function measuring global geometric properties of an object. The pr ..."
Abstract

Cited by 296 (2 self)
 Add to MetaCart
this paper, we propose and analyze a method for computing shape signatures for arbitrary (possibly degenerate) 3D polygonal models. The key idea is to represent the signature of an object as a shape distribution sampled from a shape function measuring global geometric properties of an object
Results 1  10
of
852,978