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

DOI10.1016/j.ins.2003.06.007zbMath1094.68101OpenAlexW2055869522MaRDI QIDQ707337

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

zbMATH Keywords

Computational geometryMotion planningIsothetic polygonsOne-separationOptimal algorithm

Mathematics Subject Classification ID

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

Cites Work

• Translation separability of sets of polygons
• TRANSLATION QUERIES FOR SETS OF POLYGONS
• DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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