Sciweavers

102291 search results - page 113 / 20459
» Computability in Computational Geometry
Sort
View
170
Voted
TFCV
2000
15 years 5 months ago
Epipolar Geometry in Polycentric Panoramas
We introduce a new class of panoramic images, called polycentric panoramic images, which is a generalization from more specific classes such as single-center, multiple-center, or ...
Fay Huang, Shou Kang Wei, Reinhard Klette
FOCM
2002
97views more  FOCM 2002»
15 years 4 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd
SI3D
2010
ACM
15 years 11 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...
ICCV
2001
IEEE
16 years 6 months ago
Multiple View Geometry of Non-planar Algebraic Curves
We introduce a number of new results in the context of multi-view geometry from general algebraic curves. We start with the derivation of the extended Kruppa's equations whic...
Jeremy Yermiyahou Kaminski, Michael Fryers, Amnon ...
132
Voted
CGF
2008
153views more  CGF 2008»
15 years 4 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
« Prev « First page 113 / 20459 Last » Next »