On the public citation graph

Rectilinear computational geometry

https://doi.org/10.82308/4930
0 signed · 33 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 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-17943-7_124openalex-snapshot
Computing on a systolic screen: Hulls, contours and applications
inferred← citeshttps://doi.org/10.1007/978-3-319-48532-4_10openalex-snapshot
Minimum Rectilinear Polygons for Given Angle Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-18849-7openalex-snapshot
Restricted-Orientation Convexity
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_24openalex-snapshot
Some Collision Avoidance Problems in the Plane
inferred← citeshttps://doi.org/10.1007/bf01187021openalex-snapshot
A workbench for computational geometry
inferred← citeshttps://doi.org/10.1007/bf01206332openalex-snapshot
Optimal parallel algorithms for rectilinear link-distance problems
inferred← citeshttps://doi.org/10.1007/bf01231029openalex-snapshot
A decomposition theorem for convexity spaces
inferred← citeshttps://doi.org/10.1007/bf01759069openalex-snapshot
Computational geometry algorithms for the systolic screen
inferred← citeshttps://doi.org/10.1007/bf01905560openalex-snapshot
Visibility problems for orthogonal objects in two-or three-dimensions
inferred← citeshttps://doi.org/10.1007/bf02187918openalex-snapshot
The orthogonal convex skull problem
inferred← citeshttps://doi.org/10.1007/bfb0028273openalex-snapshot
Computing minimum length paths of a given homotopy class
inferred← citeshttps://doi.org/10.1007/bfb0028276openalex-snapshot
Optimum guard covers and m-watchmen routes for restricted polygons
inferred← citeshttps://doi.org/10.1007/bfb0035855openalex-snapshot
An optimal algorithm for detecting weak visibility of a polygon
inferred← citeshttps://doi.org/10.1007/bfb0042806openalex-snapshot
Computational geometry with restricted orientations
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90054-xopenalex-snapshot
Restricted-oriented convex sets
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90077-lopenalex-snapshot
On covering orthogonal polygons with star-shaped polygons
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90045-9openalex-snapshot
Optimal computation of finitely oriented convex hulls
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90010-copenalex-snapshot
On rectilinear link distance
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/0925-7721(96)00014-4openalex-snapshot
Generalized guarding and partitioning for rectilinear polygons
inferred← citeshttps://doi.org/10.1016/b978-0-444-70467-2.50016-3openalex-snapshot
Guard Placement in Rectilinear Polygons
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.11.002openalex-snapshot
Guarding curvilinear art galleries with vertex or point guards
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101820openalex-snapshot
Minimum rectilinear polygons for given angle sequences
inferred← citeshttps://doi.org/10.1109/cec45853.2021.9504843openalex-snapshot
The Sectional Art Gallery and an Evolutionary Algorithm for Approaching Its Minimum Point Guard Problem
inferred← citeshttps://doi.org/10.1109/ipps.1993.262857openalex-snapshot
Parallel algorithms for rectilinear link distance problems
inferred← citeshttps://doi.org/10.1142/s0218195993000063openalex-snapshot
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
inferred← citeshttps://doi.org/10.1145/10515.10520openalex-snapshot
Minimally covering a horizontally convex orthogonal polygon
inferred← citeshttps://doi.org/10.3850/978-981-07-1403-1_134openalex-snapshot
Finding the Visibility Matrix of an Orthogonal Polygon
inferred← citeshttps://doi.org/10.47749/t/unicamp.2000.202115openalex-snapshot
Convexidade e proximidade em geometrias não euclidianas
inferred← citeshttps://doi.org/10.6109/jicce.2011.9.1.105openalex-snapshot
Computing the Dominating-Free Set by Two Point Sets in the Plane
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.