Sciweavers

1082 search results - page 55 / 217
» Approximation Algorithms for Spreading Points
Sort
View
CGF
2010
165views more  CGF 2010»
13 years 6 months ago
Hierarchical Structure Recovery of Point-Sampled Surfaces
We focus on the class of regular models defined by Várady et al. for reverse engineering purposes. Given a 3D surface M represented through a dense set of points, we present a n...
Marco Attene, Giuseppe Patanè
IMC
2003
ACM
14 years 28 days ago
On the number of distributed measurement points for network tomography
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
Joseph Douglas Horton, Alejandro López-Orti...
COMPGEOM
2007
ACM
13 years 11 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
GIS
2006
ACM
14 years 8 months ago
Index for fast retrieval of uncertain spatial point data
Location information gathered from a variety of sources in the form of sensor data, video streams, human observations, and so on, is often imprecise and uncertain and needs to be ...
Dmitri V. Kalashnikov, Yiming Ma, Sharad Mehrotra,...
VC
2008
138views more  VC 2008»
13 years 7 months ago
A GPU-based light hierarchy for real-time approximate illumination
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Hyunwoo Ki, Kyoungsu Oh