153 search results - page 17 / 31 » Near-linear approximation algorithms for geometric hitting s... |
134
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
161
click to vote
PG
2000
IEEE
15 years 8 months ago
2000
IEEE
PDE surfaces, whose behavior is governed by Partial Differential Equations (PDEs), have demonstrated many modeling advantages in surface blending, free-form surface modeling, and ...
139
click to vote
ALGORITHMICA
2008
15 years 3 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
118
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
131
click to vote
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...