On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
From MaRDI portal
Publication:3512600
DOI10.1017/S096354830700884XzbMath1143.52013arXiv0710.3810OpenAlexW2949342774MaRDI QIDQ3512600
Adrian Dumitrescu, Csaba D. Tóth
Publication date: 21 July 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.3810
Related Items
Zarankiewicz's problem for semi-algebraic hypergraphs, Extremal problems on triangle areas in two and three dimensions, Distinct Volume Subsets
Cites Work
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Extremal problems in discrete geometry
- Combinatorial complexity of convex sequences
- Improving the crossing lemma by finding more crossings in sparse graphs
- Combinatorial complexity bounds for arrangements of curves and spheres
- The power of geometric duality
- Repeated angles in the plane and related problems
- Unsolved problems in geometry
- An improved bound for joints in arrangements of lines in space
- Incidences between points and circles in three and higher dimensions
- On counting point-hyperplane incidences
- On the number of directions determined by a three-dimensional points set
- Constructing Arrangements of Lines and Hyperplanes with Applications
- On the Zone Theorem for Hyperplane Arrangements
- The Directions Determined by n Points in the Plane
- Point–Line Incidences in Space
- Distinct Distances in Three and Higher Dimensions
- Repeated Angles in Three and Four Dimensions
- On Sets of Distances of n Points
- On a problem in combinatorial geometry
- Some extremal problems in geometry
- Triangles of extremal area or perimeter in a finite planar point set
