549 search results - page 5 / 110 » Geometric computing in computer graphics using conformal geo... |
GD
2006
Springer
13 years 11 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of fitting a conic to a set of 2D points. It is commonly agreed that minimizing geometrical error, i.e. the sum of squared distances between the points and...
ENTCS
2002
13 years 7 months ago
2002
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...
DCC
2003
IEEE
14 years 7 months ago
2003
IEEE
By Andr`e theory, it is well known how to algebraically convert a spread in a projective space to an equivalent spread (representing the same translation plane) in a projective sp...
JMIV
2010
13 years 5 months ago
2010
In this paper, we present a novel algorithm that combines the power of expression of Geometric Algebra with the robustness of Tensor Voting to find the correspondences between two...