Sciweavers

691 search results - page 76 / 139
» Axiomatizing geometric constructions
Sort
View
CGF
2008
153views more  CGF 2008»
13 years 7 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
EWC
2006
114views more  EWC 2006»
13 years 7 months ago
Automated symmetry exploitation in engineering analysis
In engineering analysis, geometric symmetry, when exploited, has two potential benefits: (1) it can significantly reduce the computational time, and (2) it can simultaneously impr...
Krishnan Suresh, Ameya Sirpotdar
TEC
2008
139views more  TEC 2008»
13 years 7 months ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
Andras Sobester, Prasanth B. Nair, Andy J. Keane
VC
2008
102views more  VC 2008»
13 years 7 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
TIP
2010
166views more  TIP 2010»
13 years 6 months ago
Blurred Image Recognition by Legendre Moment Invariants
—Processing blurred images is a key problem in many image applications. Existing methods to obtain blur invariants which are invariant with respect to centrally symmetric blur ar...
Hui Zhang, Huazhong Shu, Guo-Niu Han, Gouenou Coat...