scientific article; zbMATH DE number 3905323

MaRDI QIDQ3683086zbMATH OpenFDO

Authors Jörg-Rüdiger Sack, Godfried Toussaint

Publication date 1985

zbMATH Keywords

computational geometrymovabilitytranslation query problemweakly edge-visible polygons

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to geometry (51-04) Polyhedra and polytopes; regular figures, division of spaces (51M20) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polytopes and polyhedra (52Bxx) Software, source code, etc. for problems pertaining to computer science (68-04) Algorithms in computer science (68W99)

Recommendations

• On separating two simple polygons by a single translation
• Separating two simple polygons by a sequence of translations
• TRANSLATION QUERIES FOR SETS OF POLYGONS
• scientific article; zbMATH DE number 3911704
• scientific article; zbMATH DE number 30304

Cited in

(13)

• Separating two simple polygons by a sequence of translations
• Solving visibility and separability problems on a mesh-of-processors
• Representing orders on the plane by translating convex figures
• Transforming triangulations in polygonal domains
• Convex translation estimation
• On separating two simple polygons by a single translation
• Translating a regular grid over a point set
• On the separability of quadrilaterals in the plane by translations and rotations
• scientific article; zbMATH DE number 4051003 (Why is no real title available?)
• An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window
• Intersection removal for simple polygons
• TRANSLATION QUERIES FOR SETS OF POLYGONS
• Translating polygons with applications to hidden surface removal

This page was built for publication:

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