Results 251 to 260 of about 1,723,272 (287)
Some of the next articles are maybe not open access.
2013
There are several ways to define a curve in the plane. For example, explicitly parameterized as a continuous function f:[0,1]→ℝ2, or (as in the case of an affine algebraic curve) implicitly as the zero set of a bivariate polynomial. For some technical applications, there are different ways of representing a curve which are more useful in those contexts,
Michael Joswig, Thorsten Theobald
openaire +1 more source
There are several ways to define a curve in the plane. For example, explicitly parameterized as a continuous function f:[0,1]→ℝ2, or (as in the case of an affine algebraic curve) implicitly as the zero set of a bivariate polynomial. For some technical applications, there are different ways of representing a curve which are more useful in those contexts,
Michael Joswig, Thorsten Theobald
openaire +1 more source
Reconstructing Curves without Delaunay Computation
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sumanta Guha, Son Dinh Tran
openaire +1 more source
FAST RECONSTRUCTION OF CURVES WITH SHARP CORNERS
International Journal of Computational Geometry & Applications, 2002We present an algorithm to reconstruct a collection of piecewise smooth simple closed curves in the plane from a set of n sample points in O(n log n) time We prove our algorithm correctly reconstructs the curves assuming certain sampling conditions which are based on the minimum angle made by tangents at any corner point but does not include any ...
Tamal K. Dey, Rephael Wenger
openaire +1 more source
Reconstructing collections of arbitrary curves
Proceedings of the twenty-first annual symposium on Computational geometry, 2005The presented alg rithm rec nstructs collections of arbitrary curves (open, closed, smooth, with corners, with or without intersections). The algorithm is very simple and short and follows a novel and simple greedy strategy. The corner and intersection points are not required to but allowed to be in the sample.
openaire +2 more sources
Reconstruction of the curve of Spee
Stomatologie, 2008AIM: The construction of a flat occlusal plane or one showing a haphazard curvature does not correspond to the concept of "best practice" in restorative dentistry. Unlike a flat reconstruction, a correct occlusal curvature allows mandibular translation without occlusal interferences in the posterior segment, Furthermore masticatory efficiency on the ...
J.-P. Ré +5 more
openaire +1 more source
RECONSTRUCTION OF CURVED PARTICLE STREAK TRAJECTORIES
Journal of Flow Visualization and Image Processing, 2008We present a method for reconstructing curved particle trajectories from particle streak velocimetry. The reflection properties of a particle are modeled as a point light source. The mapping of the particle on the image is spread by the point spread function of the camera lens.
Rosenstiel, Marcus, Grigat, Rolf-Rainer
openaire +1 more source
Analysis of Curve Reconstruction by Meshless Parameterization
Numerical Algorithms, 2003A method called meshless parameterization is proposed for curve reconstruction. It is based on mapping the points into the real axis, by solving a sparse linear system, and ordering them. Sufficient discrete conditions on the samples points are derived ensuring that the points are ordered correctly.
openaire +1 more source
3D curve reconstruction by biplane snakes
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002Stent implantation for coronary disease treatment is a highly important minimally invasive technique that avoids surgery interventions. In order to assure the success of such an intervention, it is very important to determine the real length of the lesion as exactly as possible.
Cristina Cañero Morales +4 more
openaire +2 more sources
3D curve interpolation and object reconstruction
IEEE International Conference on Image Processing 2005, 2005Three dimensional objects viewed as surfaces or volumes embedded in /spl Ropf//sup 3/, are usually sampled along the z-dimension by planes for rendering or modeling purposes. The resulting intersections are curves or planar shapes which may in turn be modeled for parsimony of representation. Each curve or planar shape may be viewed as a point in a high
Sajjad Baloch +3 more
openaire +1 more source
Tomographic reconstruction using curve evolution
Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662), 2002In this paper, we develop a new approach to tomographic reconstruction problems based on geometric curve evolution techniques. We use a low order parametric model to describe the shape and texture of the object support as well as the background. This model uses a set of texture coefficients to represent the object and background inhomogeneities and a ...
Haihua Feng +2 more
openaire +2 more sources

