Results 1 - 10
of
1,504
MULTIGRID METHODS FOR DISCRETE ELLIPTIC PROBLEMS ON TRIANGULAR SURFACES
"... Abstract. We construct and analyze multigrid methods for discretized selfadjoint elliptic problems on triangular surfaces in R 3. The methods involve the same weights for restriction and prolongation as in the case of planar triangulations and therefore are easy to implement. We prove logarithmic bo ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. We construct and analyze multigrid methods for discretized selfadjoint elliptic problems on triangular surfaces in R 3. The methods involve the same weights for restriction and prolongation as in the case of planar triangulations and therefore are easy to implement. We prove logarithmic
On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches
- Department of Computer and Information Science, University of Pennsylvania
, 1999
"... . In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivision in four calls to the standard de Casteljau algorithm (in its subdivision version). A naive version uses twelve calls ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivision in four calls to the standard de Casteljau algorithm (in its subdivision version). A naive version uses twelve
On the efficiency of strategies for subdividing polynomial triangular surface patches
, 1997
"... Abstract. In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivision in four calls to the standard de Casteljau algorithm (in its subdivision version). A naive version uses twel ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivision in four calls to the standard de Casteljau algorithm (in its subdivision version). A naive version uses
Triangular Surface Tiling Groups for Low Genus
, 2001
"... Consider a surface, S, with a kaleidoscopic tiling by non-obtuse triangles (tiles), i.e., each local reflection in a side of a triangle extends to an isometry of the surface, preserving the tiling. The tiling is geodesic if the side of each triangle extends to a closed geodesic on the surface consis ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Consider a surface, S, with a kaleidoscopic tiling by non-obtuse triangles (tiles), i.e., each local reflection in a side of a triangle extends to an isometry of the surface, preserving the tiling. The tiling is geodesic if the side of each triangle extends to a closed geodesic on the surface
Wavelets for Multi-resolution Analysis of Triangular Surface Meshes
, 2000
"... The application of Wavelets to the Multi-resolution Analysis of surfaces provides an elegant, mathematically rigorous framework for the implementation of subdivision surfaces. We present a method similar to [Lou95] for multiresolution analysis of surfaces with subdivision connectivity. However, due ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
The application of Wavelets to the Multi-resolution Analysis of surfaces provides an elegant, mathematically rigorous framework for the implementation of subdivision surfaces. We present a method similar to [Lou95] for multiresolution analysis of surfaces with subdivision connectivity. However, due
Bezier curves approximation of triangularized surfaces using SVG
- in Proceedings of the SPIE Electronic Imaging
, 2006
"... This paper presents a technique to convert surfaces, obtained through a Data Dependent Triangulation, in Bezier Curves by using a Scalable Vector Graphics File format. The method starts from a Data Dependent Triangulation, traces a map of the boundaries present into the triangulation, using the char ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper presents a technique to convert surfaces, obtained through a Data Dependent Triangulation, in Bezier Curves by using a Scalable Vector Graphics File format. The method starts from a Data Dependent Triangulation, traces a map of the boundaries present into the triangulation, using
Efficient triangular surface approximation using wavelets and quadtree data structures
- IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 1996
"... We present a new method for adaptive surface meshing and triangulation which controls the local level-of-detail of the surface approximation by local spectral estimates. These estimates are determined by a wavelet representation of the surface data. The basic idea is to decompose the initial data se ..."
Abstract
-
Cited by 65 (6 self)
- Add to MetaCart
We present a new method for adaptive surface meshing and triangulation which controls the local level-of-detail of the surface approximation by local spectral estimates. These estimates are determined by a wavelet representation of the surface data. The basic idea is to decompose the initial data
Real-time Head Pose and Facial Landmark Estimation from Depth Images Using Triangular Surface Patch Features
, 2015
"... Real-time head pose estimation and facial feature localization using a depth sensor and triangular surface patch features ..."
Abstract
- Add to MetaCart
Real-time head pose estimation and facial feature localization using a depth sensor and triangular surface patch features
Convergent Discrete Laplace-Beltrami Operators over Triangular Surfaces
- Institute of Computational Mathematics, Chinese Academy of Sciences
, 2004
"... The convergence property of the discrete Laplace-Beltrami operators is the foundation of convergence analysis of the numerical simulation process of some geometric partial differential equations which involve the operator. In this paper we propose several simple discretization schemes of Laplace-Bel ..."
Abstract
-
Cited by 43 (9 self)
- Add to MetaCart
-Beltrami operators over triangulated surfaces. Convergence results for these discrete Laplace-Beltrami operators are established under various conditions. Numerical results that support the theoretical analysis are given. Application examples of the proposed discrete Laplace-Beltrami operators in surface processing
P.: Minimizing the multiview stereo reprojection error for triangular surface meshes
- In: British Machine Vision Conference. (2008
"... This article proposes a variational multi-view stereo vision method based on meshes for recovering 3D scenes (shape and radiance) from images. Our method is based on generative models and minimizes the reprojection error (difference between the observed images and the images synthesized from the rec ..."
Abstract
-
Cited by 16 (4 self)
- Add to MetaCart
the reconstruction). Our contributions are twofold. 1) For the first time, we rigor-ously compute the gradient of the reprojection error for non smooth surfaces defined by discrete triangular meshes. The gradient correctly takes into ac-count the visibility changes that occur when a surface moves; this forces
Results 1 - 10
of
1,504