Skip to search formSkip to main contentSkip to account menu

Arrangement (space partition)

Known as: Arrangement (disambiguation), Pseudoline 
In discrete geometry, an arrangement is the decomposition of the d-dimensional linear, affine, or projective space into connected open cells of lower… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Computational geometryComputer visionMotion planning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Subquadratic Encodings for Point Configurations
For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the… 
2018
2018
New Lower Bounds for the Number of Pseudoline Arrangements
Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other… 
2016
2016
Convex-Arc Drawings of Pseudolines
Introduction. A pseudoline is formed from a line by stretching the plane without tearing: it is the image of a line under a… 
2016
2016
On the Sylvester–Gallai and the orchard problem for pseudoline arrangements
We study a non-trivial extreme case of the orchard problem for 12 pseudolines and we provide a complete classification of… 
2007
2007
Oriented matroids and complete-graph embeddings on surfaces
2003
2003
Extremal Configurations and Levels in Pseudoline Arrangements
This paper studies a variety of problems involving certain types of extreme configurations in arrangements of (x-monotone) pseudo… 
Highly Cited
1996
Highly Cited
1996
Pseudo-triangulations: theory and applications
Pseudotriangles and pseudo-triangulations have played a key role in the recent design of two optimal visibility graph algorithms… 
1993
1993
Representation of Data by Pseudoline Arrangements
Formal contexts are under certain conditions representable by oriented pseudoline arrangements. Oriented pseudoline arrangements… 
1991
1991
Lower bounds on the length of monotone paths in arrangements
We show that the maximal number of turns of anx-monotone path in an arrangement ofn lines is Ω(n5/3) and the maximal number of… 
1982
1982
Helly-Type Theorems for Pseudoline Arrangements in P2
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)