9659 search results - page 97 / 1932 » Points on Computable Curves |
191
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
A fundamental question for edge detection is how faint an edge can be and still be detected. In this paper we offer a formalism to study this question and subsequently introduce a...
131
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
149
click to vote
IVC
2007
15 years 6 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
174
click to vote
JSC
2011
14 years 9 months ago
2011
We scan a large class of one-parameter families of elliptic curves for efficient arithmetic. The construction of the class is inspired by toric geometry, which provides a natural ...
171
click to vote
VC
2008
15 years 6 months ago
2008
Defining sharp features in a 3D model facilitates a better understanding of the surface and aids geometric processing and graphics applications, such as reconstruction, filtering, ...