Sciweavers

102291 search results - page 72 / 20459
» Computability in Computational Geometry
Sort
View
143
Voted
CVPR
1999
IEEE
15 years 8 months ago
Projective Rectification Without Epipolar Geometry
We present a novel algorithm performing projective rectification which does not require explicit computation of the epipolar geometry, and specifically of the fundamental matrix. ...
Francesco Isgrò, Emanuele Trucco
125
Voted
ESA
2004
Springer
124views Algorithms» more  ESA 2004»
15 years 7 months ago
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
Efi Fogel, Ron Wein, Dan Halperin
ICA
2010
Springer
15 years 2 months ago
Riemannian Geometry Applied to BCI Classification
Abstract. In brain computer interface based on motor imagery, covariances matrices are widely used through spatial filters computation and other signal processing methods. Covarian...
Alexandre Barachant, Stéphane Bonnet, Marco...
SIBGRAPI
2007
IEEE
15 years 10 months ago
Application-independent accurate mouse placements on surfaces of arbitrary geometry
Most direct manipulation tasks rely on precise placements of the cursor on the object of interest. Commonly, this requires the knowledge of distinct application-dependent geometry...
Harlen Costa Batagelo, Shin-Ting Wu
COMPGEOM
2005
ACM
15 years 6 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert