Sciweavers

401 search results - page 10 / 81
» Geometry of Isophote Curves
Sort
View
ESA
2004
Springer
124views Algorithms» more  ESA 2004»
13 years 11 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
CGF
2011
12 years 11 months ago
Contouring Discrete Indicator Functions
We present a method for calculating the boundary of objects from Discrete Indicator Functions that store 2material volume fractions with a high degree of accuracy. Although Marchi...
Josiah Manson, J. Smith, Scott Schaefer
NSF
1994
Springer
151views Computer Vision» more  NSF 1994»
13 years 11 months ago
Algebraic Geometry and Object Representation in Computer Vision
The goal of algebraic geometry is to gain an understanding of the behaviour of functions related by polynomial relationships. Algebraic curves and surfaces having considerable adva...
Sylvain Petitjean
SMA
2009
ACM
166views Solid Modeling» more  SMA 2009»
14 years 2 months ago
A geometric criterion for smooth interpolation of curve networks
A key problem when interpolating a network of curves occurs at vertices: an algebraic condition called the vertex enclosure constraint must hold wherever an even number of curves ...
T. Hermann, J. Peters, T. Strotman
COMPGEOM
2010
ACM
14 years 18 days ago
3D Euler spirals for 3D curve completion
Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper defines a new type of 3D curves, which can be utilized for curv...
Gur Harary, Ayellet Tal