Abstract
Let Σ be a collection of n algebraic surface patches of constant maximum degree in R3. We show that the combinatorial complexity of the vertical decomposition of a single cell in the arrangement A(Σ) is O(n2+ε), for any ε > 0, where the constant of proportionality depends on ε and on the maximum degree of the surfaces and of their boundaries. As an application, we obtain a near-quadratic motion planning algorithm for general systems with three degrees of freedom.
Original language | English |
---|---|
Pages | 20-29 |
Number of pages | 10 |
DOIs | |
State | Published - 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA Duration: 24 May 1996 → 26 May 1996 |
Conference
Conference | Proceedings of the 1996 12th Annual Symposium on Computational Geometry |
---|---|
City | Philadelphia, PA, USA |
Period | 24/05/96 → 26/05/96 |