31 search results - page 1 / 7 » Robust adaptive polygonal approximation of implicit curves |
CG
2002
Springer
13 years 4 months ago
2002
Springer
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
VMV
2007
13 years 5 months ago
2007
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
ICIP
2009
IEEE
14 years 5 months ago
2009
IEEE
A new and fast method for dominant point detection and polygonal representation of a discrete curve is proposed. Starting from results of discrete geometry [1, 2], the notion of m...
PG
2007
IEEE
13 years 10 months ago
2007
IEEE
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
IMAMS
2007
13 years 5 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...