We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complexity is O(
In this paper we study several instances of the problem of determining the maximum number of topolog...
Let F be a collection of n bivariate algebraic functions of constant maximum degree. We show that th...
There are many problems in computational geometry for which the best know algorithms take time (n2) ...
We obtain near-quadratic upper bounds on the maximum combinatorial complexity of a single cell in ce...
We show that the complexity of the vertical decomposition of an arrangement of n fixeddegree algebra...
We consider the problem of bounding the complexity of the k-th level in an arrange-ment of n curves ...
We prove that, for any constant ¿>0, the complexity of the vertical decomposition of a set ofn tr...
AbstractA set of m planes dissects E3 into cells, facets, edges and vertices. Letting deg(c) be the ...
We consider the problem of bounding the complexity of the k-th level in an arrangement of n curves o...
Abstract. We present a simple but powerful new probabilistic technique for analyzing the combinatori...
We derive improved bounds on the complexity of many cells in arrangements of hyperplanes in higher d...
We consider an arrangement A of n hyperplanes in Rd and the zone Z in A of the boundary of an arbitr...
We obtain a near-tight bound of O(n 3+ε), for any ε> 0, on the complexity of the overlay of the m...
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...
We consider the problem of bounding the complexity of the k-th level in an arrange-ment of n curves ...
In this paper we study several instances of the problem of determining the maximum number of topolog...
Let F be a collection of n bivariate algebraic functions of constant maximum degree. We show that th...
There are many problems in computational geometry for which the best know algorithms take time (n2) ...
We obtain near-quadratic upper bounds on the maximum combinatorial complexity of a single cell in ce...
We show that the complexity of the vertical decomposition of an arrangement of n fixeddegree algebra...
We consider the problem of bounding the complexity of the k-th level in an arrange-ment of n curves ...
We prove that, for any constant ¿>0, the complexity of the vertical decomposition of a set ofn tr...
AbstractA set of m planes dissects E3 into cells, facets, edges and vertices. Letting deg(c) be the ...
We consider the problem of bounding the complexity of the k-th level in an arrangement of n curves o...
Abstract. We present a simple but powerful new probabilistic technique for analyzing the combinatori...
We derive improved bounds on the complexity of many cells in arrangements of hyperplanes in higher d...
We consider an arrangement A of n hyperplanes in Rd and the zone Z in A of the boundary of an arbitr...
We obtain a near-tight bound of O(n 3+ε), for any ε> 0, on the complexity of the overlay of the m...
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...
We consider the problem of bounding the complexity of the k-th level in an arrange-ment of n curves ...
In this paper we study several instances of the problem of determining the maximum number of topolog...
Let F be a collection of n bivariate algebraic functions of constant maximum degree. We show that th...
There are many problems in computational geometry for which the best know algorithms take time (n2) ...
DOI
Add to ORKG