Pages that link to "Item:Q1338957"
From MaRDI portal
The following pages link to Counting triangle crossings and halving planes (Q1338957):
Displaying 18 items.
- On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
- Stabbing simplices by points and flats (Q848667) (← links)
- Eppstein's bound on intersecting triangles revisited (Q1003657) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- On counting triangulations in \(d\) dimensions (Q1314531) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- On the number of simplicial complexes in \(\mathbb{R}^ d\) (Q1370935) (← links)
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space (Q1745202) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- On Codimension One Embedding of Simplicial Complexes (Q4604375) (← links)
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS (Q4818568) (← links)
- (Q5088995) (← links)
- Cutting a bunch of grapes by a plane (Q5946642) (← links)
- Crossing-free segments and triangles in point configurations (Q5954240) (← links)
- Extremal problems for geometric hypergraphs (Q6487430) (← links)
