Triangles in space or building (and analyzing) castles in the air
- 1 June 1990
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 10 (2) , 137-173
- https://doi.org/10.1007/bf02123007
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- The complexity and construction of many faces in arrangements of lines and of segmentsDiscrete & Computational Geometry, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988
- Planar realizations of nonlinear davenport-schinzel sequences by segmentsDiscrete & Computational Geometry, 1988
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- On the maximal number of edges of many faces in an arrangementJournal of Combinatorial Theory, Series A, 1986