Detecting the intersection of convex objects in the plane

DOI10.1016/0167-8396(91)90001-RzbMath0743.65109OpenAlexW1993699086WikidataQ127972188 ScholiaQ127972188MaRDI QIDQ1183506

David P. Dobkin, Diane L. Souvaine

Publication date: 28 June 1992

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(91)90001-r

zbMATH Keywords

algorithmcomputer aided designpolygoncomputational geometrysplinegonintersection of convex objects

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Descriptive geometry (51N05)

Related Items (5)

An algorithm for the numerical detection of simplex overlap ⋮ Computational geometry in a curved world ⋮ Detecting the intersection of convex objects in the plane ⋮ Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time ⋮ Shortest curves in planar regions with curved boundary

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast detection of polyhedral intersection
• Computational geometry in a curved world
• Decomposition and intersection of simple splinegons
• Detecting the intersection of convex objects in the plane
• Decomposing a Polygon into Simpler Components
• Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
• Decomposition of Polygons into Convex Sets

This page was built for publication: Detecting the intersection of convex objects in the plane