On the public citation graph

On separating two simple polygons by a single translation

https://doi.org/10.1007/bf02187729
0 signed · 47 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/3-540-13345-3_10openalex-snapshot
The complexity and decidability of separation
inferredcites →https://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferredcites →https://doi.org/10.1007/bfb0024019openalex-snapshot
Translating polygons in the plane
inferredcites →https://doi.org/10.1007/bfb0081125openalex-snapshot
The Geometry of Metric and Linear Spaces
inferredcites →https://doi.org/10.1016/0020-0190(79)90069-3openalex-snapshot
A linear algorithm for finding the convex hull of a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(81)90091-0openalex-snapshot
Testing a simple polygon for monotonicity
inferredcites →https://doi.org/10.1016/0031-3203(84)90057-8openalex-snapshot
Geodesic methods in quantitative image analysis
inferredcites →https://doi.org/10.1016/0167-8655(86)90015-2openalex-snapshot
Shortest path solves edge-to-edge visibility in a polygon
inferredcites →https://doi.org/10.1016/0734-189x(83)90062-2openalex-snapshot
On translating a set of line segments
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.1017/s0263574700008924openalex-snapshot
Separation of two monotone polygons in linear time
inferredcites →https://doi.org/10.1017/s0263574700009644openalex-snapshot
Separability of pairs of polygons through single translations
inferredcites →https://doi.org/10.1080/0025570x.1984.11977071openalex-snapshot
On Removing a Ball Without Disturbing the Others
inferredcites →https://doi.org/10.1098/rspb.1982.0024openalex-snapshot
Representation and recognition of the movements of shapes
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0604020openalex-snapshot
Traditional Galleries Require Fewer Watchmen
inferredcites →https://doi.org/10.1145/12130.12170openalex-snapshot
A linear-time algorithm for triangulating simple polygons
inferredcites →https://doi.org/10.1145/323233.323259openalex-snapshot
Sorting Jordan sequences in linear time
inferredcites →https://doi.org/10.1145/800141.804662openalex-snapshot
Detection is easier than computation (Extended Abstract)
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles
inferredcites →https://doi.org/10.82308/18310openalex-snapshot
Hierarchical decomposition of polygons with applications

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-52846-6_78openalex-snapshot
Translating polygons with applications to hidden surface removal
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_33openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1007/978-3-030-03577-8_63openalex-snapshot
Matchstick Games: On Removing a Matchstick Without Disturbing the Others
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_40openalex-snapshot
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy
inferred← citeshttps://doi.org/10.1007/978-3-319-26145-4_4openalex-snapshot
Relative Convex Hull Determination from Convex Hulls in the Plane
inferred← citeshttps://doi.org/10.1007/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/bf01189068openalex-snapshot
Assembly sequences for polyhedra
inferred← citeshttps://doi.org/10.1007/bf02523191openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1007/bfb0028273openalex-snapshot
Computing minimum length paths of a given homotopy class
inferred← citeshttps://doi.org/10.1007/s00453-012-9679-6openalex-snapshot
Relative Convex Hulls in Semi-Dynamic Arrangements
inferred← citeshttps://doi.org/10.1007/s00453-020-00725-3openalex-snapshot
Embedding Graphs into Embedded Graphs
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/0925-7721(94)90010-8openalex-snapshot
Computing minimum length paths of a given homotopy class
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.1063/1.4952257openalex-snapshot
Quadrangles which cannot be separated with two hands
inferred← citeshttps://doi.org/10.1088/1757-899x/435/1/012043openalex-snapshot
Moving a Chair through a Door: A Tutorial on Local Spatial Reasoning in Algorithmic Robotics
inferred← citeshttps://doi.org/10.1109/iccr.2018.8534492openalex-snapshot
Motion Planning Problems with Boxes: An Introduction for Undergraduate Courses in Discrete Mathematics
inferred← citeshttps://doi.org/10.1109/robot.1992.220106openalex-snapshot
Assembling polyhedra with single translations
inferred← citeshttps://doi.org/10.1115/1.2826246openalex-snapshot
Parallel Disassembly by Onion Peeling
inferred← citeshttps://doi.org/10.1142/s0218195925500062openalex-snapshot
Constant Workspace Algorithms for Computing Relative Hulls in the Plane
inferred← citeshttps://doi.org/10.1142/s0218195995000131openalex-snapshot
TRANSLATION QUERIES FOR SETS OF POLYGONS
inferred← citeshttps://doi.org/10.1145/98524.98536openalex-snapshot
Structured visibility profiles with applications to problems in simple polygons (extended abstract)
inferred← citeshttps://doi.org/10.5555/2722129.2722239openalex-snapshot
Detecting weakly simple polygons
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.