On the complexity of halfspace area queries

DOI10.1007/s00454-003-2856-2zbMath1036.68115OpenAlexW1986165519MaRDI QIDQ1422232

Stefan Langermann

Publication date: 5 February 2004

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

Full work available at URL: https://doi.org/10.1007/s00454-003-2856-2

Mathematics Subject Classification ID

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

Related Items (4)

Area-preserving approximations of polygonal paths ⋮ Unnamed Item ⋮ Dynamic ham-sandwich cuts in the plane ⋮ Computing Shapley values in the plane

This page was built for publication: On the complexity of halfspace area queries