2638 search results - page 276 / 528 » Random Geometric Complexes |
192
click to vote
STACS
2005
Springer
16 years 2 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
269
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
165
click to vote
GMP
2006
IEEE
16 years 19 days ago
2006
IEEE
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
165
click to vote
IMR
2004
Springer
15 years 12 months ago
2004
Springer
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
194
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...