On the public citation graph
Translating polygons in the plane
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpa.3160360305openalex-snapshot
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
inferredcites →https://doi.org/10.1016/0010-4485(76)90048-8openalex-snapshot
IEEE trans. syst. man cybern
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/0734-189x(86)90044-7openalex-snapshot
Computing the visibility polygon from an edge
inferredcites →https://doi.org/10.1016/0734-189x(86)90118-0openalex-snapshot
Computing visibility polygon from an edge
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50007-4openalex-snapshot
Simple On-Line Algorithms for Convex Polygons
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50019-0openalex-snapshot
Computational Geometry and Motion Planning
inferredcites →https://doi.org/10.1109/sfcs.1982.29openalex-snapshot
On the movement of robot arms in 2-dimensional bounded regions
inferredcites →https://doi.org/10.1109/tsmc.1981.4308589openalex-snapshot
Automatic Planning of Manipulator Transfer Movements
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0214025openalex-snapshot
On the Movement of Robot Arms in 2-Dimensional Bounded Regions
inferredcites →https://doi.org/10.1142/9789812794499_others01openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles
inferredcites →https://doi.org/10.1177/027836498300200304openalex-snapshot
On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers
inferredcites →https://doi.org/10.1184/r1/6557033openalex-snapshot
Obstacle avoidance and navigation in the real world by a seeing robot rover
inferredcites →https://doi.org/10.7907/2e18-0e29openalex-snapshot
Collision Detection and Avoidance in Computer Controlled Manipulators
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_62openalex-snapshot
Separability of sets of polygons
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_78openalex-snapshot
Translating polygons with applications to hidden surface removal
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_1openalex-snapshot
Graphical Data Structures for Ordered Sets
inferred← citeshttps://doi.org/10.1007/bf00714475openalex-snapshot
Representing orders on the plane by translating convex figures
inferred← citeshttps://doi.org/10.1007/bf01407955openalex-snapshot
Optimal visibility algorithms for binary images on the hypercube
inferred← citeshttps://doi.org/10.1007/bf01901192openalex-snapshot
Recognizing polygons, or how to spy
inferred← citeshttps://doi.org/10.1007/bf01901193openalex-snapshot
Solving visibility and separability problems on a mesh-of-processors
inferred← citeshttps://doi.org/10.1007/bf01952829openalex-snapshot
Translation separability of sets of polygons
inferred← citeshttps://doi.org/10.1007/bf02187729openalex-snapshot
On separating two simple polygons by a single translation
inferred← citeshttps://doi.org/10.1007/bf02293040openalex-snapshot
AnO(n logn) algorithm for computing the link center of a simple polygon
inferred← citeshttps://doi.org/10.1007/bfb0035855openalex-snapshot
An optimal algorithm for detecting weak visibility of a polygon
inferred← citeshttps://doi.org/10.1007/s13366-016-0323-5openalex-snapshot
On the separability of quadrilaterals in the plane by translations and rotations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.06.001openalex-snapshot
On reconfiguration of disks in the plane and related problems
inferred← citeshttps://doi.org/10.1017/s0263574700015824openalex-snapshot
On the problem of translating an elliptic object through a workspace of elliptic obstacles
inferred← citeshttps://doi.org/10.1109/12.59852openalex-snapshot
An optimal algorithm for detecting weak visibility of a polygon
inferred← citeshttps://doi.org/10.1109/robot.1986.1087425openalex-snapshot
On translating ellipses amidst elliptic obstacles
inferred← citeshttps://doi.org/10.1142/s0218195995000131openalex-snapshot
TRANSLATION QUERIES FOR SETS OF POLYGONS
inferred← citeshttps://doi.org/10.3390/ijgi5090159openalex-snapshot
A Labeling Model Based on the Region of Movability for Point-Feature Label Placement
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.