On the public citation graph

Translation separability of sets of polygons

https://doi.org/10.1007/bf01952829
0 signed · 30 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.1007/3-540-13345-3_10openalex-snapshot
The complexity and decidability of separation
inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/bfb0024019openalex-snapshot
Translating polygons in the plane
inferredcites →https://doi.org/10.1016/0020-0190(84)90130-3openalex-snapshot
Strong np-hardness of moving many discs
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.1109/sfcs.1976.16openalex-snapshot
Geometric intersection problems
inferredcites →https://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles

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-50728-0_44openalex-snapshot
Separating a polyhedron by one translation from a set of obstacles
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_14openalex-snapshot
Disassembling two-dimensional composite parts via translations
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_65openalex-snapshot
An optimal algorithm for one-separation of a set of isothetic polygons
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_70openalex-snapshot
Intractability of assembly sequencing: Unit disks in the plane
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-030-54817-9_68openalex-snapshot
Modeling Geometric Obstacles in the Assembly of Complex Products
inferred← citeshttps://doi.org/10.1007/bf01407955openalex-snapshot
Optimal visibility algorithms for binary images on the hypercube
inferred← citeshttps://doi.org/10.1007/bf01759069openalex-snapshot
Computational geometry algorithms for the systolic screen
inferred← citeshttps://doi.org/10.1007/bf01901193openalex-snapshot
Solving visibility and separability problems on a mesh-of-processors
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.1016/j.ins.2003.06.007openalex-snapshot
An optimal algorithm for one-separation of a set of isothetic polygons
inferred← citeshttps://doi.org/10.1063/1.4952257openalex-snapshot
Quadrangles which cannot be separated with two hands
inferred← citeshttps://doi.org/10.1115/1.2826246openalex-snapshot
Parallel Disassembly by Onion Peeling
inferred← citeshttps://doi.org/10.1142/s0218195999000248openalex-snapshot
COMPLEXITY MEASURES FOR ASSEMBLY SEQUENCES
inferred← citeshttps://doi.org/10.1145/160985.161154openalex-snapshot
Scalable parallel geometric algorithms for coarse grained multicomputers
inferred← citeshttps://doi.org/10.15862/82tvn516openalex-snapshot
Methods of analysis of geometric obstacles in the assembly of products
inferred← citeshttps://doi.org/10.24108/mathm.0518.0000153openalex-snapshot
Analysis of Geometric Obstacles Avoidance in Assembling Complex Products as a Decision-making Problem
inferred← citeshttps://doi.org/10.5555/313852.313901openalex-snapshot
Efficient generation of k-directional assembly sequences
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.