THE COMPLEXITY OF POINT CONFIGURATIONS

被引：19

作者：

GOODMAN, JE ^{[1
]}

POLLACK, R ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

来源：

DISCRETE APPLIED MATHEMATICS | 1991年 / 31卷 / 02期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0166-218X(91)90068-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：167 / 180

页数：14

共 44 条

[1] THE NUMBER OF POLYTOPES, CONFIGURATIONS AND REAL MATROIDS [J].