Results 1  10
of
3,844,998
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
"... The number of triangulations of a planar n point set is known to be cn, where the base c lies between 2.43 and 30. The fastest known algorithm for counting triangulations of a planar n point set runs in O∗(2n) time. The fastest known arbitrarily close approximation algorithm for the base of the numb ..."
Abstract
 Add to MetaCart
The number of triangulations of a planar n point set is known to be cn, where the base c lies between 2.43 and 30. The fastest known algorithm for counting triangulations of a planar n point set runs in O∗(2n) time. The fastest known arbitrarily close approximation algorithm for the base
Detection and Tracking of Point Features
 International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
leads to a NewtonRaphson style minimization. In this report, after rederiving the method in a physically intuitive way, we answer the crucial question of how to choose the feature windows that are best suited for tracking. Our selection criterion is based directly on the definition of the tracking
Discrete DifferentialGeometry Operators for Triangulated 2Manifolds
, 2002
"... This paper provides a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Vorono ..."
Abstract

Cited by 453 (17 self)
 Add to MetaCart
This paper provides a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging
Spacetime Interest Points
 IN ICCV
, 2003
"... Local image features or interest points provide compact and abstract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points into the spatiotemporal domain and show how the resulting features often reflect interesting events that can be use ..."
Abstract

Cited by 791 (22 self)
 Add to MetaCart
Local image features or interest points provide compact and abstract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points into the spatiotemporal domain and show how the resulting features often reflect interesting events that can
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 659 (7 self)
 Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points
A Separator Theorem for Planar Graphs
, 1977
"... Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which ..."
Abstract

Cited by 465 (1 self)
 Add to MetaCart
Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which
Assigned Numbers
 STD 2, RFC 1700, USC/Information Sciences Institute
, 1994
"... Status of this Memo ..."
OPTICS: Ordering Points To Identify the Clustering Structure
, 1999
"... Cluster analysis is a primary method for database mining. It is either used as a standalone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of ..."
Abstract

Cited by 511 (49 self)
 Add to MetaCart
the intrinsic clustering structure accurately. We introduce a new algorithm for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its densitybased clustering structure. This cluster
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 500 (8 self)
 Add to MetaCart
and progressively displaying these meshes that combines a multiresolution hierarchy based on bounding spheres with a rendering system based on points. A single data structure is used for view frustum culling, backface culling, levelofdetail selection, and rendering. The representation is compact and can
Results 1  10
of
3,844,998