Add to ORKGLet A(Γ) be the arrangement induced by a set Γ of n unbounded Jordan curves in the plane that intersect each other in at most two points. The upper bound for constructing those arrangements by an incremental method is, up to now, O(nλ4(n)). In this paper we improve this bound to O(nλ3(n)).Ministerio de Ciencia y Tecnologí
We give simple randomized incremental algorithms for computing the ≤κ-level in an arrangement of n l...
An arrangement of pseudocircles is a finite collection of Jordan curves in the plane with the additi...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...
AbstractArrangements of curves in the plane are fundamental to many problems in computational and co...
We discuss certain open problems in the context of arrangements of lines in the plane
AbstractWe prove the following two conjectures of Grünbaum on arrangements of curves in the Euclidea...
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more ...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
A long standing conjecture of Richter and Thomassen states that the total number of intersection poi...
A long-standing conjecture of Richter and Thomassen states that the total number of intersection poi...
Abstract. In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an in...
New bounds on curve tangencies and orthogonalities, Discrete Analysis 2016:18, 22 pp. An important ...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
AbstractThis paper presents a variety of formulas for the number of cells, faces, and edges, bounded...
We give simple randomized incremental algorithms for computing the Amk-level in an arrangement of n ...
We give simple randomized incremental algorithms for computing the ≤κ-level in an arrangement of n l...
An arrangement of pseudocircles is a finite collection of Jordan curves in the plane with the additi...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...
AbstractArrangements of curves in the plane are fundamental to many problems in computational and co...
We discuss certain open problems in the context of arrangements of lines in the plane
AbstractWe prove the following two conjectures of Grünbaum on arrangements of curves in the Euclidea...
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more ...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
A long standing conjecture of Richter and Thomassen states that the total number of intersection poi...
A long-standing conjecture of Richter and Thomassen states that the total number of intersection poi...
Abstract. In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an in...
New bounds on curve tangencies and orthogonalities, Discrete Analysis 2016:18, 22 pp. An important ...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
AbstractThis paper presents a variety of formulas for the number of cells, faces, and edges, bounded...
We give simple randomized incremental algorithms for computing the Amk-level in an arrangement of n ...
We give simple randomized incremental algorithms for computing the ≤κ-level in an arrangement of n l...
An arrangement of pseudocircles is a finite collection of Jordan curves in the plane with the additi...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...