Detecting the intersection of convex objects in the plane
From MaRDI portal
Publication:1183506
DOI10.1016/0167-8396(91)90001-RzbMath0743.65109MaRDI QIDQ1183506
Diane L. Souvaine, David P. Dobkin
Publication date: 28 June 1992
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
algorithm; computer aided design; polygon; computational geometry; splinegon; intersection of convex objects
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
51N05: Descriptive geometry
Related Items
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, An algorithm for the numerical detection of simplex overlap
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