1879 search results - page 99 / 376 » Computational geometry algorithms library |
117
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
153
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
153
click to vote
LCN
1996
IEEE
15 years 8 months ago
1996
IEEE
Development of new transport protocols or protocol algorithms suffers from the complexity of the envir onment in which they ar e intended to run. Modeling techniques attempt to av...
126
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
117
click to vote
CIARP
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of do...