AbstractWe give a deterministic algorithm for computing the diameter of an n-point set in three dimensions with O(n logcn) running time, where c is a constant
Finding the diameter of a dataset in multidimensional Euclidean space is a well-established problem,...
We present an algorithm that computes the diameter of a set of n points in the cylinder in optimal t...
Given a set of points P = {p 1 , p 2 ,..., p n } in three dimensions, the width of P, W(P), is...
We give a deterministic algorithm for computing the diameter of an n point set in three dimensions w...
AbstractWe describe an algorithm for computing the intersection of n balls of equal radius in R3 whi...
We consider the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidea...
We present a deterministic algorithm for computing the diameter of a set of $n$ points in $\Re^3$; i...
We present a deterministic algorithm for computing the diameter of a set of $n$ points in $\Re^3$; i...
AbstractWe describe an algorithm for computing the intersection of n balls of equal radius in R3 whi...
AbstractWe consider the problem of computing the diameter of a set of n points in d-dimensional Eucl...
International audienceThe diameter of a set P of n points in R-d is the maximum Euclidean distance b...
The diameter of a set P of n points in R d is the maximum Euclidean distance between any two points ...
The diameter of a set P of n points in R-d is the maximum Euclidean distance between any two points ...
The diameter of a set P of n points in RdRd is the maximum Euclidean distance between any two points...
International audienceThe diameter of a set P of n points in ℝd is the maximum Euclidean distance be...
Finding the diameter of a dataset in multidimensional Euclidean space is a well-established problem,...
We present an algorithm that computes the diameter of a set of n points in the cylinder in optimal t...
Given a set of points P = {p 1 , p 2 ,..., p n } in three dimensions, the width of P, W(P), is...
We give a deterministic algorithm for computing the diameter of an n point set in three dimensions w...
AbstractWe describe an algorithm for computing the intersection of n balls of equal radius in R3 whi...
We consider the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidea...
We present a deterministic algorithm for computing the diameter of a set of $n$ points in $\Re^3$; i...
We present a deterministic algorithm for computing the diameter of a set of $n$ points in $\Re^3$; i...
AbstractWe describe an algorithm for computing the intersection of n balls of equal radius in R3 whi...
AbstractWe consider the problem of computing the diameter of a set of n points in d-dimensional Eucl...
International audienceThe diameter of a set P of n points in R-d is the maximum Euclidean distance b...
The diameter of a set P of n points in R d is the maximum Euclidean distance between any two points ...
The diameter of a set P of n points in R-d is the maximum Euclidean distance between any two points ...
The diameter of a set P of n points in RdRd is the maximum Euclidean distance between any two points...
International audienceThe diameter of a set P of n points in ℝd is the maximum Euclidean distance be...
Finding the diameter of a dataset in multidimensional Euclidean space is a well-established problem,...
We present an algorithm that computes the diameter of a set of n points in the cylinder in optimal t...
Given a set of points P = {p 1 , p 2 ,..., p n } in three dimensions, the width of P, W(P), is...
DOI
Add to ORKG