Constructing Arrangements of Lines and Hyperplanes with Applications
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2), 341-363
- https://doi.org/10.1137/0215024
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Constructing Belts in Two-Dimensional Arrangements with ApplicationsSIAM Journal on Computing, 1986
- On the number of line separations of a finite set in the planeJournal of Combinatorial Theory, Series A, 1985
- How to search in historyLecture Notes in Computer Science, 1983
- Stabbing line segmentsBIT Numerical Mathematics, 1982
- Ein rekursiver Gleitebenen-Algorithmus für die Bestimmung aller Zellen einer endlichen Teilung des RdComputing, 1982
- Three points do not determine a (pseudo-) planeJournal of Combinatorial Theory, Series A, 1981
- Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolinesJournal of Combinatorial Theory, Series A, 1980
- Simple Partitions of SpaceMathematics Magazine, 1978
- Dissection Graphs of Planar Point SetsPublished by Elsevier ,1973