Counting triangle crossings and halving planes

DOI10.1007/BF02574381zbMath0819.68135MaRDI QIDQ1338957

Tamal Krishna Dey, Herbert Edelsbrunner

Publication date: 27 November 1994

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131332

zbMATH Keywords

triangle crossings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Dynamic half-space range reporting and its applications ⋮ Stabbing simplices by points and flats ⋮ Cutting dense point sets in half ⋮ PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS ⋮ On geometric optimization with few violated constraints ⋮ On the number of simplicial complexes in \(\mathbb{R}^ d\) ⋮ On Codimension One Embedding of Simplicial Complexes ⋮ Representing graphs and hypergraphs by touching polygons in 3D ⋮ On levels in arrangements of surfaces in three dimensions ⋮ On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space ⋮ Cutting a bunch of grapes by a plane ⋮ On the complexity of the \(k\)-level in arrangements of pseudoplanes ⋮ Unnamed Item ⋮ Crossing-free segments and triangles in point configurations ⋮ Eppstein's bound on intersecting triangles revisited ⋮ Median hyperplanes in normed spaces -- a survey ⋮ On counting triangulations in \(d\) dimensions

Cites Work

• Points and triangles in the plane and halving planes in space
• The colored Tverberg's problem and complexes of injective functions
• Improved bounds for intersecting triangles and halving planes
• On the number of halving planes
• Crossing-Free Subgraphs
• Point Selections and Weak ε-Nets for Convex Hulls
• Unnamed Item
• Unnamed Item