Sciweavers

221 search results - page 8 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
FCT
2005
Springer
14 years 1 months ago
Adaptive Zooming in Point Set Labeling
A set of points shown on the map usually represents special sites like cities or towns in a country. If the map in the interactive geographical information system (GIS) is browsed ...
Sheung-Hung Poon, Chan-Su Shin
COMPGEOM
2009
ACM
14 years 2 months ago
On the set multi-cover problem in geometric settings
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...
DCG
2010
104views more  DCG 2010»
13 years 5 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 7 months ago
Principal Graphs and Manifolds
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
Alexander N. Gorban, Andrei Yu. Zinovyev
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 9 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz