947 search results - page 53 / 190 » Discrete Geometry |
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set in the plane is related to other facts on halving triangles in 3-space and to a ...
JCDCG
2000
Springer
15 years 1 months ago
2000
Springer
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a multi-dimensional generalization of the Szemer´edi-Trotter Theorem, and give a sharp bound on the number of incidences of points and not-too-degenerate hyperplanes i...