Sciweavers

4761 search results - page 203 / 953
» Generalizing Boundary Points
Sort
View
CAGD
2008
99views more  CAGD 2008»
15 years 4 months ago
Topology and arrangement computation of semi-algebraic planar curves
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
Lionel Alberti, Bernard Mourrain, Julien Wintz
CGF
2000
155views more  CGF 2000»
15 years 3 months ago
Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
M. Gopi, Shankar Krishnan, Cláudio T. Silva
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 3 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
DAC
2004
ACM
16 years 4 months ago
Sparse transformations and preconditioners for hierarchical 3-D capacitance extraction with multiple dielectrics
Capacitance extraction is an important problem that has been extensively studied. This paper presents a significant improvement for the fast multipole accelerated boundary element...
Shu Yan, Vivek Sarin, Weiping Shi
149
Voted
PG
2007
IEEE
15 years 10 months ago
Explicit Control of Vector Field Based Shape Deformations
Vector Field Based Shape Deformations (VFSD) have been introduced as an efficient method to deform shapes in a volume-preserving foldover-free manner. However, mainly simple impl...
Wolfram von Funck, Holger Theisel, Hans-Peter Seid...