An optimal online algorithm for halfplane intersection

DOI10.1007/BF02948817zbMath0969.68627OpenAlexW2361184146MaRDI QIDQ5938679

Guo-Liang Chen, Jigang Wu, Yongchang Ji

Publication date: 1 October 2001

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948817

zbMATH Keywords

complexitycomputational geometryintersection of halfplanesonline algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Cites Work

• A new approach to the dynamic maintenance of maximal points in a plane
• Finding the intersection of n half-spaces in time O(n log n)
• Algebraic pruning: a fast technique for curve and surface intersection
• Does a point lie inside a polygon ?
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Unnamed Item

This page was built for publication: An optimal online algorithm for halfplane intersection