Intersection removal for simple polygons

DOI10.1080/00207169708804585zbMATH Open0893.68159OpenAlexW1963850156MaRDI QIDQ4384035FDOQ4384035

Authors: Sumeet Lahorani, Kamala Krithivasan 

Publication date: 25 May 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169708804585

Recommendations

• On separating two simple polygons by a single translation
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• scientific article; zbMATH DE number 3905323
• Separating two simple polygons by a sequence of translations
• Computing the intersection-depth to polyhedra

zbMATH Keywords

intensity of collision

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (2)

• On separating two simple polygons by a single translation
• Subtraction of two 2D polygons with some matching vertices

This page was built for publication: Intersection removal for simple polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384035)