Computer Science – Computational Geometry
Scientific paper
1999-07-16
Computer Science
Computational Geometry
5 pages, 5 figures
Scientific paper
We provide a lower bound construction showing that the union of unit balls in
three-dimensional space has quadratic complexity, even if they all contain the
origin. This settles a conjecture of Sharir.
Bronnimann Herve
Devillers Olivier
No associations
LandOfFree
The union of unit balls has quadratic complexity, even if they all contain the origin does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The union of unit balls has quadratic complexity, even if they all contain the origin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The union of unit balls has quadratic complexity, even if they all contain the origin will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-162633