Sciweavers

279 search results - page 36 / 56
» Implicit Convex Polygons
Sort
View
CAGD
2008
71views more  CAGD 2008»
13 years 7 months ago
Geometric Lagrange interpolation by planar cubic Pythagorean-hodograph curves
In this paper, the geometric Lagrange interpolation of four points by planar cubic Pythagorean-hodograph (PH) curves is studied. It is shown that such an interpolatory curve exist...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Vito ...
SI3D
2005
ACM
14 years 1 months ago
Sketching mesh deformations
Techniques for interactive deformation of unstructured polygon meshes are of fundamental importance to a host of applications. Most traditional approaches to this problem have emp...
Youngihn Kho, Michael Garland
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
NIPS
2001
13 years 9 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
FOCS
2000
IEEE
14 years 2 days ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount