On the public citation graph

Rectilinear shortest paths in the presence of rectangular barriers

https://doi.org/10.1007/bf02187714
0 signed · 91 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/net.3230110307openalex-snapshot
Finding minimum rectilinear distance paths in the presence of barriers
inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/0-387-22081-x_14openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01840436openalex-snapshot
Visibility of disjoint polygons
inferredcites →https://doi.org/10.1016/0020-0190(84)90022-xopenalex-snapshot
Algebraic approach to p-adic conversion of rational numbers
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
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/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.5957/jsr.1974.18.1.46openalex-snapshot
Minimum-Trajectory Pipe Routing

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cta.4490190604openalex-snapshot
An optimal algorithm for rectilinear steiner trees for channels with obstacles
inferred← citeshttps://doi.org/10.1002/net.3230220404openalex-snapshot
Paths through a maze of rectangles
inferred← citeshttps://doi.org/10.1006/jagm.1998.0939openalex-snapshot
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_5openalex-snapshot
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_91openalex-snapshot
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_26openalex-snapshot
Restricted orientation computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_53openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_29openalex-snapshot
Rectilinear path queries in a simple rectilinear polygon
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_276openalex-snapshot
Efficient approximate shortest-path queries among isothetic rectangular obstacles
inferred← citeshttps://doi.org/10.1007/3-540-57314-3_8openalex-snapshot
Shortest non-synchronized motions parallel versions for shared memory crew models
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_55openalex-snapshot
Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_239openalex-snapshot
Finding shortest non-crossing rectilinear paths in plane regions
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_39openalex-snapshot
Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_63openalex-snapshot
An efficient algorithm for shortest paths in vertical and horizontal segments
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_35openalex-snapshot
An algorithm for finding a region with the minimum total L 1 from prescribed terminals
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_7openalex-snapshot
Rectilinear Path Problems in Restricted Memory Setup
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_34openalex-snapshot
Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures
inferred← citeshttps://doi.org/10.1007/bf01206332openalex-snapshot
Optimal parallel algorithms for rectilinear link-distance problems
inferred← citeshttps://doi.org/10.1007/bf01222679openalex-snapshot
L1-embeddability of rectilinear polygons with holes
inferred← citeshttps://doi.org/10.1007/bf02067242openalex-snapshot
On graphs preserving rectilinear shortest paths in the presence of obstacles
inferred← citeshttps://doi.org/10.1007/bf02523193openalex-snapshot
Proximity problems for points on a rectilinear plane with rectangular obstacles
inferred← citeshttps://doi.org/10.1007/bfb0009476openalex-snapshot
Applications of a numbering scheme for polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bfb0015407openalex-snapshot
Finding a shortest pair of paths on the plane with obstacles and crossing areas
inferred← citeshttps://doi.org/10.1007/bfb0028268openalex-snapshot
Geometric searching and link distance
inferred← citeshttps://doi.org/10.1007/bfb0028272openalex-snapshot
On bends and lengths of rectilinear paths: A graph-theoretic approach
inferred← citeshttps://doi.org/10.1007/bfb0028273openalex-snapshot
Computing minimum length paths of a given homotopy class
inferred← citeshttps://doi.org/10.1007/s00373-023-02744-7openalex-snapshot
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric
inferred← citeshttps://doi.org/10.1007/s00453-016-0263-3openalex-snapshot
Geometric Path Problems with Violations
inferred← citeshttps://doi.org/10.1007/s00453-018-00540-xopenalex-snapshot
Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-018-0446-1openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.1007/s10878-020-00524-0openalex-snapshot
Computing an $$L_1$$ shortest path among splinegonal obstacles in the plane
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00020-8openalex-snapshot
Rectilinear short path queries among rectangular obstacles
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00115-8openalex-snapshot
A multifacility location problem on median spaces
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90002-vopenalex-snapshot
Parallel rectilinear shortest paths with rectangular obstacles
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90010-copenalex-snapshot
On rectilinear link distance
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90004-popenalex-snapshot
On parallel rectilinear obstacle- avoiding paths
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90010-8openalex-snapshot
Computing minimum length paths of a given homotopy class
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50013-9openalex-snapshot
Link Distance Problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.02.005openalex-snapshot
Planar rectilinear shortest path computation using corridors
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101858openalex-snapshot
Minimum-link shortest paths for polygons amidst rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.031openalex-snapshot
Rectilinear path problems in restricted memory setup
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00280-8openalex-snapshot
Lower bounds for computing geometric spanners and approximate shortest paths
inferred← citeshttps://doi.org/10.1023/a:1007982023427openalex-snapshot
Optimal Collision Free Path Planning for Non-Synchronized Motions
inferred← citeshttps://doi.org/10.1109/12.286304openalex-snapshot
On bends and distances of paths among obstacles in two-layer interconnection model
inferred← citeshttps://doi.org/10.1109/12.609280openalex-snapshot
The smallest pair of noncrossing paths in a rectilinear polygon
inferred← citeshttps://doi.org/10.1109/43.144850openalex-snapshot
Smallest paths in simple rectilinear polygons
inferred← citeshttps://doi.org/10.1109/43.24884openalex-snapshot
On routing two-terminal nets in the presence of obstacles
inferred← citeshttps://doi.org/10.1109/43.486276openalex-snapshot
Finding obstacle-avoiding shortest paths using implicit connection graphs
inferred← citeshttps://doi.org/10.1109/81.153636openalex-snapshot
An algorithm for exact rectilinear Steiner trees for switchbox with obstacles
inferred← citeshttps://doi.org/10.1109/date.1998.655877openalex-snapshot
A sequential detailed router for huge grid graphs
inferred← citeshttps://doi.org/10.1109/iccad.1991.185175openalex-snapshot
A cell-replicating approach to minicut-based circuit partitioning
inferred← citeshttps://doi.org/10.1109/iccad.1991.185325openalex-snapshot
Switchbox Steiner tree problem in presence of obstacles
inferred← citeshttps://doi.org/10.1109/icccs.2009.16openalex-snapshot
Application of Improved Ant Colony Algorithm in Integrated Circuit Routing
inferred← citeshttps://doi.org/10.1109/icvd.1993.669645openalex-snapshot
Euclidean Shortest Path Problem with Rectilinear Obstacles
inferred← citeshttps://doi.org/10.1109/icvd.1996.489453openalex-snapshot
Routing using implicit connection graphs [VLSI design]
inferred← citeshttps://doi.org/10.1109/iros.2001.977191openalex-snapshot
3D rectilinear motion planning with minimum bend paths
inferred← citeshttps://doi.org/10.1109/secon.1993.465749openalex-snapshot
Efficient maze-running and line-search algorithms for VLSI layout
inferred← citeshttps://doi.org/10.1109/tc.1987.1676904openalex-snapshot
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
inferred← citeshttps://doi.org/10.1109/tcad.2003.814249openalex-snapshot
New approximations for the rectilinear steiner arborescence problem
inferred← citeshttps://doi.org/10.1137/s0097539792229672openalex-snapshot
Rectilinear Path Problems among Rectilinear Obstacles Revisited
inferred← citeshttps://doi.org/10.1137/s0097539796307194openalex-snapshot
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
inferred← citeshttps://doi.org/10.1142/s021819599900011xopenalex-snapshot
A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS
inferred← citeshttps://doi.org/10.1145/157485.165064openalex-snapshot
A negative reinforcement method for PGA routing
inferred← citeshttps://doi.org/10.1145/220279.220319openalex-snapshot
Shortest path queries among weighted obstacles in the rectilinear plane
inferred← citeshttps://doi.org/10.1145/220279.220320openalex-snapshot
Rectilinear geodesics in 3-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/3406325.3451037openalex-snapshot
A new algorithm for Euclidean shortest paths in the plane
inferred← citeshttps://doi.org/10.1145/3580475openalex-snapshot
A New Algorithm for Euclidean Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1145/378583.378657openalex-snapshot
Farthest neighbors and center points in the presence of rectngular obstacles
inferred← citeshttps://doi.org/10.1163/156855398x00037openalex-snapshot
Motion planning in isothetic workspaces
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.293openalex-snapshot
L_1 Shortest Path Queries among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.47749/t/unicamp.2005.364088openalex-snapshot
Alguns problemas em geometrias de curvas
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06842openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.48550/arxiv.2102.12589openalex-snapshot
A New Algorithm for Euclidean Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.5555/368058.368167openalex-snapshot
A sequential detailed router for huge grid graphs
inferred← citeshttps://doi.org/10.55653/forma.2022.001.005openalex-snapshot
Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
inferred← citeshttps://doi.org/10.7155/jgaa.00541openalex-snapshot
Enumerating Grid Layouts of Graphs
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.