Sciweavers

1261 search results - page 77 / 253
» Approximation algorithms for aligning points
Sort
View
SGP
2003
14 years 11 months ago
Provably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Steve Oudot, Jean-Daniel Boissonnat
TSMC
2010
14 years 4 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
15 years 11 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
JGTOOLS
2008
78views more  JGTOOLS 2008»
14 years 9 months ago
Calculating Center of Mass in an Unbounded 2D Environment
We study the behavior of simple, 2-D, self-organizing primitives that interact and move in an unbounded environment to create aggregated shapes. Each primitive is represented by a ...
Linge Bai, David E. Breen