229 search results - page 3 / 46 » On the Number of Arrangements of Pseudolines |
ENDM
2008
13 years 5 months ago
2008
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
COCOON
2010
Springer
13 years 10 months ago
2010
Springer
The main purpose of this paper is to introduce the idea of tatami tilings, and to present some of the many interesting and fun questions that arise when studying them. Roughly spea...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
PRICAI
2004
Springer
13 years 10 months ago
2004
Springer
Multi-document summarization is a challenge to information overload problem to provide a condensed text for a number of documents. Most multi-document summarization systems make u...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...