23 search results - page 3 / 5 » On Line Arrangements in the Hyperbolic Plane |
101
click to vote
COMPGEOM
1994
ACM
15 years 3 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
FOCS
1999
IEEE
15 years 4 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...
COMPGEOM
1991
ACM
15 years 3 months ago
1991
ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
108
click to vote
DATE
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, different circuit arrangements of Quantumdot Cellular Automata (QCA) are proposed for the so-called coplanar crossing. These arrangements exploit the majority votin...
MICS
2010
14 years 10 months ago
2010
We introduce a framework for the construction, maintenance, and manipulation of arrangements of curves embedded on certain two-dimensional orientable parametric surfaces in three-d...