On the public citation graph
L 1 shortest paths among polygonal obstacles in the plane
0 signed · 168 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.
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.
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/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01530888openalex-snapshot
A new algorithm for shortest paths among obstacles in the plane
inferredcites →https://doi.org/10.1007/bf01762115openalex-snapshot
An algorithm for segment-dragging and its implementation
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bfb0017133openalex-snapshot
3-dimensional shortest paths in the presence of polyhedral obstacles
inferredcites →https://doi.org/10.1016/0012-365x(92)90316-8openalex-snapshot
Davenport-Schinzel theory of matrices
inferredcites →https://doi.org/10.1016/0020-0190(85)90029-8openalex-snapshot
An algorithm for shortest-path motion in three dimensions
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.1016/0734-189x(84)90142-7openalex-snapshot
Some methods of computational geometry applied to computer graphics
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferredcites →https://doi.org/10.1137/0210035openalex-snapshot
A New Approach to Planar Point Location
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.1137/0216049openalex-snapshot
On Some Distance Problems in Fixed Orientations
inferredcites →https://doi.org/10.1137/0217026openalex-snapshot
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
inferredcites →https://doi.org/10.1137/0220029openalex-snapshot
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
inferredcites →https://doi.org/10.1137/0404002openalex-snapshot
An Extremal Problem on Sparse 0-1 Matrices
inferredcites →https://doi.org/10.1145/28395.28402openalex-snapshot
Approximation algorithms for shortest path motion planning
inferredcites →https://doi.org/10.1145/323233.323260openalex-snapshot
Rectilinear shortest paths with rectangular barriers
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/41958.41985openalex-snapshot
Rectilinear shortest paths through polygonal obstacles in O ( n (log n ) 2 ) time
inferredcites →https://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferredcites →https://doi.org/10.1145/73393.73411openalex-snapshot
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
inferredcites →https://doi.org/10.1145/98524.98595openalex-snapshot
Shortest rectilinear paths among weighted obstacles
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.10038openalex-snapshot
Dominating sets for rectilinear center location problems with polyhedral barriers
inferred← citeshttps://doi.org/10.1002/nav.21492openalex-snapshot
Optimal path finding in direction, location, and time dependent environments
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/11940128_20openalex-snapshot
Optimal Construction of the City Voronoi Diagram
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-62034-6_39openalex-snapshot
Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles
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-1-4419-7997-1_47openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-6243-9_10openalex-snapshot
Dynamic Navigation in Direction-Dependent Environments
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_509openalex-snapshot
Geometric Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_2openalex-snapshot
Rectilinear Shortest Paths Among Transient Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-030-57852-7_8openalex-snapshot
Path Planning with Objectives Minimum Length and Maximum Clearance
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_22openalex-snapshot
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_26openalex-snapshot
Range Queries on Uncertain Data
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/978-3-642-00202-1_7openalex-snapshot
All Farthest Neighbors in the Presence of Highways and Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-642-22922-0_19openalex-snapshot
MSSQ: Manhattan Spatial Skyline Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_41openalex-snapshot
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_7openalex-snapshot
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_27openalex-snapshot
Angle-Restricted Steiner Arborescences for Flow Map Layout
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_509-1openalex-snapshot
Geometric Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_6openalex-snapshot
Farthest Voronoi Diagrams under Travel Time Metrics
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_6openalex-snapshot
Group Nearest Neighbor Queries in the L 1 Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_2openalex-snapshot
Geodesic-Preserving Polygon Simplification
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/pl00009199openalex-snapshot
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains
inferred← citeshttps://doi.org/10.1007/s00453-002-0997-yopenalex-snapshot
Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals
inferred← citeshttps://doi.org/10.1007/s00453-013-9809-9openalex-snapshot
The k-Nearest-Neighbor Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1007/s00453-013-9867-zopenalex-snapshot
Angle-Restricted Steiner Arborescences for Flow Map Layout
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-022-01094-9openalex-snapshot
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
inferred← citeshttps://doi.org/10.1007/s00454-016-9841-zopenalex-snapshot
Computing the $$L_1$$ Geodesic Diameter and Center of a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/s00454-019-00112-yopenalex-snapshot
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s00493-025-00187-7openalex-snapshot
A Refutation of the Pach-Tardos Conjecture for 0–1 Matrices
inferred← citeshttps://doi.org/10.1007/s10479-005-2037-1openalex-snapshot
A Wavefront Approach to Center Location Problems with Barriers
inferred← citeshttps://doi.org/10.1007/s10479-012-1063-zopenalex-snapshot
Rectilinear distance to a facility in the presence of a square barrier
inferred← citeshttps://doi.org/10.1007/s10479-015-1790-zopenalex-snapshot
The 1-Center and 1-Highway problem revisited
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.1007/s10878-020-00604-1openalex-snapshot
Shortest paths among transient obstacles
inferred← citeshttps://doi.org/10.1007/s10957-012-0248-6openalex-snapshot
Fastest-Path Planning for Direction-Dependent Speed Functions
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(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00297-5openalex-snapshot
An efficient algorithm for facility location in the presence of forbidden regions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.acha.2012.11.002openalex-snapshot
Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): An initial value ODEʼs approach
inferred← citeshttps://doi.org/10.1016/j.amc.2005.07.060openalex-snapshot
Computation of arc length in the presence of barriers in networks
inferred← citeshttps://doi.org/10.1016/j.amc.2006.06.128openalex-snapshot
Finding shortest path in the presence of barriers: An alternate approach
inferred← citeshttps://doi.org/10.1016/j.amc.2014.03.100openalex-snapshot
A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
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.2015.10.007openalex-snapshot
Optimal time-convex hull for a straight-line highway in L-metrics
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101685openalex-snapshot
Rectilinear link diameter and radius in a rectilinear polygonal domain
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101796openalex-snapshot
Shortest rectilinear path queries to rectangles in a rectangular domain
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.cor.2007.10.023openalex-snapshot
Finding rectilinear least cost paths in the presence of convex polygonal congested regions
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.014openalex-snapshot
On routing in VLSI design and communication networks
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.003openalex-snapshot
Rectilinear paths with minimum segment lengths
inferred← citeshttps://doi.org/10.1016/j.disc.2011.06.020openalex-snapshot
Degrees of nonlinearity in forbidden 0–1 matrix problems
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114303openalex-snapshot
Extremal bounds for pattern avoidance in multidimensional 0-1 matrices
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.03.003openalex-snapshot
L1 cheapest paths in “Fjord Scenery”
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.08.029openalex-snapshot
Placing a finite size facility with a center objective on a rectangular plane with barriers
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.02.032openalex-snapshot
Conditional facility location problems with continuous demand and a polygonal barrier
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.02.129openalex-snapshot
Geographic knowledge discovery from Web Map segmentation through generalized Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.008openalex-snapshot
Flying over a polyhedral terrain
inferred← citeshttps://doi.org/10.1016/j.is.2013.10.001openalex-snapshot
MSSQ: Manhattan Spatial Skyline Queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.011openalex-snapshot
Group nearest-neighbor queries in the L1 plane
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.005openalex-snapshot
Range queries on uncertain data
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.1016/s0925-7721(01)00005-0openalex-snapshot
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model☆☆This research was supported in part by the National Science Foundation under grants CCR-9623585 and CCR-9988468.
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1016/s0960-0779(02)00409-5openalex-snapshot
Reaction–diffusion path planning in a hybrid chemical and cellular-automaton processor
inferred← citeshttps://doi.org/10.1023/a:1026175313503openalex-snapshot
Locating a 1-Center on a Manhattan Plane with “Arbitrarily” Shaped Barriers
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/icacte.2010.5579834openalex-snapshot
Algorithm for finding geodesic path based on rotation tree
inferred← citeshttps://doi.org/10.1109/iccad45719.2019.8942116openalex-snapshot
Global routing on rhomboidal tiles
inferred← citeshttps://doi.org/10.1109/iros.2001.977191openalex-snapshot
3D rectilinear motion planning with minimum bend paths
inferred← citeshttps://doi.org/10.1109/robot.2006.1641819openalex-snapshot
Path planning above a polyhedral terrain
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267794openalex-snapshot
Computing a shortest k-link path in a polygon
inferred← citeshttps://doi.org/10.1109/tcad.2003.814249openalex-snapshot
New approximations for the rectilinear steiner arborescence problem
inferred← citeshttps://doi.org/10.1109/tcad.2012.2185050openalex-snapshot
Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611977912.45openalex-snapshot
On the Extremal Functions of Acyclic Forbidden 0-1 Matrices
inferred← citeshttps://doi.org/10.1137/20m1376327openalex-snapshot
Saturation Problems about Forbidden 0-1 Submatrices
inferred← citeshttps://doi.org/10.1137/s0097539703434267openalex-snapshot
Optimal Covering Tours with Turn Costs
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/s0218195901000675openalex-snapshot
ON GEOMETRIC PATH QUERY PROBLEMS
inferred← citeshttps://doi.org/10.1142/s021819590900285xopenalex-snapshot
OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
inferred← citeshttps://doi.org/10.1142/s0218195914600097openalex-snapshot
GEODESIC-PRESERVING POLYGON SIMPLIFICATION
inferred← citeshttps://doi.org/10.1142/s0218195915500053openalex-snapshot
Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane
inferred← citeshttps://doi.org/10.1145/160985.161156openalex-snapshot
Shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1145/1629911.1629998openalex-snapshot
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction
inferred← citeshttps://doi.org/10.1145/1687399.1687406openalex-snapshot
Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection
inferred← citeshttps://doi.org/10.1145/1998196.1998258openalex-snapshot
On the structure and composition of forbidden sequences, with geometric applications
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/2582112.2582125openalex-snapshot
Two-Point L1 Shortest Path Queries in the Plane
inferred← citeshttps://doi.org/10.1145/262839.262983openalex-snapshot
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)
inferred← citeshttps://doi.org/10.1145/2666310.2666418openalex-snapshot
Minimum backward fréchet distance
inferred← citeshttps://doi.org/10.1145/336154.336182openalex-snapshot
On the continuous Weber and k -median problems (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.1145/997817.997839openalex-snapshot
New results on shortest paths in three dimensions
inferred← citeshttps://doi.org/10.1287/opre.1040.0137openalex-snapshot
On the Continuous Fermat-Weber Problem
inferred← citeshttps://doi.org/10.18130/v3gw0mopenalex-snapshot
Geometric Interconnection and Placement Algorithms
inferred← citeshttps://doi.org/10.22215/etd/2016-11226openalex-snapshot
Discrete Geometric Path Analysis in Computational Geometry
inferred← citeshttps://doi.org/10.22215/etd/2019-13533openalex-snapshot
Shortest Paths Among Dynamic Obstacles
inferred← citeshttps://doi.org/10.2514/6.2010-8292openalex-snapshot
A Sectorization Method for Dynamic Airspace Configuration
inferred← citeshttps://doi.org/10.37236/10124openalex-snapshot
Almost all Permutation Matrices have Bounded Saturation Functions
inferred← citeshttps://doi.org/10.3970/cmes.2005.008.001openalex-snapshot
A Geometrical Approach for Solving 2D Eikonal Equation
inferred← citeshttps://doi.org/10.4108/icst.robocomm2007.2085openalex-snapshot
Path Planning using Shi and Karl Level Sets
inferred← citeshttps://doi.org/10.4230/lipics.socg.2019.59openalex-snapshot
A Divide-and-Conquer Algorithm for Two-Point $L_1$ Shortest Path Queries in Polygonal Domains
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.47443/dml.2022.151openalex-snapshot
Saturation of Multidimensional 0-1 Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1309.1807openalex-snapshot
Aggregate-Max Nearest Neighbor Searching in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1403.3458openalex-snapshot
Two-Point $L_1$ Shortest Path Queries in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1501.02309openalex-snapshot
Range Queries on Uncertain Data
inferred← citeshttps://doi.org/10.48550/arxiv.1703.04466openalex-snapshot
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1809.08898openalex-snapshot
Rectilinear Shortest Paths Among Transient Obstacles
inferred← citeshttps://doi.org/10.48550/arxiv.2106.15885openalex-snapshot
Optimal Construction for Time-Convex Hull with Two Orthogonal Highways in the L1-metric
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0309014openalex-snapshot
Optimal Covering Tours with Turn Costs
inferred← citeshttps://doi.org/10.5555/1377868.1377918openalex-snapshot
Path planning using Shi and Karl level sets
inferred← citeshttps://doi.org/10.5555/313651.313710openalex-snapshot
On the all-pairs Euclidean short path problem
inferred← citeshttps://doi.org/10.5555/365411.365430openalex-snapshot
Optimal covering tours with turn costs
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
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.