1879 search results - page 251 / 376 » Computational geometry algorithms library |
147
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
173
Voted
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
197
click to vote
CW
2008
IEEE
15 years 11 months ago
2008
IEEE
—This paper describes an automatic 3D surface scanning technique using a 3D scanner. It allows the acquisition of a complete surface model of a 3D artifact without any manual reg...
153
click to vote
ICPP
2008
IEEE
15 years 11 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
138
click to vote
IEEEPACT
2006
IEEE
15 years 11 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...