Results 11  20
of
3,576
Budget Sampling of Parametric Surface Patches
"... We investigate choosing point samples on a model comprising parametric patches to meet a user specified budget. These samples may then be triangulated, rendered as points or raytraced. The main idea is to precompute a set of samples on the surface and at the rendering time, use a subset that meets ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate choosing point samples on a model comprising parametric patches to meet a user specified budget. These samples may then be triangulated, rendered as points or raytraced. The main idea is to precompute a set of samples on the surface and at the rendering time, use a subset
Compact Representation of Protein Surface Patches
"... Prediction of protein structure from amino acid (AA) sequence is one of the grand challenges of modern biochemistry. While ab initio structure prediction is difficult, prediction of local structure is more tractable if experimentally determined structures of homologous proteins exist. The prediction ..."
Abstract
 Add to MetaCart
. The prediction of local patches is useful in predicting interaction partners of proteins and nucleic acids.
Geometric constraints from planar surface patch matching
 Proceedings of the 5th Alvey Vision Conference, Reading
, 1989
"... Some three dimensional scene analysis programs pair data surface patches (i.e. as extracted from range data) to model surface patch features. From the correspondences, a variety of rotation and translation constraints of the model can be deduced, depending on the assumptions behind the correspondenc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Some three dimensional scene analysis programs pair data surface patches (i.e. as extracted from range data) to model surface patch features. From the correspondences, a variety of rotation and translation constraints of the model can be deduced, depending on the assumptions behind
PARAMETERIZATION OF FREEFORM SURFACE PATCHES
"... This document is the author deposited version. You are advised to consult the publisher's version if you wish to cite from it. ..."
Abstract
 Add to MetaCart
This document is the author deposited version. You are advised to consult the publisher's version if you wish to cite from it.
Surface Patches from Unorganized Space Curves
"... Figure 1: Our system takes as input a wireframe model produced from a 3D curve sketch, and outputs a set of curved surface patches representing the object. The output objects need not be manifold, or connected. From left to right, phoenix, roadster, spider and boat curve networks created with ILoveS ..."
Abstract
 Add to MetaCart
Figure 1: Our system takes as input a wireframe model produced from a 3D curve sketch, and outputs a set of curved surface patches representing the object. The output objects need not be manifold, or connected. From left to right, phoenix, roadster, spider and boat curve networks created with ILove
Rigorous Computation of Surface Patch Intersection Curves
, 1993
"... A rigorous and efficient algorithm is presented for computing a sequence of points on all the branches of surface patch intersection curves within a given box. In the algorithm, an interval step control continuation method makes certain that the predictor algorithm will not jump from one branch to t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A rigorous and efficient algorithm is presented for computing a sequence of points on all the branches of surface patch intersection curves within a given box. In the algorithm, an interval step control continuation method makes certain that the predictor algorithm will not jump from one branch
SuperResolved Texture Tracking of Planar Surface Patches
 In Proceedings of IEEE/RSJ International Conference on Intelligent Robotic Systems
, 1998
"... We present a novel approach to tracking planar surface patches over time. In addition to tracking a patch with full six degrees of freedom, the algorithm also produces a superresolved estimate of the texture present on the patch. This texture estimate is kept as an explicit model texture image whic ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
We present a novel approach to tracking planar surface patches over time. In addition to tracking a patch with full six degrees of freedom, the algorithm also produces a superresolved estimate of the texture present on the patch. This texture estimate is kept as an explicit model texture image
On Five and SixSided Rational Surface Patches
, 1999
"... We present a new construction of 5 and 6sided rational Sabin and Hosaka Kimura like surface patches. They are based on a well known method of algebraic geometry  blowing up base points. Corresponding 5 and 6sided patches are more efficient as produced by the methods known before. A special a ..."
Abstract
 Add to MetaCart
We present a new construction of 5 and 6sided rational Sabin and Hosaka Kimura like surface patches. They are based on a well known method of algebraic geometry  blowing up base points. Corresponding 5 and 6sided patches are more efficient as produced by the methods known before. A special
Surface patch reconstruction via curve sampling
 in Proc. IEEE Int. Conf. Robot. Autom
"... This paper introduces a method that reconstructs a surface patch by sampling along three concurrent curves on the surface with a touch sensor. These data curves, each lying in a different plane, form a “skeleton ” from which the patch is built in two phases. First, the Darboux frame at the curve int ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
This paper introduces a method that reconstructs a surface patch by sampling along three concurrent curves on the surface with a touch sensor. These data curves, each lying in a different plane, form a “skeleton ” from which the patch is built in two phases. First, the Darboux frame at the curve
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
Results 11  20
of
3,576