On the detection of a common intersection of k convex subjects in the plane

DOI10.1016/0020-0190(88)90127-5zbMath0657.68040OpenAlexW2067487612MaRDI QIDQ1111021

Matthias Reichling

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90127-5

zbMATH Keywords

complexityconvex polygoncomputational geometrydiskscommon intersection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Helly-type theorems and geometric transversal theory (52A35)

Related Items (2)

Common intersections of polygons ⋮ Output-sensitive results on convex hulls, extreme points, and related problems

Cites Work

• Unnamed Item
• Fast detection of polyhedral intersection
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• The Weighted Euclidean 1-Center Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem

This page was built for publication: On the detection of a common intersection of k convex subjects in the plane