4850 search results - page 274 / 970 » Proof and Computation in Geometry |
167
click to vote
COMPGEOM
1996
ACM
15 years 10 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...
181
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
205
click to vote
COMPGEOM
1991
ACM
15 years 10 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
178
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
164
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...