scientific article
From MaRDI portal
Publication:3716330
zbMath0588.68053MaRDI QIDQ3716330
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveycomplexityalgorithmspolyhedraroboticscomputational geometrycollision avoidanceline segmentspolygonshidden linesspatial planninghidden surfacessofa problemvisibility hulls
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computing methodologies and applications (68U99) Artificial intelligence (68T99) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Computing minimum length paths of a given homotopy class, On lines missing polyhedral sets in 3-space, Assembly sequences for polyhedra, Translating polygons with applications to hidden surface removal, Filling polyhedral molds, Minimal Locked Trees, Separating two simple polygons by a sequence of translations, Representing orders on the plane by translating convex figures, On the separability of quadrilaterals in the plane by translations and rotations, On geometric path query problems, Intractability of assembly sequencing: Unit disks in the plane, Interlocked open and closed linkages with few joints., Separability, boxicity, and partial orders, Throwing a sofa through the window, Convex blocking and partial orders on the plane, Separating a polyhedron by one translation from a set of obstacles, The upper envelope of piecewise linear functions: Algorithms and applications, Computational geometry algorithms for the systolic screen, On movable separability and isotheticity, Partitioning a planar assembly into two connected parts is NP-complete, An optimal algorithm for one-separation of a set of isothetic polygons, Covering a simple polygon by monotone directions, Rotationally monotone polygons, Detecting geometric infeasibility, On separating two simple polygons by a single translation, On the complexity of one-shot translational separability., Line directionality of orders, On the complexity of assembly partitioning
