37 search results - page 1 / 8 » Smallest Enclosing Cylinders |
83
Voted
COMPGEOM
1996
ACM
15 years 1 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
65
Voted
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
101
click to vote
CCCG
2006
14 years 11 months ago
2006
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
CCCG
2008
14 years 11 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
CCCG
2007
14 years 11 months ago
2007
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...