z-logo
open-access-imgOpen Access
Curve-sensitive cuttings
Author(s) -
Vladlen Koltun,
Micha Sharir
Publication year - 2003
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
ISBN - 1-58113-663-3
DOI - 10.1145/777792.777814
Subject(s) - cutting , upper and lower bounds , constant (computer programming) , mathematics , space (punctuation) , set (abstract data type) , combinatorics , computational geometry , geometry , mathematical analysis , computer science , botany , biology , programming language , operating system
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R 3 of constant description complexity, and let C be a set of m curves in R 3 of constant description complexity. Let 1= r = min{ m,n } be a given parameter. We show the existence of a (1/ r )-cutting ? of S of size O ( r 3+e ), for any e > 0 , such that the number of crossings between the curves of C and the cells of ? is O ( m 1+e ). The latter bound improves, by roughly a factor of r , the bound that can be obtained for cuttings based on vertical decompositions.We view curve-sensitive cuttings as a powerful tool that is potentially useful in various scenarios that involve curves and surfaces in three dimensions. As a preliminary application, we use the construction to obtain a bound of O ( m 1/2+e n 2+e ), for any e > 0 , on the complexity of the multiple zone of m curves in the arrangement of n surfaces in 3-space

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom