Add to ORKGWe show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing n-path for A in O(n log n) time and an algorithm that constructs an inducing n-gon for a special class of line arrangements within the same time bound
We present several variants of a new randomized incremental algorithm for computing a cutting in an ...
In this report, an algorithm for finding a transversal for given segments is proposed. The algorithm...
We discuss certain open problems in the context of arrangements of lines in the plane
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of...
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of...
In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like ...
Article dans revue scientifique avec comité de lecture.An arrangement graph G is the abstract graph ...
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a ...
Abstract We estimate the minimum length of a longest monotone path in an arrangement of n lines, whe...
In this report, an algorithm for finding a transversal for given segments is proposed. The algorithm...
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or p...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or p...
We present randomized algorithms for computing many faces in an arrangement of lines or of segments ...
Arrangement of lines is the subdivision of a plane by a finite set of lines. Arrangement is an impor...
We present several variants of a new randomized incremental algorithm for computing a cutting in an ...
In this report, an algorithm for finding a transversal for given segments is proposed. The algorithm...
We discuss certain open problems in the context of arrangements of lines in the plane
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of...
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of...
In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like ...
Article dans revue scientifique avec comité de lecture.An arrangement graph G is the abstract graph ...
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a ...
Abstract We estimate the minimum length of a longest monotone path in an arrangement of n lines, whe...
In this report, an algorithm for finding a transversal for given segments is proposed. The algorithm...
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or p...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or p...
We present randomized algorithms for computing many faces in an arrangement of lines or of segments ...
Arrangement of lines is the subdivision of a plane by a finite set of lines. Arrangement is an impor...
We present several variants of a new randomized incremental algorithm for computing a cutting in an ...
In this report, an algorithm for finding a transversal for given segments is proposed. The algorithm...
We discuss certain open problems in the context of arrangements of lines in the plane