CCCG
2010
13 years 6 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
FOCS
1992
IEEE
13 years 8 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
WADS
2005
Springer
13 years 10 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
ICTAI
2006
IEEE
13 years 10 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
HPCC
2007
Springer
13 years 10 months ago
2007
Springer
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...