A dual approach to detect polyhedral intersections in arbitrary dimensions

DOI10.1007/BF01952778zbMath0724.65137OpenAlexW2133486897WikidataQ57603448 ScholiaQ57603448MaRDI QIDQ758179

Oliver Günther, Eugene Wong

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingconvex polyhedraintersection detection

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast detection of polyhedral intersection
• Efficient structures for geometric data management
• Finding the intersection of n half-spaces in time O(n log n)
• Optimal Point Location in a Monotone Subdivision
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Linear Programming in Linear Time When the Dimension Is Fixed
• Multidimensional Searching Problems
• Convex Analysis

This page was built for publication: A dual approach to detect polyhedral intersections in arbitrary dimensions