2342 search results - page 338 / 469 » Sublinear geometric algorithms |
157
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
118
click to vote
ANCS
2005
ACM
15 years 6 months ago
2005
ACM
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
136
click to vote
SIGGRAPH
1997
ACM
15 years 5 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
AFRIGRAPH
2003
ACM
15 years 4 months ago
2003
ACM
We present work that specifically pertains to the rendering stage of stylised, non-photorealistic sketching. While a substantial body of work has been published on geometric optim...
122
click to vote
CGF
2007
15 years 1 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...