On the public citation graph

Computing convolutions by reciprocal search

https://doi.org/10.1007/bf02187878
0 signed · 103 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.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot
Plane-sweep algorithms for intersecting geometric figures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(19980630)29:7<33::aid-scj4>3.0.co;2-jopenalex-snapshot
An invertible Minkowski sum of figures
inferred← citeshttps://doi.org/10.1002/9780470823095.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/11841036_73openalex-snapshot
Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
inferred← citeshttps://doi.org/10.1007/11902140_40openalex-snapshot
Minkowski Sum Based Octree Generation for Triangular Meshes
inferred← citeshttps://doi.org/10.1007/3-540-36586-9_15openalex-snapshot
Hyperfigures and Their Interpretations
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_71openalex-snapshot
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_23openalex-snapshot
2-Point Site Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_100openalex-snapshot
On determining optimal strategies in pursuit games in the plane
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_77openalex-snapshot
Computing constrained minimum-width annuli of point sets
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_3openalex-snapshot
Digital elevation models and TIN algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-21963-9_31openalex-snapshot
Generalized Contributing Vertices-Based Method for Minkowski Sum Outer-Face of Two Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-45058-0_30openalex-snapshot
Fast Penetration Depth Estimation Using Rasterization Hardware and Hierarchical Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-00312-7_25openalex-snapshot
A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-16007-3_1openalex-snapshot
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
inferred← citeshttps://doi.org/10.1007/978-3-642-40852-6_69openalex-snapshot
Geometric Modeling of Any Obstacle Shapes for Robot Motion Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_7openalex-snapshot
Hyperplane Approximation and Related Topics
inferred← citeshttps://doi.org/10.1007/978-94-011-2560-4_36openalex-snapshot
Accessibility Analysis for Polyhedral Objects
inferred← citeshttps://doi.org/10.1007/bf00119839openalex-snapshot
Mathematical morphological operations of boundary-represented geometric objects
inferred← citeshttps://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferred← citeshttps://doi.org/10.1007/bf01586636openalex-snapshot
Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds
inferred← citeshttps://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1007/bf02187733openalex-snapshot
The upper envelope of piecewise linear functions: Algorithms and applications
inferred← citeshttps://doi.org/10.1007/s00454-022-00433-5openalex-snapshot
Bipartite Diameter and Other Measures Under Translation
inferred← citeshttps://doi.org/10.1016/0097-8493(92)90077-9openalex-snapshot
Solid-interpolating deformations: Construction and animation of PIPs
inferred← citeshttps://doi.org/10.1016/0097-8493(93)90023-3openalex-snapshot
A unified computational framework for Minkowski operations
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00052-6openalex-snapshot
All convex polyhedra can be clamped with parallel jaw grippers
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.cad.2007.01.010openalex-snapshot
Exact and approximate construction of offset polygons
inferred← citeshttps://doi.org/10.1016/j.cad.2007.05.017openalex-snapshot
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
inferred← citeshttps://doi.org/10.1016/j.cad.2009.03.008openalex-snapshot
Contributing vertices-based Minkowski sum computation of convex polyhedra
inferred← citeshttps://doi.org/10.1016/j.cad.2012.10.016openalex-snapshot
Dynamic Minkowski sums under scaling
inferred← citeshttps://doi.org/10.1016/j.cagd.2008.06.006openalex-snapshot
Covering Minkowski sum boundary using points with applications
inferred← citeshttps://doi.org/10.1016/j.gmod.2005.11.003openalex-snapshot
Accurate Minkowski sum approximation of polyhedral models
inferred← citeshttps://doi.org/10.1016/j.neuroimage.2012.03.026openalex-snapshot
Measuring and comparing brain cortical surface area and other areal quantities
inferred← citeshttps://doi.org/10.1016/j.procir.2018.02.021openalex-snapshot
Statistical Tolerance Analysis with T-Maps for Assemblies
inferred← citeshttps://doi.org/10.1016/s0010-4485(03)00023-xopenalex-snapshot
Improvements to algorithms for computing the Minkowski sum of 3-polytopes
inferred← citeshttps://doi.org/10.1016/s0010-4485(97)00073-0openalex-snapshot
Computing constrained minimum-width annuli of point sets
inferred← citeshttps://doi.org/10.1016/s0010-4485(97)00074-2openalex-snapshot
Slicing Minkowski sums for satellite antenna layout
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00053-2openalex-snapshot
Traveling the boundary of Minkowski sums
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80067-4openalex-snapshot
An efficient algorithm for hidden surface removal, II
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00320-1openalex-snapshot
2-Point site Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00229-6openalex-snapshot
On determining optimal strategies in pursuit games in the plane
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00098-6openalex-snapshot
Translating a convex polyhedron over monotone polyhedra
inferred← citeshttps://doi.org/10.1017/s0263574714000630openalex-snapshot
Offsetting obstacles of any shape for robot motion planning
inferred← citeshttps://doi.org/10.1080/10586458.1997.10504353openalex-snapshot
Combinatorial Properties of One-Dimensional Arrangements
inferred← citeshttps://doi.org/10.1080/2151237x.2006.10129216openalex-snapshot
A Fast Method for Local Penetration Depth Computation
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/haptic.2002.998960openalex-snapshot
Six-degree-of-freedom haptic display using localized contact computations
inferred← citeshttps://doi.org/10.1109/iccas.2013.6704121openalex-snapshot
Modeling any obstacle shapes for motion planning of circular robots
inferred← citeshttps://doi.org/10.1109/icra.2011.5979992openalex-snapshot
Dynamic Minkowski sum of convex shapes
inferred← citeshttps://doi.org/10.1109/iros.2011.6094482openalex-snapshot
Fast and robust 2D Minkowski sum using reduced convolution
inferred← citeshttps://doi.org/10.1109/isvd.2009.20openalex-snapshot
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
inferred← citeshttps://doi.org/10.1109/lra.2015.2502919openalex-snapshot
Efficient Penetration Depth Computation Between Rigid Models Using Contact Space Propagation Sampling
inferred← citeshttps://doi.org/10.1109/memsys.1994.555606openalex-snapshot
A theory of manipulation and control for microfabricated actuator arrays
inferred← citeshttps://doi.org/10.1109/pccga.2004.1348370openalex-snapshot
Accurate minkowski sum approximation of polyhedral models
inferred← citeshttps://doi.org/10.1109/pg.2007.47openalex-snapshot
Radiometric Compensation through Inverse Light Transport
inferred← citeshttps://doi.org/10.1109/pg.2007.49openalex-snapshot
Point-Based Minkowski Sum Boundary
inferred← citeshttps://doi.org/10.1109/robot.1994.351386openalex-snapshot
Sensorless manipulation using massively parallel microfabricated actuator arrays
inferred← citeshttps://doi.org/10.1109/robot.2006.1642164openalex-snapshot
Topology preserving approximation of free configuration space
inferred← citeshttps://doi.org/10.1109/smi.2009.5170166openalex-snapshot
Contributing vertices-based Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron
inferred← citeshttps://doi.org/10.1109/tvcg.2020.2976922openalex-snapshot
A Review of Methods to Compute Minkowski Operations for Geometric Overlap Detection
inferred← citeshttps://doi.org/10.1111/1467-8659.1330179openalex-snapshot
AGRELs and BIPs: Metamorphosis as a Bezier curve in the space of polyhedra
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2010.01770.xopenalex-snapshot
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
inferred← citeshttps://doi.org/10.1137/0221038openalex-snapshot
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
inferred← citeshttps://doi.org/10.1137/0406019openalex-snapshot
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
inferred← citeshttps://doi.org/10.1137/1.9781611972863.1openalex-snapshot
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
inferred← citeshttps://doi.org/10.1137/s0097539794266602openalex-snapshot
On Translational Motion Planning of a Convex Polyhedron in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539797329373openalex-snapshot
Robust Plane Sweep for Intersecting Segments
inferred← citeshttps://doi.org/10.1142/s0218195904001512openalex-snapshot
OVERLAYING SURFACE MESHES, PART I: ALGORITHMS
inferred← citeshttps://doi.org/10.1142/s0218195907002392openalex-snapshot
A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS
inferred← citeshttps://doi.org/10.1142/s0218195996000022openalex-snapshot
OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES
inferred← citeshttps://doi.org/10.1145/102782.102785openalex-snapshot
A fast planar partition algorithm, II
inferred← citeshttps://doi.org/10.1145/177424.177445openalex-snapshot
On translational motion planning in 3-space
inferred← citeshttps://doi.org/10.1145/1899404.1899407openalex-snapshot
Contributing vertices-based Minkowski sum of a nonconvex--convex pair of polyhedra
inferred← citeshttps://doi.org/10.1145/237218.237374openalex-snapshot
An algorithm to compute the Minkowski sum outer-face of two simple polygons
inferred← citeshttps://doi.org/10.1145/262839.262904openalex-snapshot
Minkowski operations for satellite antenna layout
inferred← citeshttps://doi.org/10.1145/378583.378723openalex-snapshot
2-point site Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/380752.380815openalex-snapshot
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
inferred← citeshttps://doi.org/10.1145/545261.545266openalex-snapshot
Fast penetration depth computation for physically-based animation
inferred← citeshttps://doi.org/10.1145/73833.73837openalex-snapshot
A fast planar partition algorithm, II
inferred← citeshttps://doi.org/10.1145/777792.777856openalex-snapshot
Fast penetration depth estimation using rasterization hardware and hierarchical refinement
inferred← citeshttps://doi.org/10.1145/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1145/98524.98600openalex-snapshot
On solving geometric optimization problems using shortest paths
inferred← citeshttps://doi.org/10.1162/105474603765879530openalex-snapshot
Six-Degree-of-Freedom Haptic Rendering Using Incremental and Localized Computations
inferred← citeshttps://doi.org/10.1177/0278364905059061openalex-snapshot
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
inferred← citeshttps://doi.org/10.1177/0278364906071199openalex-snapshot
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
inferred← citeshttps://doi.org/10.1177/027836499000900104openalex-snapshot
Generation of Configuration Space Obstacles: Moving Algebraic Surfaces
inferred← citeshttps://doi.org/10.15607/rss.2008.iv.013openalex-snapshot
Hybrid Motion Planning Using Minkowski Sums
inferred← citeshttps://doi.org/10.15701/kcgs.2010.16.2.9openalex-snapshot
Robust Computation of Polyhedral Minkowski Sum Boundary
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-18openalex-snapshot
Planar 3-SAT with a Clause/Variable Cycle
inferred← citeshttps://doi.org/10.3929/ethz-a-005427892openalex-snapshot
Consistent collision and self-collision handling for deformable objects
inferred← citeshttps://doi.org/10.4064/dm411-0-1openalex-snapshot
Minkowski sum of semi-convex domains in R2
inferred← citeshttps://doi.org/10.48550/arxiv.0906.3240openalex-snapshot
Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9909017openalex-snapshot
Finding an ordinary conic and an ordinary hyperplane
inferred← citeshttps://doi.org/10.70675/cd706d0dz2107z46a2za552zb472e8e4f7f1openalex-snapshot
Analyse de maillages 3D par morphologie mathématique
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.