A new linear algorithm for intersecting convex polygons
From MaRDI portal
Publication:3316124
DOI10.1016/0146-664X(82)90023-5zbMath0533.52001OpenAlexW2043952582MaRDI QIDQ3316124
David Naddor, Thomas Olson, Joseph O'Rourke, Chi-Bin Chien
Publication date: 1982
Published in: Computer Graphics and Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0146-664x(82)90023-5
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (15)
An improved algorithm for intersecting convex polygons ⋮ EDGE ADVANCING RULES FOR INTERSECTING SPHERICAL CONVEX POLYGONS ⋮ A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING ⋮ Investigation of modeling non-spherical particles by using spherical discrete element model with rolling friction ⋮ A Minkowski difference‐based advancing front packing technique for generating convex noncircular particles in complex domains ⋮ Fixed-radius near neighbors search algorithms for points and segments ⋮ A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane ⋮ Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). ⋮ Predicting mesh density for adaptive modelling of the global atmosphere ⋮ Optimal output-sensitive convex hull algorithms in two and three dimensions ⋮ A simple linear algorithm for intersecting convex polygons ⋮ Developing scheduling systems for Daewoo shipbuilding: DAS project ⋮ An application of the onion peeling algorithm for fingerprint verification purposes ⋮ Restricted center problems under polyhedral gauges ⋮ An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
This page was built for publication: A new linear algorithm for intersecting convex polygons
