On the public citation graph

On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space

https://doi.org/10.1007/bf02187883
0 signed · 64 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.1007/bf02122559openalex-snapshot
Improved lower bounds on the length of Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/bf02187867openalex-snapshot
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bf02579209openalex-snapshot
Almost linear upper bounds on the length of general davenport—schinzel sequences
inferredcites →https://doi.org/10.1109/sfcs.1983.13openalex-snapshot
Dynamic computational geometry
inferredcites →https://doi.org/10.1145/323233.323262openalex-snapshot
An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)
inferredcites →https://doi.org/10.4064/aa-25-2-213-224openalex-snapshot
On a problem of Davenport and Schinzel

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpa.3160480910openalex-snapshot
Robot motion planning
inferred← citeshttps://doi.org/10.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_30openalex-snapshot
On the bivariate function minimization problem and its applications to motion planning
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9openalex-snapshot
From Linear Operators to Computational Biology
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9_6openalex-snapshot
Jack Schwartz and Robotics: The Roaring Eighties
inferred← citeshttps://doi.org/10.1007/978-1-4613-8997-2_26openalex-snapshot
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_5openalex-snapshot
Stabbing Convex Polygons with a Segment or a Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/bf02122559openalex-snapshot
Improved lower bounds on the length of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1007/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferred← citeshttps://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferred← citeshttps://doi.org/10.1007/bf02711511openalex-snapshot
A near-linear algorithm for the planar segment-center problem
inferred← citeshttps://doi.org/10.1007/bf02716803openalex-snapshot
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1007/bf02770875openalex-snapshot
On critical orientations in the kedem-sharir motion planning algorithm
inferred← citeshttps://doi.org/10.1007/bfb0035856openalex-snapshot
Polygon placement under translation and rotation
inferred← citeshttps://doi.org/10.1007/pl00009402openalex-snapshot
Motion Planning in Environments with Low Obstacle Density
inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot
Motion Planning for a Convex Polygon in a Polygonal Environment
inferred← citeshttps://doi.org/10.1007/s00454-003-2928-3openalex-snapshot
The Union of Congruent Cubes in Three Dimensions
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90053-7openalex-snapshot
A survey of motion planning and related geometric algorithms
inferred← citeshttps://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
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(93)90007-sopenalex-snapshot
The complexity of the free space for a robot moving amidst fat obstacles
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)00052-6openalex-snapshot
All convex polyhedra can be clamped with parallel jaw grippers
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00030-8openalex-snapshot
Combinatorial complexity of translating a box in polyhedral 3-space
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00020-0openalex-snapshot
The union of moving polygonal pseudodiscs — Combinatorial bounds and applications
inferred← citeshttps://doi.org/10.1051/ita/1989230100051openalex-snapshot
Polygon placement under translation and rotation
inferred← citeshttps://doi.org/10.1051/ita/1992260503871openalex-snapshot
Enumerating Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/icpr.1988.28392openalex-snapshot
A geometric approach to inspection
inferred← citeshttps://doi.org/10.1109/sfcs.1986.43openalex-snapshot
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366849openalex-snapshot
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1109/tro.2004.829479openalex-snapshot
A Geometric Method for Determining Intersection Relations Between a Movable Convex Object and a Set of Planar 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/109648.109668openalex-snapshot
Extremal polygon containment problems
inferred← citeshttps://doi.org/10.1145/160985.160992openalex-snapshot
Combinatorial complexity of translating a box in polyhedral 3-space
inferred← citeshttps://doi.org/10.1145/2462356.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2493132.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2794075openalex-snapshot
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/378583.378598openalex-snapshot
The union of congruent cubes in three dimensions
inferred← citeshttps://doi.org/10.1145/73393.73427openalex-snapshot
An automatic motion planning system for a convex polygonal mobile robot in 2-dimensional polygonal space
inferred← citeshttps://doi.org/10.1201/9781439864524-17openalex-snapshot
Largest Placem ents and M otion Planning of a Convex Polygon
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.5555/1070432.1070502openalex-snapshot
Pianos are not flat: rigid motion planning in three dimensions
inferred← citeshttps://doi.org/10.5555/314464.314482openalex-snapshot
A near-linear algorithm for the planar segment center problem
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.