On the public citation graph
Multiple Translational Containment Part II: Exact Algorithms
0 signed · 33 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.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1016/0022-0000(90)90016-eopenalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1016/0377-2217(95)00021-hopenalex-snapshot
Compaction and separation algorithms for non-convex polygons and their applications
inferredcites →https://doi.org/10.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1142/s0218195993000270openalex-snapshot
SIMULTANEOUS CONTAINMENT OF SEVERAL POLYGONS: ANALYSIS OF THE CONTACT CONFIGURATIONS
inferredcites →https://doi.org/10.1145/41958.41984openalex-snapshot
Simultaneous containment of several polygons
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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-36136-7_9openalex-snapshot
Cutting a Country for Smallest Square Fit
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_70openalex-snapshot
Computing upper and lower bounds on textile nesting problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_41openalex-snapshot
Approximate Unions of Lines and Minkowski Sums
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_3openalex-snapshot
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
inferred← citeshttps://doi.org/10.1007/bfb0014488openalex-snapshot
Column-based strip packing using ordered and compliant containment
inferred← citeshttps://doi.org/10.1007/s00453-005-1191-9openalex-snapshot
Approximate unions of lines and minkowski sums
inferred← citeshttps://doi.org/10.1007/s004530010004openalex-snapshot
Shortest Path Geometric Rounding
inferred← citeshttps://doi.org/10.1007/s10898-014-0192-0openalex-snapshot
Optimal clustering of a pair of irregular objects
inferred← citeshttps://doi.org/10.1007/s11042-018-6683-0openalex-snapshot
An optimized placement of building drawings with moving least squares and K-means clustering
inferred← citeshttps://doi.org/10.1007/s11042-021-10659-9openalex-snapshot
Draft layout generation of building drawings on real urban scenes with boundary particle method and priority solver
inferred← citeshttps://doi.org/10.1016/j.eswa.2009.06.081openalex-snapshot
Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions
inferred← citeshttps://doi.org/10.1016/s0305-0548(96)00050-0openalex-snapshot
A new algorithm for the two-polygon containment problem
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00051-7openalex-snapshot
Densest translational lattice packing of non-convex polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00012-1openalex-snapshot
Rotational polygon overlap minimization and compaction
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00006-1openalex-snapshot
Rotational polygon containment and minimum enclosure using only robust 2D constructions
inferred← citeshttps://doi.org/10.1016/s0969-6016(99)00007-6openalex-snapshot
Translational polygon containment and minimal enclosure using mathematical programming
inferred← citeshttps://doi.org/10.1109/icist.2014.6920400openalex-snapshot
A collision detection algorithm of Robot in off-line programming system
inferred← citeshttps://doi.org/10.1109/tvcg.2015.2498620openalex-snapshot
Surface Mosaic Synthesis with Irregular Tiles
inferred← citeshttps://doi.org/10.1145/262839.262996openalex-snapshot
Rotational polygon overlap minimization
inferred← citeshttps://doi.org/10.1145/276884.276885openalex-snapshot
Rotational polygon containment and minimum enclosure
inferred← citeshttps://doi.org/10.1145/336154.336214openalex-snapshot
Densest translational lattice packing of non-convex polygons (extended abstract)
inferred← citeshttps://doi.org/10.1145/378583.378672openalex-snapshot
Algorithms for congruent sphere packing and applications
inferred← citeshttps://doi.org/10.46298/theoretics.24.11openalex-snapshot
Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0808.2931openalex-snapshot
Spatial planning with constraints on translational distances between geometric objects
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.