On the public citation graph

Voronoi diagrams with barriers and on polyhedra for minimal path planning

https://doi.org/10.1007/bf01898357
0 signed · 67 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.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.1002/cpa.3160370406openalex-snapshot
On the Piano Movers' problem: IV. Various decomposable two‐dimensional motion‐planning problems
inferredcites →https://doi.org/10.1002/cpa.3160370605openalex-snapshot
On the piano movers' problem: V. The case of a rod moving in three‐dimensional space amidst polyhedral obstacles
inferredcites →https://doi.org/10.1002/net.3230120406openalex-snapshot
An efficient algorithm for K shortest simple paths
inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/978-3-540-77974-2_1openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bfb0024013openalex-snapshot
Shortest paths on polyhedral surfaces
inferredcites →https://doi.org/10.1016/0020-0190(79)90066-8openalex-snapshot
Location of multiple points in a planar subdivision
inferredcites →https://doi.org/10.1016/0020-0190(79)90074-7openalex-snapshot
Voronoi diagrams from convex hulls
inferredcites →https://doi.org/10.1016/0097-8493(80)90005-9openalex-snapshot
Implementation of two hidden-line algorithms
inferredcites →https://doi.org/10.1016/0146-664x(79)90077-7openalex-snapshot
Mathematical models for determining the intersections of quadric surfaces
inferredcites →https://doi.org/10.1016/0146-664x(82)90117-4openalex-snapshot
Fundamentals of interactive computer graphics
inferredcites →https://doi.org/10.1016/0196-6774(81)90019-5openalex-snapshot
A linear algorithm for computing the visibility polygon from a point
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/s0146-664x(81)80017-2openalex-snapshot
An exact hidden sphere algorithm that operates in linear time
inferredcites →https://doi.org/10.1057/jors.1976.202openalex-snapshot
Graph Theory: An Algorithmic Approach
inferredcites →https://doi.org/10.1063/1.2915086openalex-snapshot
Statistical Mechanics algorithm for Monte Carlo optimization
inferredcites →https://doi.org/10.1109/mc.1979.1658812openalex-snapshot
Robots, Models, and Automation
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/sfcs.1979.47openalex-snapshot
Transforming static data structures to dynamic structures
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tc.1983.1676196openalex-snapshot
Spatial Planning: A Configuration Space Approach
inferredcites →https://doi.org/10.1109/tit.1983.1056738openalex-snapshot
Dynamic Voronoi diagrams
inferredcites →https://doi.org/10.1109/tsmc.1981.4308589openalex-snapshot
Automatic Planning of Manipulator Transfer Movements
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.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
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/359545.359557openalex-snapshot
Interpolation search—a log log N search
inferredcites →https://doi.org/10.1145/360349.360355openalex-snapshot
A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
inferredcites →https://doi.org/10.1145/800057.808676openalex-snapshot
On shortest paths in polyhedral spaces
inferredcites →https://doi.org/10.1145/800061.808751openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
inferredcites →https://doi.org/10.1145/800113.803626openalex-snapshot
Some NP-complete geometric problems
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles
inferredcites →https://doi.org/10.1177/027836498300200204openalex-snapshot
A Torque-Sensitive Tactile Array for Robotics
inferredcites →https://doi.org/10.1177/027836498300200304openalex-snapshot
On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers
inferredcites →https://doi.org/10.1177/027836498400300405openalex-snapshot
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"
inferredcites →https://doi.org/10.1287/mnsc.17.11.712openalex-snapshot
Finding the K Shortest Loopless Paths in a Network
inferredcites →https://doi.org/10.21236/ad0785071openalex-snapshot
Modelling, Trajectory Calculation and Servoing of a Computer Controlled Arm
inferredcites →https://doi.org/10.2307/2316512openalex-snapshot
Optimization in Integers and Related Extremal Problems.
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2975591openalex-snapshot
Turtle Geometry. The Computer as a Medium for Exploring Mathematics.
inferredcites →https://doi.org/10.2307/3009122openalex-snapshot
Graph Theory: An Algorithmic Approach
inferredcites →https://doi.org/10.2307/3028272openalex-snapshot
Mathematics-Its Magic and Mastery
inferredcites →https://doi.org/10.7907/2e18-0e29openalex-snapshot
Collision Detection and Avoidance in Computer Controlled Manipulators

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-48800-6_10openalex-snapshot
Advances in Two-Dimensional and Three-Dimensional Computer Vision
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_23openalex-snapshot
Geometry and Graphics Applied to Robotics
inferred← citeshttps://doi.org/10.1007/978-3-642-84574-1_39openalex-snapshot
Shortest Paths in 3-Space, Voronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues
inferred← citeshttps://doi.org/10.1007/978-94-011-2526-0_29openalex-snapshot
An Approach to Real-Time Flexible Path Planning
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00035-0openalex-snapshot
An event driven integration reasoning scheme for handling dynamic threats in an unstructured environment
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)59974-7openalex-snapshot
Locus Techniques for Shortest Path Problems in Robotics
inferred← citeshttps://doi.org/10.1109/70.56665openalex-snapshot
Path planning in the presence of vertical obstacles
inferred← citeshttps://doi.org/10.1109/icsess.2018.8663950openalex-snapshot
Quantitative Evaluation of Voronoi Graph Search Algorithm in UAV Path Planning
inferred← citeshttps://doi.org/10.1109/isvd.2007.33openalex-snapshot
Pursuit-Evasion Voronoi Diagrams in \ell_1
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646107openalex-snapshot
Approximating shortest paths on a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1137/s0097539799352759openalex-snapshot
Approximating Shortest Paths on a Nonconvex Polyhedron
inferred← citeshttps://doi.org/10.1145/383259.383294openalex-snapshot
Integrating shape and pattern in mammalian models
inferred← citeshttps://doi.org/10.1184/r1/6489869openalex-snapshot
Geometric abstractions using medial axis transformation
inferred← citeshttps://doi.org/10.13140/rg.2.2.26030.08007openalex-snapshot
Steps into a geometer's workbench
inferred← citeshttps://doi.org/10.14288/1.0051143openalex-snapshot
Constrained pursuit-evasion problems in the plane
inferred← citeshttps://doi.org/10.14288/1.0051527openalex-snapshot
Integration of complex shapes and natural patterns
inferred← citeshttps://doi.org/10.31274/rtd-180813-10480openalex-snapshot
Collision-free path planning
inferred← citeshttps://doi.org/10.5220/0001640001160123openalex-snapshot
HIERARCHICAL SPLINE PATH PLANNING METHOD FOR COMPLEX ENVIRONMENTS
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.