封面图片

Approximating extent measures of points.

We present a general technique for approximating various descriptors of the extent of a set P of n points in Rd when the dimension d is an arbitrary fixed constant. For a given extent measure μ and a parameter ϵ > 0, it computes in time O(n + 1/ϵO(1)) a subset Q ⊆ P of size 1/...

全面介绍

书目详细资料
发表在:Journal of the ACM 51, 4 (2004).
主要作者: Agarwal, Pankaj K.
格式: 文件
语言:英语
主题:
Theory of computation.
Analysis of algorithms and problem complexity.
Nonnumerical algorithms and problems.
Geometrical problems and computations.
Mathematics of computing.
Discrete mathematics.
Combinatorics.
Computing methodologies.
Computer graphics.
Computational geometry and object modeling.
Algorithms.
Theory.