On the public citation graph

A fast algorithm for polygon containment by translation

0 signed · 57 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/978-1-4613-8997-2_22openalex-snapshot

Solving the Find-Path Problem by Good Representation of Free Space

inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot

Efficient computation of continuous skeletons

inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot

Algorithms for Reporting and Counting Geometric Intersections

inferredcites →https://doi.org/10.1109/tsmc.1983.6313112openalex-snapshot

Solving the find-path problem by good representation of free space

inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot

Plane-sweep algorithms for intersecting geometric figures

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/800061.808750openalex-snapshot

Retraction

inferredcites →https://doi.org/10.1145/800116.803772openalex-snapshot

Geometric complexity

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.1002/9780470317013.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1002/9781118792148.ch380openalex-snapshot

An Approach for Modelling Carbon Homogenization Processes of Steel in Micro‐Scale

inferred← citeshttps://doi.org/10.1006/jagm.2000.1092openalex-snapshot

Safety Zone Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-48764-9_380openalex-snapshot

An Approach for Modelling Carbon Homogenization Processes of Steel in Micro-Scale

inferred← citeshttps://doi.org/10.1007/978-3-319-97785-0_25openalex-snapshot

Line Voronoi Diagrams Using Elliptical Distances

inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_5openalex-snapshot

Distance-Sensitive Planar Point Location

inferred← citeshttps://doi.org/10.1007/bf00536457openalex-snapshot

What does Halobacterium tell us about photoreception?

inferred← citeshttps://doi.org/10.1007/bf01759042openalex-snapshot

AnO(n logn) plane-sweep algorithm forL 1 andL ∞ Delaunay triangulations

inferred← citeshttps://doi.org/10.1007/bf01840357openalex-snapshot

A sweepline algorithm for Voronoi diagrams

inferred← citeshttps://doi.org/10.1007/bf02187867openalex-snapshot

Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams

inferred← citeshttps://doi.org/10.1007/bf02187890openalex-snapshot

AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments

inferred← citeshttps://doi.org/10.1007/bf02187902openalex-snapshot

Separating two simple polygons by a sequence of translations

inferred← citeshttps://doi.org/10.1007/bf02189323openalex-snapshot

The upper envelope of voronoi surfaces and its applications

inferred← citeshttps://doi.org/10.1007/bf02526034openalex-snapshot

Sorting helps for voronoi diagrams

inferred← citeshttps://doi.org/10.1007/bf02574686openalex-snapshot

On the construction of abstract voronoi diagrams

inferred← citeshttps://doi.org/10.1007/bfb0009488openalex-snapshot

Computing the maximum overlap of two convex polygons under translations

inferred← citeshttps://doi.org/10.1007/bfb0035856openalex-snapshot

Polygon placement under translation and rotation

inferred← citeshttps://doi.org/10.1007/pl00005845openalex-snapshot

Computing the Maximum Overlap of Two Convex Polygons under Translations

inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot

Motion Planning for a Convex Polygon in a Polygonal Environment

inferred← citeshttps://doi.org/10.1007/pl00014415openalex-snapshot

Multiple Translational Containment Part I: An Approximate Algorithm

inferred← citeshttps://doi.org/10.1007/pl00014416openalex-snapshot

Multiple Translational Containment Part II: Exact Algorithms

inferred← citeshttps://doi.org/10.1007/s00170-009-2135-3openalex-snapshot

Development of a VGRAIN system for CPFE analysis in micro-forming applications

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/s0305-0548(96)00050-0openalex-snapshot

A new algorithm for the two-polygon containment problem

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.1051/ita/1989230100051openalex-snapshot

Polygon placement under translation and rotation

inferred← citeshttps://doi.org/10.1080/00207169408804299openalex-snapshot

Optimal polygon placement by translation1

inferred← citeshttps://doi.org/10.1109/cdcs.2001.918735openalex-snapshot

An efficient method for computing the feasible region with translational containment between two convex polygons

inferred← citeshttps://doi.org/10.1109/robot.1994.351355openalex-snapshot

Sensing polygon poses by inscription

inferred← citeshttps://doi.org/10.1109/sfcs.1991.185347openalex-snapshot

Fat triangles determine linearly many holes (computational geometry)

inferred← citeshttps://doi.org/10.1111/1467-8659.00692openalex-snapshot

Solving Geometric Optimization Problems using Graphics Hardware

inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot

Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number

inferred← citeshttps://doi.org/10.1137/0221038openalex-snapshot

Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions

inferred← citeshttps://doi.org/10.1137/s009753979018330xopenalex-snapshot

Fat Triangles Determine Linearly Many Holes

inferred← citeshttps://doi.org/10.1142/s1756973709000037openalex-snapshot

AN INTEGRATED CRYSTAL PLASTICITY FE SYSTEM FOR MICROFORMING SIMULATION

inferred← citeshttps://doi.org/10.1145/10515.10526openalex-snapshot

Fast heuristics for minimum length rectangular partitions of polygons

inferred← citeshttps://doi.org/10.1145/10515.10535openalex-snapshot

A new efficient motion-planning algorithm for a rod in polygonal space

inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot

Voronoi diagrams—a survey of a fundamental geometric data structure

inferred← citeshttps://doi.org/10.1145/142675.142737openalex-snapshot

Intersection detection and separators for simple polygons

inferred← citeshttps://doi.org/10.1145/237814.237840openalex-snapshot

Translational polygon containment and minimal enclosure using linear programming based restriction

inferred← citeshttps://doi.org/10.1145/41958.41984openalex-snapshot

Simultaneous containment of several polygons

inferred← citeshttps://doi.org/10.1145/98524.98600openalex-snapshot

On solving geometric optimization problems using shortest paths

inferred← citeshttps://doi.org/10.1177/027836499601500405openalex-snapshot

Geometric Sensing of Known Planar Shapes

inferred← citeshttps://doi.org/10.15807/jorsj.42.45openalex-snapshot

MAXIMIN LOCATION OF CONVEX OBJECTS IN A POLYGON AND RELATED DYNAMIC VORONOI DIAGRAMS

inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.19openalex-snapshot

Largest Similar Copies of Convex Polygons in Polygonal Domains

inferred← citeshttps://doi.org/10.5555/1109557.1109610openalex-snapshot

Finding large sticks and potatoes in polygons

inferred← citeshttps://doi.org/10.5555/313651.313699openalex-snapshot

Multiple translational containment: approximate and exact algorithms

inferred← citeshttps://doi.org/10.70675/2dc95cfazb8d5z44e4zb281z08798d42cad9openalex-snapshot

Parallel algorithms for tracking of particles

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.