Sciweavers

4761 search results - page 62 / 953
» Generalizing Boundary Points
Sort
View
MOC
2000
127views more  MOC 2000»
13 years 7 months ago
Can a finite element method perform arbitrarily badly?
In this paper we construct elliptic boundary value problems whose standard finite element approximations converge arbitrarily slowly in the energy norm, and show that adaptive proc...
Ivo Babuska, John E. Osborn
MOC
2010
13 years 2 months ago
On interpolation by Planar cubic G2 pythagorean-hodograph spline curves
In this paper, the geometric interpolation of planar data points and boundary tangent directions by a cubic G2 Pythagorean-hodograph (PH) spline curve is studied. It is shown, that...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Vito ...
CCCG
1996
13 years 9 months ago
Generalizing Halfspaces
Restricted-orientation convexity is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. We have studied the properties of restri...
Eugene Fink, Derick Wood
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
14 years 2 months ago
Generalized penetration depth computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
RSS
2007
134views Robotics» more  RSS 2007»
13 years 9 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha