On the public citation graph
On some union and intersection problems for polygons with fixed orientations
0 signed · 23 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.1007/3-540-12689-9_105openalex-snapshot
Fast triangulation of simple polygons
inferredcites →https://doi.org/10.1007/bfb0030329openalex-snapshot
Solving visibility problems by using skeleton structures
inferredcites →https://doi.org/10.1016/0020-0190(83)90010-8openalex-snapshot
Stabbing c-oriented polygons
inferredcites →https://doi.org/10.1016/0196-6774(81)90027-4openalex-snapshot
The measure problem for rectangular ranges in d-space
inferredcites →https://doi.org/10.1016/0196-6774(82)90016-5openalex-snapshot
Rectilinear line segment intersection, layered segment trees, and dynamization
inferredcites →https://doi.org/10.1016/s0019-9958(84)80011-xopenalex-snapshot
Dynamic C-oriented polygonal intersection searching
inferredcites →https://doi.org/10.1051/ita/1984180201711openalex-snapshot
Computing the connected components of simple rectilinear geometrical objects in $d$-space
inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1145/323233.323258openalex-snapshot
Distance problems in computational geometry with fixed orientations
inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot
Plane-sweep algorithms for intersecting geometric figures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01231029openalex-snapshot
A decomposition theorem for convexity spaces
inferred← citeshttps://doi.org/10.1007/bfb0042806openalex-snapshot
Computational geometry with restricted orientations
inferred← citeshttps://doi.org/10.1007/s10878-025-01373-5openalex-snapshot
Dominance for enclosure problems
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90054-xopenalex-snapshot
Restricted-oriented convex sets
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/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1023/a:1009837006569openalex-snapshot
Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems
inferred← citeshttps://doi.org/10.1109/miv.1989.40550openalex-snapshot
Rule-based implementation of correct and efficient VLSI design rule checking
inferred← citeshttps://doi.org/10.1137/0216049openalex-snapshot
On Some Distance Problems in Fixed Orientations
inferred← citeshttps://doi.org/10.1184/r1/6609077openalex-snapshot
Restricted-Orientation Convexity in Higher-Dimensional Spaces
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.