Good splitters for counting points in triangles

DOI10.1016/0196-6774(92)90021-4zbMath0767.68095OpenAlexW2020757245WikidataQ54309687 ScholiaQ54309687MaRDI QIDQ3990611

Ji{ří} Matoušek, Ermo 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)

Related Items (10)

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

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