Sciweavers

525 search results - page 38 / 105
» Bidimensionality and geometric graphs
Sort
View
PG
1997
IEEE
14 years 1 months ago
3D geometric metamorphosis based on harmonic map
Recently, animations with deforming objects are frequently used in various Computer Graphics applications. Metamorphosis (or morphing) of three dimensional objects is one of techn...
Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura
FOCS
2006
IEEE
14 years 2 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 1 months ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
JMLR
2006
186views more  JMLR 2006»
13 years 8 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
GD
2006
Springer
14 years 14 days ago
The Number of Triangulations on Planar Point Sets
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n
Emo Welzl