74 search results - page 5 / 15 » Trapezoid Graphs and Generalizations, Geometry and Algorithm... |
PAMI
2006
13 years 6 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
COMPGEOM
2008
ACM
13 years 8 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
COMPGEOM
2004
ACM
14 years 4 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...