Title
The complexity of point configurations
Abstract
There are several natural ways to extend the notion of the order of points on a line to higher dimensions. This article focuses on three of them—combinatorial type, order type, and isotopy class—and surveys work done in recent years on the efficient encoding of order types and on complexity questions relating to all three classifications.
Year
DOI
Venue
1991
10.1016/0166-218X(91)90068-8
Discrete Applied Mathematics
Keywords
Field
DocType
point configuration
Discrete geometry,Order type,Isotopy,Mathematics,Calculus,Encoding (memory)
Journal
Volume
Issue
ISSN
31
2
Discrete Applied Mathematics
Citations 
PageRank 
References 
10
1.23
18
Authors
2
Name
Order
Citations
PageRank
Jacob E. Goodman1277136.42
Richard Pollack2912203.75