On the complexity of halfspace area queries

DOI10.1007/S00454-003-2856-2zbMATH Open1036.68115OpenAlexW1986165519MaRDI QIDQ1422232FDOQ1422232

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Dynamic ham-sandwich cuts in the plane
• Computing Shapley values in the plane
• Title not available (Why is that?)
• Area-preserving approximations of polygonal paths
• Title not available (Why is that?)

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)