On the complexity of halfspace area queries

DOI10.1007/S00454-003-2856-2MaRDI QIDQ1422232zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the complexity of halfspace area queries
• scientific article; zbMATH DE number 1786508
• Polygon queries for convex hulls of points
• The power of geometric duality
• An optimal online algorithm for halfplane intersection

Cited in

(6)

• Dynamic ham-sandwich cuts in the plane
• Computing Shapley values in the plane
• scientific article; zbMATH DE number 1786508 (Why is no real title available?)
• On the complexity of halfspace area queries
• Area-preserving approximations of polygonal paths
• scientific article; zbMATH DE number 7559220 (Why is no real title available?)

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

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