An optimal algorithm for one-separation of a set of isothetic polygons

DOI10.1016/J.INS.2003.06.007MaRDI QIDQ707337zbMATH OpenOpenAlexFDO

Authors Amitava Datta, Kamala Krithivasan, Thomas Ottmann

Publication date 9 February 2005

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2003.06.007

zbMATH Keywords

Computational geometryMotion planningIsothetic polygonsOne-separationOptimal algorithm

Mathematics Subject Classification ID

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

Recommendations

• An optimal algorithm for finding the separation of simple polygons
• scientific article; zbMATH DE number 4049041
• On separating two simple polygons by a single translation
• Minimum polygonal separation

Cites work

• scientific article; zbMATH DE number 3883607 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3945379 (Why is no real title available?)
• scientific article; zbMATH DE number 871907 (Why is no real title available?)
• DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS
• TRANSLATION QUERIES FOR SETS OF POLYGONS
• Translation separability of sets of polygons

Cited in

(6)

• TRANSLATION QUERIES FOR SETS OF POLYGONS
• On movable separability and isotheticity
• scientific article; zbMATH DE number 4049041 (Why is no real title available?)
• Separating translates in the plane: Combinatorial bounds and an algorithm
• Separating two simple polygons by a sequence of translations
• An optimal algorithm for finding the separation of simple polygons

This page was built for publication: An optimal algorithm for one-separation of a set of isothetic polygons

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