Computing half-plane and strip discrepancy of planar point sets

DOI10.1016/0925-7721(95)00010-0zbMath0849.68122OpenAlexW2123801311MaRDI QIDQ1917044

Mark T. de Berg

Publication date: 14 July 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17087

zbMATH Keywords

computer graphicshalf-plane discrepancy

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Constructing Arrangements of Lines and Hyperplanes with Applications

This page was built for publication: Computing half-plane and strip discrepancy of planar point sets