Good splitters for counting points in triangles

DOI10.1016/0196-6774(92)90021-4MaRDI QIDQ3990611zbMATH OpenOpenAlexWikidataFDO

Authors Jiří Matoušek, Emo Welzl

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90021-4

zbMATH Keywords

halfplane counting problemtriangle counting problem

Mathematics Subject Classification ID

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

Recommendations

• On a triangle counting problem
• Triangulating point sets in space
• On counting pairs of intersecting segments and off-line triangle range searching
• Counting and representing intersections among triangles in three dimensions
• Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number

Cited in

(11)

• A bipartite analogue of Dilworth's theorem for multiple partial orders
• Two segment classes with Hamiltonian visibility graphs
• Higher-order Erdős-Szekeres theorems
• Ramsey-type results for semi-algebraic relations
• Selection in monotone matrices and computing k th nearest neighbors
• A note on a Ramsey-type problem for sequences
• A fast algorithm for computing a longest common increasing subsequence
• A bipartite analogue of Dilworth's theorem
• Semi-algebraic Ramsey numbers
• On a triangle counting problem
• Partitioning arrangements of lines. II: Applications

This page was built for publication: Good splitters for counting points in triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990611)