On the public citation graph

Computing the maximum overlap of two convex polygons under translations

0 signed · 32 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.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferredcites →https://doi.org/10.1007/978-1-4615-4022-9openalex-snapshot
Robot Motion Planning
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bf02189323openalex-snapshot
The upper envelope of voronoi surfaces and its applications
inferredcites →https://doi.org/10.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1007/bfb0035856openalex-snapshot
Polygon placement under translation and rotation
inferredcites →https://doi.org/10.1016/0020-0255(94)00053-eopenalex-snapshot
On the area of intersection between two closed 2-D objects
inferredcites →https://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferredcites →https://doi.org/10.1016/0925-7721(95)00047-xopenalex-snapshot
Geometric pattern matching under Euclidean motion
inferredcites →https://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1117/12.165000openalex-snapshot
Area of overlap of translated polygons
inferredcites →https://doi.org/10.1137/0213002openalex-snapshot
Generalized Selection and Ranking: Sorted Matrices
inferredcites →https://doi.org/10.1137/0221041openalex-snapshot
An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
inferredcites →https://doi.org/10.1145/109648.109669openalex-snapshot
Approximate matching of polygonal shapes (extended abstract)
inferredcites →https://doi.org/10.1145/142675.142699openalex-snapshot
Measuring the resemblance of polygonal curves
inferredcites →https://doi.org/10.1145/142675.142700openalex-snapshot
On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane
inferredcites →https://doi.org/10.1145/237218.237411openalex-snapshot
On the sectional area of convex polytopes

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-61680-2_65openalex-snapshot
Matching convex shapes with respect to the symmetric difference
inferred← citeshttps://doi.org/10.1007/978-1-4471-3702-3_4openalex-snapshot
State of the Art in Shape Matching
inferred← citeshttps://doi.org/10.1007/s00454-007-1328-5openalex-snapshot
Finding a Guard that Sees Most and a Shop that Sells Most
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50004-8openalex-snapshot
Discrete Geometric Shapes: Matching, Interpolation, and Approximation**Partially supported by Deutsche Forschungsgemeinschaft (DFG), Grant No. A1 253/4-2.
inferred← citeshttps://doi.org/10.1016/j.cag.2006.10.006openalex-snapshot
Maximizing the area of an axially symmetric polygon inscribed in a simple polygon
inferred← citeshttps://doi.org/10.1023/a:1008022116857openalex-snapshot
Reliable and Efficient Pattern Matching Using an Affine Invariant Metric
inferred← citeshttps://doi.org/10.1109/icsipa.2011.6144131openalex-snapshot
On aligning shapes
inferred← citeshttps://doi.org/10.1145/1064092.1064146openalex-snapshot
Maximizing the overlap of two planar convex sets under rigid motions
inferred← citeshttps://doi.org/10.1145/1160972.1160986openalex-snapshot
Contour estimation using collaborating mobile sensors
inferred← citeshttps://doi.org/10.1145/237218.237411openalex-snapshot
On the sectional area of convex polytopes
inferred← citeshttps://doi.org/10.1587/transcom.e98.b.714openalex-snapshot
Low Overhead Query Method for the Interface between Geo-Location Database and Secondary User
inferred← citeshttps://doi.org/10.17169/refubium-17176openalex-snapshot
Shape Matching With Reference Points
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3481646/v1openalex-snapshot
The Maximum Cover with Rotating Field of View
inferred← citeshttps://doi.org/10.33540/1571openalex-snapshot
Geometric similarity measures and their applications
inferred← citeshttps://doi.org/10.5194/isprs-archives-xlvi-4-w4-2021-49-2021openalex-snapshot
AUTOMATIC 3D BUILDING MODEL GENERATION USING DEEP LEARNING METHODS BASED ON CITYJSON AND 2D FLOOR PLANS
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.