On the public citation graph
Polygon placement under translation and rotation
0 signed · 65 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.1007/3-540-51683-2_25openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/bf02187883openalex-snapshot
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1016/0734-189x(85)90159-8openalex-snapshot
A fast algorithm for the Boolean masking problem
inferredcites →https://doi.org/10.1109/robot.1988.12304openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferredcites →https://doi.org/10.1145/41958.41984openalex-snapshot
Simultaneous containment of several polygons
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4166610openalex-extracted
Largest Similar Copies of Convex Polygons in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/3-540-51683-2_25openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferred← citeshttps://doi.org/10.1007/3-540-54522-0_125openalex-snapshot
Placement of curved polygons
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_5openalex-snapshot
Tabu Search for Two-Dimensional Irregular Cutting
inferred← citeshttps://doi.org/10.1007/978-3-642-46955-8_11openalex-snapshot
Parallel Tabu Search for Irregular Cutting
inferred← citeshttps://doi.org/10.1007/978-94-011-2648-9_5openalex-snapshot
Robot Motion Planning: A Survey
inferred← citeshttps://doi.org/10.1007/bf01719251openalex-snapshot
A local search approach for two-dimensional irregular cutting
inferred← citeshttps://doi.org/10.1007/bfb0009488openalex-snapshot
Computing the maximum overlap of two convex polygons under translations
inferred← citeshttps://doi.org/10.1007/pl00005845openalex-snapshot
Computing the Maximum Overlap of Two Convex Polygons under Translations
inferred← citeshttps://doi.org/10.1007/pl00009337openalex-snapshot
Largest Placement of One Convex Polygon Inside Another
inferred← citeshttps://doi.org/10.1007/s10846-017-0692-5openalex-snapshot
Non-decoupled Locomotion and Manipulation Planning for Low-Dimensional Systems
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/0020-0190(09)60016-8openalex-snapshot
Algorithms for deciding the containment of polygons
inferred← citeshttps://doi.org/10.1016/0022-4049(91)90131-kopenalex-snapshot
Operations on constructible functions
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90011-6openalex-snapshot
External polygon containment problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00047-xopenalex-snapshot
Geometric pattern matching under Euclidean motion
inferred← citeshttps://doi.org/10.1016/j.cad.2012.10.016openalex-snapshot
Dynamic Minkowski sums under scaling
inferred← citeshttps://doi.org/10.1016/j.cad.2016.05.012openalex-snapshot
Continuous penetration depth computation for rigid models using dynamic Minkowski sums
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.03.011openalex-snapshot
Complete and robust no-fit polygon generation for the irregular stock cutting problem
inferred← citeshttps://doi.org/10.1016/s0736-5845(00)00053-3openalex-snapshot
Verifying contact hypotheses of planar, polyhedral objects using penetration growth distance
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.1109/70.388783openalex-snapshot
Computation of configuration-space obstacles using the fast Fourier transform
inferred← citeshttps://doi.org/10.1109/70.68066openalex-snapshot
New heuristic algorithms for efficient hierarchical path planning
inferred← citeshttps://doi.org/10.1109/icpr.1988.28392openalex-snapshot
A geometric approach to inspection
inferred← citeshttps://doi.org/10.1109/iecon.1994.397912openalex-snapshot
A motion planning algorithm of polyhedra in contact for mechanical assembly
inferred← citeshttps://doi.org/10.1109/iros.1994.407568openalex-snapshot
A lazy algorithm for planning motions in contact
inferred← citeshttps://doi.org/10.1109/iros.2013.6696509openalex-snapshot
Mapping the configuration space of polygons using reduced convolution
inferred← citeshttps://doi.org/10.1109/isatp.1999.782973openalex-snapshot
Determining near optimal interference-free polyhedral configurations for stacking
inferred← citeshttps://doi.org/10.1109/lra.2017.2673858openalex-snapshot
A New Framework for Optimal Path Planning of Rectangular Robots Using a Weighted $L_p$ Norm
inferred← citeshttps://doi.org/10.1109/robot.1988.12304openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferred← citeshttps://doi.org/10.1109/robot.1990.126083openalex-snapshot
Automatic planning of a grasp for a 'pick and place' action
inferred← citeshttps://doi.org/10.1109/robot.1990.126288openalex-snapshot
Constraint reformulation in a hierarchical path planner
inferred← citeshttps://doi.org/10.1109/robot.1993.292185openalex-snapshot
Computation of configuration-space obstacles using the fast Fourier transform
inferred← citeshttps://doi.org/10.1109/robot.1994.351105openalex-snapshot
A motion planning algorithm for convex polyhedra in contact under translation and rotation
inferred← citeshttps://doi.org/10.1109/robot.1994.351355openalex-snapshot
Sensing polygon poses by inscription
inferred← citeshttps://doi.org/10.1109/robot.1995.525667openalex-snapshot
A method for changing contact states for robotic assembly by using some local models in a multi-agent system
inferred← citeshttps://doi.org/10.1109/robot.2000.844137openalex-snapshot
Motion planning of objects in contact by the silhouette algorithm
inferred← citeshttps://doi.org/10.1109/robot.2000.844793openalex-snapshot
Determining feasible contact states of pairs of spatial polyhedra
inferred← citeshttps://doi.org/10.1109/tra.2002.999644openalex-snapshot
Interference-free polyhedral configurations for stacking
inferred← citeshttps://doi.org/10.1109/tvcg.2015.2498620openalex-snapshot
Surface Mosaic Synthesis with Irregular Tiles
inferred← citeshttps://doi.org/10.1111/1467-8659.00692openalex-snapshot
Solving Geometric Optimization Problems using Graphics Hardware
inferred← citeshttps://doi.org/10.1145/109648.109668openalex-snapshot
Extremal polygon containment problems
inferred← citeshttps://doi.org/10.1145/1128888.1128914openalex-snapshot
Generalized penetration depth computation
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/73833.73853openalex-snapshot
Placing the largest similar copy of a convex polygon among polygonal obstacles
inferred← citeshttps://doi.org/10.1145/98524.98575openalex-snapshot
Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams
inferred← citeshttps://doi.org/10.1177/02783640022067157openalex-snapshot
A Survey of Global Configuration-Space Mapping Techniques for a Single Robot in a Static Environment
inferred← citeshttps://doi.org/10.1177/027836499601500405openalex-snapshot
Geometric Sensing of Known Planar Shapes
inferred← citeshttps://doi.org/10.1201/9781315221229-13openalex-snapshot
Motion Planning: Recent Developments
inferred← citeshttps://doi.org/10.17169/refubium-4455openalex-snapshot
Parameterizations in the Configuration Space and Approximations of Related Surfaces
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.19openalex-snapshot
Largest Similar Copies of Convex Polygons in Polygonal Domains
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.