Add to ORKGCombinatorial bounds for single faces in arrangements of pseudo-segments and chords in polygon
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudo-segmen...
Abstract. In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an in...
In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an intersection...
Arrangements of lines and pseudolines are important and appealing objects for research in discrete a...
AbstractGrünbaum has conjectured that any arrangement ofnpseudolines in the real projective plane ha...
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n ha...
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with fixed ve...
AbstractWe define general Laman (count) conditions for edges and faces of polygonal partitions in th...
International audienceArrangements are an omni-present topic in computational geometry, since many p...
AbstractLet P be a set of polygonal pseudodiscs in the plane with n edges in total translating with ...
A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of ...
AbstractGiven a set of n points in general position in the plane, where n is even, a halving line is...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudo-segmen...
Abstract. In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an in...
In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an intersection...
Arrangements of lines and pseudolines are important and appealing objects for research in discrete a...
AbstractGrünbaum has conjectured that any arrangement ofnpseudolines in the real projective plane ha...
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n ha...
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with fixed ve...
AbstractWe define general Laman (count) conditions for edges and faces of polygonal partitions in th...
International audienceArrangements are an omni-present topic in computational geometry, since many p...
AbstractLet P be a set of polygonal pseudodiscs in the plane with n edges in total translating with ...
A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of ...
AbstractGiven a set of n points in general position in the plane, where n is even, a halving line is...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...
A collection of simple closed Jordan curves in the plane is called a family of pseudo-circles if any...