Results 1  10
of
68,828
Parametrization and smooth approximation of surface triangulations
 Computer Aided Geometric Design
, 1997
"... Abstract. A method based on graph theory is investigated for creating global parametrizations for surface triangulations for the purpose of smooth surface fitting. The parametrizations, which are planar triangulations, are the solutions of linear systems based on convex combinations. A particular pa ..."
Abstract

Cited by 303 (12 self)
 Add to MetaCart
Abstract. A method based on graph theory is investigated for creating global parametrizations for surface triangulations for the purpose of smooth surface fitting. The parametrizations, which are planar triangulations, are the solutions of linear systems based on convex combinations. A particular
ImageConsistent Surface Triangulation
, 2000
"... Given a set of 3D points that we know lie on the surface of an object, we can define many possible surfaces that pass through all of these points. Even when we consider only surface triangulations, there are still an exponential number of valid triangulations that all fit the data. Each triangulatio ..."
Abstract

Cited by 58 (1 self)
 Add to MetaCart
Given a set of 3D points that we know lie on the surface of an object, we can define many possible surfaces that pass through all of these points. Even when we consider only surface triangulations, there are still an exponential number of valid triangulations that all fit the data. Each
ImageConsistent Surface Triangulation
, 2000
"... Given a set of 3D points that we know lie on the surface of an object, we can define many possible surfaces that pass through all of these points. Even when we consider only surface triangulations, there are still an exponential number of valid triangulations that all fit the data. Each triangulatio ..."
Abstract
 Add to MetaCart
Given a set of 3D points that we know lie on the surface of an object, we can define many possible surfaces that pass through all of these points. Even when we consider only surface triangulations, there are still an exponential number of valid triangulations that all fit the data. Each
ImageConsistent Surface Triangulation
, 2000
"... Given a set of 3D points that we know lie on the surface of an object, we can define many possible surfaces that pass through all of these points. Even when we consider only surface triangulations, there are still an exponential number of valid triangulations that all fit the data. Each triangulatio ..."
Abstract
 Add to MetaCart
Given a set of 3D points that we know lie on the surface of an object, we can define many possible surfaces that pass through all of these points. Even when we consider only surface triangulations, there are still an exponential number of valid triangulations that all fit the data. Each
General specular surface triangulation
 Proc. ACCV
, 2006
"... Abstract. We present a method for the reconstruction of a specular surface, using a single camera viewpoint and the reflection of a planar target placed at two different positions. Contrarily to most specular surface reconstruction algorithms, our method makes no assumption on the regularity or cont ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
Abstract. We present a method for the reconstruction of a specular surface, using a single camera viewpoint and the reflection of a planar target placed at two different positions. Contrarily to most specular surface reconstruction algorithms, our method makes no assumption on the regularity
Surface Triangulation: A Survey
, 1996
"... This paper presents a brief survey of some problems and solutions related to the triangulation of surfaces. A surface (a two dimensional manifold, in the context of this paper) can be represented as a three dimensional function on a planar disk. In that sense, the triangulation of the disk induces a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper presents a brief survey of some problems and solutions related to the triangulation of surfaces. A surface (a two dimensional manifold, in the context of this paper) can be represented as a three dimensional function on a planar disk. In that sense, the triangulation of the disk induces
Directional Adaptive Surface Triangulation
, 1998
"... Several CAD applications require a surface model of an object consisting of a mesh of triangular facets. In this paper, a new algorithm for triangulation of trimmed surfaces is presented. The algorithm generates a triangulation that approximates the initial surface within a predefined tolerance. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Several CAD applications require a surface model of an object consisting of a mesh of triangular facets. In this paper, a new algorithm for triangulation of trimmed surfaces is presented. The algorithm generates a triangulation that approximates the initial surface within a predefined tolerance
Quality Improvement of Surface Triangulations Using
"... A procedure has been developed for improvement of surface triangulation quality by node repositioning as directed by a twostage nonlinear optimization technique. The surface mesh modi cation procedure is designed so that the quality of the triangles is improved without drastically distorting the ..."
Abstract
 Add to MetaCart
A procedure has been developed for improvement of surface triangulation quality by node repositioning as directed by a twostage nonlinear optimization technique. The surface mesh modi cation procedure is designed so that the quality of the triangles is improved without drastically distorting
Adaptive Surface Triangulations for 3D Process Simulation
"... We present an enhanced smoothing algorithm in order to minimize the number of nodes in a surface triangulation while at the same time the wafer topography is maintained, and changes of geometry are limited to userdefined tolerances. Refined criteria for the protection of nodes and edges which hav ..."
Abstract
 Add to MetaCart
We present an enhanced smoothing algorithm in order to minimize the number of nodes in a surface triangulation while at the same time the wafer topography is maintained, and changes of geometry are limited to userdefined tolerances. Refined criteria for the protection of nodes and edges which
A Parallel Algorithm For Surface Triangulation
"... In many scientific fields, three dimensional surfaces must be reconstructed from a given collection of its surface points. Applications for surface reconstruction exist in medical research and diagnosis as well as in design intensive disciplines. Fuchs, Kedem, and Uselton and Keppel show that surf ..."
Abstract
 Add to MetaCart
that surface reconstruction via triangulation can be reduced to the problem of finding a path in a toroidal graph. This paper presents a parallel algorithm to find the minimum cost acceptable path in an m by n toroidal graph. We then show an implementation of the parallel algorithm on a parallel
Results 1  10
of
68,828