Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Computational geometry
Computer vision
Motion planning
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
On the Pseudolinear Crossing Number
César Hernández-Vélez
,
J. Leaños
,
G. Salazar
Journal of Graph Theory
2014
Corpus ID: 14250119
A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of…
Expand
2012
2012
Some Results Related to a Conjecture of Dirac's
Ben D. Lund
,
G. Purdy
,
Justin W. Smith
arXiv.org
2012
Corpus ID: 17323019
We demonstrate an innite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to…
Expand
2012
2012
Pseudoline arrangements and the Inverse Boundary Value Problem in Nonlinear Electrical Networks
Will Johnson
2012
Corpus ID: 14777584
We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic…
Expand
2010
2010
Segment Orders
C. Biró
,
W. T. Trotter
Discrete & Computational Geometry
2010
Corpus ID: 5916403
We study two kinds of segment orders, using definitions first proposed by Farhad Shahrokhi. Although the two kinds of segment…
Expand
2008
2008
The best polynomial bounds for the number of triangles in a simple arrangement of n pseudo-lines
J. Blanc
2008
Corpus ID: 115161682
It is well-known and easy to observe that affine (respectively projective) simple arrangement of n pseudo-lines may have at most…
Expand
2003
2003
Extremal Configurations and Levels in Pseudoline Arrangements
M. Sharir
,
Shakhar Smorodinsky
Workshop on Algorithms and Data Structures
2003
Corpus ID: 19025624
This paper studies a variety of problems involving certain types of extreme configurations in arrangements of (x-monotone) pseudo…
Expand
2001
2001
On reconstructing arrangements from their sets of simplices
David Forge
,
J. R. Alfonsín
Discrete Mathematics
2001
Corpus ID: 7660795
1997
1997
Cell Decompositions of the Projective Plane with Petrie Polygons of Constant Length
J. Bokowski
,
Jean-Pierre Roudneff
,
Torsten K. Strempel
Discrete & Computational Geometry
1997
Corpus ID: 2810862
Abstract. We study dual pairs of combinatorial face-to-face cell decompositions $({\cal D}_{P^2},{\cal D}^*_{P^2})$ of the real…
Expand
1994
1994
On Recent Progress in Computational Synthetic Geometry
J. Bokowski
1994
Corpus ID: 123143232
Computational Synthetic Geometry deals with methods for realizing abstract geometric objects in concrete vector spaces. A general…
Expand
1993
1993
Representation of Data by Pseudoline Arrangements
W. Kollewe
1993
Corpus ID: 117236701
Formal contexts are under certain conditions representable by oriented pseudoline arrangements. Oriented pseudoline arrangements…
Expand
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)
ACCEPT & CONTINUE