The number of extreme pairs of finite point-sets in Euclidean spaces
From MaRDI portal
Publication:1087828
DOI10.1016/0097-3165(86)90075-0zbMATH Open0611.51002OpenAlexW1984350972MaRDI QIDQ1087828FDOQ1087828
Herbert Edelsbrunner, Gerd Stöckl
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(86)90075-0
Recommendations
Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Configuration theorems in linear incidence geometry (51A20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- On the combinatorial classification of nondegenerate configurations in the plane
- On the number of line separations of a finite set in the plane
- The number of small semispaces of a finite set of points in the plane
Cited In (7)
- The number of extreme triples of a planar point set
- A combinatorial result about points and balls in Euclidean space
- Point sets with many \(k\)-sets
- More on k-sets of finite sets in the plane
- On stable line segments in all triangulations of a planar point set
- Title not available (Why is that?)
- The number of small semispaces of a finite set of points in the plane
This page was built for publication: The number of extreme pairs of finite point-sets in Euclidean spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087828)