Sciweavers

84 search results - page 4 / 17
» Connected Rectilinear Graphs on Point Sets
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 4 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
TVCG
2012
184views Hardware» more  TVCG 2012»
11 years 9 months ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan
JMLR
2011
133views more  JMLR 2011»
13 years 2 months ago
Operator Norm Convergence of Spectral Clustering on Level Sets
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
Bruno Pelletier, Pierre Pudlo
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 2 months ago
Lower bounds on the obstacle number of graphs
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
Padmini Mukkamala, János Pach, Döm&oum...
SIAMDM
2008
90views more  SIAMDM 2008»
13 years 7 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen