Sciweavers

235 search results - page 24 / 47
» On joint triangulations of two sets of points in the plane
Sort
View
FOCM
2008
100views more  FOCM 2008»
13 years 6 months ago
Meshfree Thinning of 3D Point Clouds
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...
Nira Dyn, Armin Iske, Holger Wendland
SGP
2007
13 years 9 months ago
Shape reconstruction from unorganized cross-sections
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
Jean-Daniel Boissonnat, Pooran Memari
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 1 months ago
Lower bounds on the obstacle number of graphs
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
Padmini Mukkamala, János Pach, Döm&oum...
SSDBM
2008
IEEE
150views Database» more  SSDBM 2008»
14 years 1 months ago
Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors
Much real data consists of more than one dimension, such as financial transactions (eg, price × volume) and IP network flows (eg, duration × numBytes), and capture relationship...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
PAMI
2006
156views more  PAMI 2006»
13 years 6 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann