Sciweavers

Share
33 search results - page 1 / 7
» Robust adaptive polygonal approximation of implicit curves
Sort
View
CG
2002
Springer
8 years 8 months ago
Robust adaptive polygonal approximation of implicit curves
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...
Hélio Lopes, João Batista S. de Oliv...
VMV
2007
155views Visualization» more  VMV 2007»
8 years 9 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
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...
David Bommes, Leif Kobbelt
ICIP
2009
IEEE
9 years 9 months ago
Fast And Robust Dominant Points Detection On Digital Curves
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
9 years 2 months ago
Visualisation of Implicit Algebraic Curves
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 ...
Lionel Alberti, Bernard Mourrain
IMAMS
2007
157views Mathematics» more  IMAMS 2007»
8 years 10 months ago
Regularity Criteria for the Topology of Algebraic Curves and Surfaces
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...
Lionel Alberti, Bernard Mourrain
books