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

DOI10.1016/J.INS.2003.06.007zbMATH Open1094.68101OpenAlexW2055869522MaRDI QIDQ707337FDOQ707337

Kamala Krithivasan, Thomas Ottmann, Amitava Datta

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

Recommendations

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

zbMATH Keywords

Computational geometryMotion planningIsothetic polygonsOne-separationOptimal algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS
• Translation separability of sets of polygons
• Title not available (Why is that?)
• TRANSLATION QUERIES FOR SETS OF POLYGONS
• Title not available (Why is that?)

Cited In (6)

• TRANSLATION QUERIES FOR SETS OF POLYGONS
• An optimal algorithm for finding the separation of simple polygons
• Separating translates in the plane: Combinatorial bounds and an algorithm
• On movable separability and isotheticity
• Separating two simple polygons by a sequence of translations
• Title not available (Why is that?)

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)