On the public citation graph

Proximity problems for points on a rectilinear plane with rectangular obstacles

https://doi.org/10.1007/bf02523193
0 signed · 35 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.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferredcites →https://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187714openalex-snapshot
Rectilinear shortest paths in the presence of rectangular barriers
inferredcites →https://doi.org/10.1016/0022-0000(79)90054-0openalex-snapshot
On the complexity of computations under varying sets of primitives
inferredcites →https://doi.org/10.1016/0925-7721(91)90002-vopenalex-snapshot
Parallel rectilinear shortest paths with rectangular obstacles
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/tc.1987.1676904openalex-snapshot
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
inferredcites →https://doi.org/10.1137/0205051openalex-snapshot
Finding Minimum Spanning Trees
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0216049openalex-snapshot
On Some Distance Problems in Fixed Orientations
inferredcites →https://doi.org/10.1142/s0218195991000104openalex-snapshot
SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
inferredcites →https://doi.org/10.1142/s0218195992000056openalex-snapshot
ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/323233.323260openalex-snapshot
Rectilinear shortest paths with rectangular barriers
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/800113.803652openalex-snapshot
Divide-and-conquer in multidimensional space
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470317013.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1006/cviu.1996.0041openalex-snapshot
Image Analysis and Computer Vision: 1995
inferred← citeshttps://doi.org/10.1006/cviu.1998.0697openalex-snapshot
Image Analysis and Computer Vision: 1997
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-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/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.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.eswa.2012.02.129openalex-snapshot
Geographic knowledge discovery from Web Map segmentation through generalized Voronoi diagrams
inferred← citeshttps://doi.org/10.11361/journalcpij.42.3.457openalex-snapshot
A study on Voronoi diagrams with two-dimensional obstacles
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/378583.378657openalex-snapshot
Farthest neighbors and center points in the presence of rectngular obstacles
inferred← citeshttps://doi.org/10.3130/jaabe.7.271openalex-snapshot
AED Location in Public Spaces: A Case Study in Ueno Park Using Voronoi Diagrams with Obstacles
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.