2601 search results - page 135 / 521 » A Point in Many Triangles |
150
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...
173
click to vote
ALIFE
2004
15 years 6 months ago
2004
We study the evolution of robustness in digital organisms adapting to a high mutation rate. As genomes adjust to the harsh mutational environment, the mean effect of single mutatio...
129
click to vote
MOC
1998
15 years 6 months ago
1998
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
163
click to vote
ICMCS
2009
IEEE
15 years 4 months ago
2009
IEEE
In many multi-view stereo (MVS) algorithms, a point-cloud evolution is performed, based on the matching process. For most of them, an assumption is usually employed for the matchi...
201
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...