volume 29, issue 1, P41-59 2002
DOI: 10.1007/s00454-002-2799-z
View full text
|
|
Share

Abstract: The problem of bounding the combinatorial complexity of a single connected component (a single cell) of the complement of a set of n geometric objects in R k , each object of constant description complexity, is an important problem in computational geometry which has attracted much attention over the past decade. It has been conjectured that the combinatorial complexity of a single cell is bounded by a function much closer to O(n k−1 ) rather than O(n k ) which is the bound for the combinatorial complexity of…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
7
0

Publication Types

Select...

Relationship

0
0

Authors

Journals